Research Article

Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms

Table 3

The notation used for the formulation.

: the number of jobs: the earliness time of -th job
: the number of machines: due date time of -th job
: the number of routes: the penalty coefficient of early completion, 0,
: the number of operations: the penalty coefficient of late completion, 0,
: the arrival time of -th job: the penalty for due date
: the weight of the -th job: the penalty for earliness
: the total processing time of -th job: the penalty for tardiness
: the processing time of i-th operation of -th job: the penalty for -th job
: the mean processing time of all jobs waiting: the total penalty
: the departure time, the completion time of -th job: the performance function
: the lateness time of -th job: the number of due date assignment rules
: the tardiness time of -th job: the number of dispatching rules
: Priority index of -th job: the difference between due date and arrival time of job -th job