Worst-case analysis of heuristics for open shops with parallel machines

Abstract The paper considers the multi-stage open shop scheduling problem with a number of identical parallel machines at each stage. No preemption is allowed, and the objective is to minimize the makespan. Several heuristic algorithms are presented, and their worst-case performance is analyzed. In the case of two stages, a worst-case performance ratio strictly less than 2 is established.

[1]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[2]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[3]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[4]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[5]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[7]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[8]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[9]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[10]  Vitaly A. Strusevich,et al.  Approximation Algorithms for Three-Machine Open Shop Scheduling , 1993, INFORMS J. Comput..

[11]  Eugene L. Lawler,et al.  Scheduling open shops with parallel machines , 1982, Oper. Res. Lett..

[12]  Michael A. Langston,et al.  Evaluation of a MULTIFIT-Based Scheduling Algorithm , 1986, J. Algorithms.

[13]  Donald K. Friesen,et al.  Tighter Bounds for the Multifit Processor Scheduling Algorithm , 1984, SIAM J. Comput..

[14]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[15]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[16]  Michael A. Langston,et al.  Interstage Transportation Planning in the Deterministic Flow-Shop Environment , 1987, Oper. Res..

[17]  R. E. Buten,et al.  Scheduling model for computer systems with two classes of processors , 1972 .

[18]  Edward G. Coffman,et al.  A generalized bound on LPT sequencing , 1976, SIGMETRICS '76.