An analysis of heuristics in a dynamic job shop with weighted tardiness objectives

Meeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves tardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive literature survey on the topic, we measure the long-run performances of more than 20 single-pass dispatching rules under various experimental conditions. In this study, we pay special attention to recently proposed dispatching heuristics such as CEXSPT, CR+ SPT, S/RPT+ SPT, and Bottleneck Dynamics (BD). We also investigate the effects of six resource pricing schemes proposed recently for BD. Moreover, we extend the earlier versions of inserted idleness and identify the conditions in which these techniques can be applied without incurring too much computational cost. Future research directions are also outlined in light of...

[1]  Reha Uzsoy,et al.  Exploiting shop floor status information to schedule complex job shops , 1994 .

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

[3]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[4]  Larry R. Taube,et al.  Time completion for various dispatching rules in job shops , 1983 .

[5]  Randall P. Sadowski,et al.  Introduction to Simulation Using Siman , 1990 .

[6]  Sunder Kekre,et al.  SCHED-STAR A PRICE-BASED SHOP SCHEDULING MODULE , 1988 .

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

[8]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[9]  Jack C. Hayya,et al.  Priority dispatching with operation due dates in a job shop , 1982 .

[10]  Thomas E. Morton,et al.  Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .

[11]  James K. Weeks.  A Simulation Study of Predictable Due-Dates , 1979 .

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

[13]  T. Morton,et al.  Guided Forward Tabu/Beam Search for Scheduling Very Large Dynamic Job Shops , 1992 .

[14]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

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

[16]  Kenneth R. Baker,et al.  Job shop scheduling with modified due dates , 1983 .

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

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

[19]  Thomas E. Morton,et al.  Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics , 1993 .

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

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

[22]  John J. Kanet,et al.  Note-On Anomalies in Dynamic Ratio Type Scheduling Rules: A Clarifying Analysis , 1982 .

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

[24]  Jwm Will Bertrand,et al.  A dynamic priority rule for scheduling against due-dates , 1982 .

[25]  Shigeji Miyazaki,et al.  Combined scheduling system for reducing job tardiness in a job shop , 1981 .