A comparative study of dispatching rules in dynamic flowshops and jobshops

This paper presents a comparative study on the performance of dispatching rules in the following sets of dynamic manufacturing systems: flowshops and jobshops, and flowshops with missing operations and jobshops. Three new dispatching rules are proposed. We consider a total of 13 dispatching rules for the analysis of the relative performance with respect to the objectives of minimizing mean flowtime, maximum flowtime, variance of flowtime, proportion of tardy jobs, mean tardiness, maximum tardiness and variance of tardiness. First, we carry out the simulation study in flowshops with jobs undergoing processing on all machines sequentially and in jobshops with random routeing of jobs. The results of the study reveal some interesting observations on the relative performance of the dispatching rules in these two types of manufacturing systems. Next, we consider flowshops with missing operations on jobs and jobshops with random routeing of jobs. We observe some interesting results in the sense that the performance of dispatching rules is being influenced by the routeing of jobs and shopfloor configurations.

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

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

[3]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[4]  Randall P. Sadowski,et al.  A statistical comparison of the performance of simple dispatching rules for a particular set of job shops , 1976 .

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

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

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

[8]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[9]  T. S. Raghu,et al.  An efficient dynamic dispatching rule for scheduling in a job shop , 1993 .

[10]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[12]  Averill M. Law,et al.  Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures , 1984, Oper. Res..

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

[14]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

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

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

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

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

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

[20]  James E. Day,et al.  Review of sequencing research , 1970 .

[21]  Virgil L. Anderson,et al.  Design of experiments : a no-name approach , 1993 .

[22]  Gary D. Scudder,et al.  The use of cost-based priorities in random and flow shops , 1987 .

[23]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[24]  Dean H. Kropp,et al.  Lot Splitting in Stochastic Flow Shop and Job Shop Environments , 1996 .

[25]  Peter R. Nelson,et al.  Design and Analysis of Experiments, 3rd Ed. , 1991 .

[26]  Edward Anderson,et al.  Two new rules to minimize tardiness in a job shop , 1990 .

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

[28]  C. T. Baker,et al.  Simulation of a Simplified Job Shop , 1960 .