Sevast'yanov's algorithm for the flow-shop scheduling problem

Abstract We consider the flow-shop scheduling problem. The objective is to schedule the jobs on the machines so that we minimize the time by which all jobs are completed. We studied and implemented different versions of the algorithm of Sevast'yanov based on linear programming to solve this problem. Using CPLEX, we did computational tests with random instances having up to 1000 jobs and 100 machines. If the size of the flow-shop scheduling problem is small or if the running time is not a critical factor, the Nawaz-Enscore-Ham approximation algorithm still performs better. But if the running time is an important factor, Sevast'yanov's algorithm can be a very good alternative especially in presence of very large scale instances with a relatively small number of machines.

[1]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[2]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[3]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

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

[5]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[6]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[7]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[8]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

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

[10]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[11]  David B. Shmoys,et al.  A computational study of the job-shop and the flow-shop scheduling problems , 1993 .

[12]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[13]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

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

[15]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[16]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

[17]  Jatinder N. D. Gupta,et al.  Heuristic Algorithms for Multistage Flowshop Scheduling Problem , 1972 .

[18]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[19]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[20]  S. Sevast’yanov.  Bounding algorithm for the routing problem with arbitrary paths and alternative servers , 1986 .