A state-of-the-art survey of dispatching rules for manufacturing job shop operations

Abstract This paper reviews recent studies of dispatching rules. A dispatching rule is used to select the next job to be processed from a set of jobs awaiting service. The paper has two objectives. The first is to discuss the state of the art in the study of dispatching rules. The discussion includes analytical approaches, simulation techniques and evaluation criteria. The second objective of the paper is to compare several of the dispatching rules listed in the Appendix using the results of recently published studies. It is impossible to identify any single rule as the best in all circumstances. However, several rules have been identified as exhibiting good performance in general.

[1]  J. R. Jackson.  Networks of Waiting Lines , 1957 .

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

[3]  William L. Maxwell,et al.  Network Dispatching by the Shortest-Operation Discipline , 1962 .

[4]  A. Alan B. Pritsker,et al.  GERT - Graphical Evaluation and Review Technique , 1966 .

[5]  William S. Gere.  Heuristics in Job Shop Scheduling , 1966 .

[6]  R. T. Nelson.  Labor and Machine Limited Production Systems , 1967 .

[7]  Rosser T. Nelson.  Dual-Resource Constrained Series Service Systems , 1968, Oper. Res..

[8]  Samuel Eilon,et al.  A MODIFIED SI RULE IN JOB SHOP SCHEDULING , 1968 .

[9]  William L. Maxwell,et al.  Multiple‐factor rules for sequencing with assembly constraints , 1968 .

[10]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[11]  Rosser T. Nelson,et al.  A Research Methodology for Studying Complex Service Systems , 1969 .

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

[13]  George S. Fishman,et al.  Estimating Sample Size in Computing Simulation Experiments , 1971 .

[14]  C. L. Moodie,et al.  A Dispatching Methodology for Balancing Workload Assignments in a Job Shop Production Facility , 1972 .

[15]  Elwood Spencer Buffa,et al.  Operations management: problems and models , 1972 .

[16]  Jean-Louis Malouin,et al.  Evaluation of the Shortest Processing Time Scheduling Rule with Truncation Process , 1973 .

[17]  Don T. Phillips,et al.  Using an extended version of GERT to simulate priority and assignment rules in a labor limited jobshop system , 1973, WSC '73.

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

[19]  Douglas A. Elvers,et al.  The Sensitivity of the Relative Effectiveness of Job Shop Dispatching Rules with Respect to Various Arrival Distributions , 1974 .

[20]  Richard H. Deane,et al.  A Loading and Balancing Methodology for Job Shop Control , 1974 .

[21]  Don T. Phillips,et al.  GERTS QR: A Model for Multi-Resource Constrained Queueing Systems Part II: An Analysis of Parallel-Channel, Dual-Resource Constrained Queueing Systems with Homogeneous Resources , 1975 .

[22]  Gary L. Hogg,et al.  GERTS QR: A Model for Multi-Resource Constrained Queueing Systems Part I: Concepts, Notation, and Examples , 1975 .

[23]  Samuel Eilon,et al.  Experiments with the SIX rule in job-shop scheduling , 1975 .

[24]  Robert E. Shannon,et al.  Simulation: A Survey with Research Suggestions , 1975 .

[25]  Ronald J. Ebert,et al.  Search and Simulation Selection of a Job-Shop Sequencing Rule , 1975 .

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

[27]  Don T. Phillips,et al.  Parallel-Channel, Dual-Resource Constrained Queueing Systems with Heterogeneous Resources , 1977 .

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

[29]  David Burden,et al.  Production-Inventory Systems: Planning and Control , 1979 .