Research Article
A Genetic Algorithm for a Two-Machine Flowshop with a Limited Waiting Time Constraint and Sequence-Dependent Setup Times
Table 1
Notations for the description of the proposed algorithms.
| Symbol | Definition |
| | Set of jobs, | | Job indices | | Machine index | | Processing time of job on machine | | Due date of job | | Limited waiting time of job | | Sequence-dependent setup time between jobs and | | Index of the job at the position in a schedule | | 1 if job i is assigned to the rth position in a schedule and 0 otherwise | | 1 if jobs i and j are assigned consecutively to positions r and r + 1 and 0 otherwise | | Start time of the job on machine k | | Completion time of the job on machine k | | Tardiness of the job | Σ | Partial schedule | σi | Partial schedule obtained with σ followed by job i | U | Set of unscheduled jobs | | Completion time of partial schedule σ on machine k |
|
|