A comparative study of some priority dispatching rules under different shop loads

Abstract Priority dispatching rules and shop load affect job-shop performance. This paper evaluates ten different priority dispatching rules with respect to six different performance criteria under light, medium and heavy shop loads. Simulation was used as a tool to determine the rankings of the dispatching rules for a given shop load and performance criteria. A comparative study was conducted to investigate the performance of these rules. Two rules, ‘shortest processing time” and ‘least work remaining’, performed well under criteria related to the processing time. It was found that the rules that perform well in average and r.m.s. tardiness perform poorly under percentage-of-jobs-late criterion. The experimental results are conveyed with critical comments on the performance of the dispatching rules under different loading conditions of the shop.

[1]  William L. Berry,et al.  Priority Scheduling and Inventory Control in Job Lot Manufacturing Systems , 1972 .

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

[3]  Yeong-Dae Kim.  A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings , 1990 .

[4]  Charles A. Holloway,et al.  Job Shop Scheduling with Due Dates and Variable Processing Times , 1974 .

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

[6]  Farzad Mahmoodi,et al.  An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell , 1990 .

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

[8]  A. G. Lockett,et al.  Job shop scheduling heuristics and frequency of scheduling , 1982 .

[9]  Charles R. White.  Scheduling to minimize tardiness , 1991 .

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

[11]  M. J. Zeestraten.  The look ahead dispatching procedure , 1990 .

[12]  Randall P. Sadowski,et al.  Scheduling Algorithms for the Unbalanced Production Line: An Analysis and Comparison , 1978 .

[13]  John J. Kanet,et al.  Manufacturing systems with forbidden early shipment: implications for choice of scheduling rules , 1990 .

[14]  Timothy D. Fry,et al.  A simulation study of processing time dispatching rules , 1988 .

[15]  Bernard W. Taylor,et al.  An evaluation of scheduling policies in a dual resource constrained assembly shop , 1985 .

[16]  Chandrasekharan Rajendran,et al.  Evaluation of heuristics for scheduling in a flowshop: a case study , 1993 .

[17]  Carl R. Schultz,et al.  An expediting heuristic for the shortest processing time dispatching rule , 1989 .

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

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

[20]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..