Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

Several heuristics are presented for the flowshop scheduling problem with the objective of minimizing mean tardiness. We consider the cases in which job sequences on all machines are the same (permutation flowshop) and in which they may be different. For the former case, the various methods that have been devised for minimizing the makespan are modified for our objective, while the list scheduling algorithm is used for the latter case. These heuristics are tested and compared with each other on randomly-generated test problems.

[1]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[2]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

[3]  Thomas R. Hoffmann,et al.  Composite cost-based rules for priority scheduling in a randomly routed job shop , 1985 .

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

[5]  Said Ashour.  Letter to the Editor - An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques , 1970, Oper. Res..

[6]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

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

[8]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[9]  Imre Bárány,et al.  A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees , 1981, Math. Oper. Res..

[10]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

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

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

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

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

[15]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

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

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

[18]  Kenneth R. Baker,et al.  Job shop scheduling with modified due dates , 1983 .

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

[20]  Yeong-Dae Kim,et al.  On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems , 1987 .

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

[22]  Ezey M. Dar-El,et al.  Job shop scheduling—A systematic approach , 1982 .

[23]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

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

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

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

[27]  Larry R. Taube,et al.  Time completion for various dispatching rules in job shops , 1983 .

[28]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

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

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

[31]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[32]  Kenneth Steiglitz,et al.  Heuristic-Programming Solution of a Flowshop-Scheduling Problem , 1974, Oper. Res..

[33]  E. S. Page.  An Approach to the Scheduling of Jobs on Machines , 1961 .

[34]  Peter O'Grady,et al.  A general search sequencing rule for job shop sequencing , 1985 .

[35]  Bernard W. Taylor,et al.  A comparative analysis of the COVERT job sequencing rule using various shop performance measures , 1987 .

[36]  Eugeniusz Nowicki,et al.  Worst-case analysis of an approximation algorithm for flow-shop scheduling , 1989 .

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

[38]  William L. Berry,et al.  Critical Ratio Scheduling: An Experimental Analysis , 1975 .

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

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