Reduction of job-shop problems to flow-shop problems with precedence constraints

We study the problem of scheduling N independent jobs in a job-shop environment. Each job must be processed on M machines according to individual routes. The objective is to minimize the maximum completion time of the jobs. First, the job-shop problem is reduced to a flow-shop problem with job precedence constraints. Then, a set of flow-shop algorithms are modified to solve it. To evaluate the quality of these heuristics, several lower bounds on the optimal solution have been computed and compared with the heuristic solutions for 3040 problems. The heuristics appear especially promising for job-shop problems with ‘flow-like’ properties.

[1]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[2]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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

[4]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

[5]  B. J. Lageweg,et al.  Surrogate duality relaxation for job shop scheduling , 1983, Discret. Appl. Math..

[6]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[7]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[8]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[9]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[10]  J. Carlier.  The one-machine sequencing problem , 1982 .

[11]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[12]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[13]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[14]  P. Bruckner,et al.  An efficient algorithm for the job-shop problem with two jobs , 1988 .

[15]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[16]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[17]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[18]  S. Akers.  Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[19]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[20]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[21]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

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

[23]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[24]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[25]  W. Townsend.  Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[26]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

[27]  Ching-Jong Liao,et al.  An Improved Formulation for the Job-Shop Scheduling Problem , 1992 .

[28]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[29]  William P. Darrow,et al.  The two-machine sequence dependent flowshop scheduling problem , 1986 .

[30]  S. S. Panwalkar,et al.  Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case , 1979 .

[31]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[32]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[33]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[34]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

[35]  Eugene L. Lawler,et al.  A solvable case of the traveling salesman problem , 1971, Math. Program..

[36]  Jeffrey B. Sidney,et al.  The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations , 1979, Oper. Res..

[37]  Clyde L. Monma.  The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..

[38]  Wlodzimierz Szwarc,et al.  Flow Shop Problems with Time Lags , 1983 .

[39]  K. S. Hindi,et al.  A review of artificial intelligence-based job-shop scheduling systems , 1991 .

[40]  Dileep R. Sule,et al.  Sequency on two and three machines with setup, processing and removal times separated , 1983 .

[41]  Jatinder N. D. Gupta,et al.  Flowshop scheduling with set-up, processing and removal times separated , 1991 .

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

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

[44]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[45]  Paul C. Gilmore.  Solvable Cases of the Travelling Salesman Problem , 1981 .

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

[47]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

[48]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .

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