Heuristics for scheduling in a flow shop with multiple processors

This study investigates the performance of scheduling heuristics in a flow shop with multiple processors. We investigated five better performing flow shop heuristics for their performances of makespan and mean flow time criteria in a flow shop with multiple processors. The study examined the effects of problem characteristics (number of jobs, number of machine stages and number of parallel processors at each stage) and the performance of heuristics using regression analysis. We found that although structural characteristics explain most of the variation in performance, heuristics also had an effect. The experimental results showed that flow shop heuristics developed by Nawaz, Enscore, and Ham and that of Ho were comparable in performance in a flow shop with multiple processors. However, the former was slightly more consistent in results for both criteria.

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

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

[3]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

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

[5]  J. R. Shah,et al.  Performance of priority rules in a due date flow shop , 1992 .

[6]  John L. Hunsucker,et al.  Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment , 1994 .

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

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

[9]  Shaukat A. Brah,et al.  A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors , 1996 .

[10]  Michael S. Salvador,et al.  A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .

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

[12]  John L. Hunsucker,et al.  Mathematical Modeling of Scheduling Problems , 1991 .

[13]  Robert J. Wittrock,et al.  Scheduling Algorithms for Flexible Flow Lines , 1985, IBM J. Res. Dev..

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

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

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

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

[18]  J. Gupta,et al.  Scheduling a two-stage hybrid flowshop with separable setup and removal times , 1994 .

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

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

[21]  D. Chaudhuri,et al.  A multi-stage parallel-processor flowshop problem with minimum flowtime , 1992 .

[22]  Martin Read.  The Structured Programming Aid: An Interactive Fortran Program Generator , 1983 .

[23]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

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

[25]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[26]  Chandrasekharan Rajendran,et al.  Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan , 1992 .

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

[28]  D. Santos,et al.  Global lower bounds for flow shops with multiple processors , 1995 .

[29]  Chandrasekharan Rajendran,et al.  A simulated annealing heuristic for scheduling in a flowshop with bicriteria , 1994 .

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

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

[32]  Chandrasekharan Rajendran,et al.  Scheduling in a cellular manufacturing system: a simulated annealing approach , 1993 .

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

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