Some results of the worst-case analysis for flow shop scheduling

Abstract Known approximation algorithms recommended for the permutation flow-shop problem with the weighted sum of completion times have a worst-case performance ratio which is unknown, or known but unlimited. We propose new algorithms with this ratio equal to [ m k]ϱ k , where ϱk is the worst-case performance ratio of an algorithm which solves an auxiliary k-machine problem. Worst-case analyses of other approximation algorithms for the mean completion time and the makespan criteria are also presented.

[1]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1996, Math. Oper. Res..

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

[3]  Frank Werner,et al.  On the heuristic solution of the permutation flow shop problem by path algorithms , 1993, Comput. Oper. Res..

[4]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[5]  Tsung-Chyan Lai,et al.  A Note on Heuristics of Flow-Shop Scheduling , 1996, Oper. Res..

[6]  D. Chaudhuri,et al.  An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .

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

[8]  Philip M. Morse,et al.  Methods of Operations Research , 1952 .

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

[10]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

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

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

[14]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[15]  Eugeniusz Nowicki,et al.  Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling , 1991, Oper. Res. Lett..

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

[17]  Sihgeji Miyazaki,et al.  AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM. , 1978 .

[18]  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..

[19]  Scott Turner,et al.  Comparison of heuristics for flow shop sequencing , 1987 .

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

[21]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

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

[23]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[24]  Shigeji Miyazaki,et al.  ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING , 1980 .

[25]  Eugeniusz Nowicki,et al.  New Results in the Worst-Case Analysis for Flow-Shop Scheduling , 1993, Discret. Appl. Math..

[26]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

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

[28]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

[29]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[30]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

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

[32]  Czesław Smutnicki,et al.  A note on worst-case analysis of approximation algorithms for a scheduling problem , 1994 .

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

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

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

[36]  B. Adenso-Díaz.  Restricted neighborhood in the tabu search for the flowshop problem , 1992 .

[37]  D. Chaudhuri,et al.  A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME , 1991 .

[38]  Czesław Smutnicki,et al.  Results of the worst-case analysis for some scheduling problem , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

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

[40]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria , 1994 .

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