20514

Two-Machine Flexible Flow-Shop Scheduling with Setup Times

2217

2225

9

This investigation studies two-machine flow-shop scheduling problems in which both machines are versatile and setup time is considered. First, a modified branch and bound algorithm for determining the optimal schedule is developed to minimize the makespan of jobs for these problems. Second, a genetic algorithm is used to rapidly find near-optimal schedules for large scale problems. Finally, computational experiments are performed to illustrate the effectiveness and efficiency of the proposed algorithms

1204551