A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness

Priority dispatching for minimizing job tardiness has been the subject of research investigation for several decades. Minimizing weighted tardiness however has considerably more practical relevance, but for this objective only a few dispatching rules have been advanced and scientifically compared. We introduce here a new rule, which we call “Weighted Modified Due Date” (WMDD) and test its effectiveness against other competing rules that have been developed for weighted tardiness. The test is accomplished via a simulation study of a simple queueing system and by static problem analysis. The WMDD rule is found to compare favorably to all the rules tested.

[1]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[2]  Francis J. Vasko,et al.  A performance comparison of heuristics for the total weighted tardiness problem , 1997 .

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

[4]  A. Volgenant,et al.  Improved heuristics for the n-job single-machine weighted tardiness problem , 1999, Comput. Oper. Res..

[5]  Kenneth R. Baker,et al.  Improved decision rules in a combined system for minimizing job tardiness , 1984 .

[6]  Michael Pinedo,et al.  BPSS: A Scheduling Support System for the Packaging Industry , 1993, Oper. Res..

[7]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..

[8]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[9]  Michael Pinedo,et al.  A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .

[10]  C. Chu,et al.  Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem , 1992 .

[11]  Ram Rachamadugu,et al.  Real-time scheduling of an automated manufacturing center * , 1989 .

[12]  W. Szwarc,et al.  Weighted Tardiness Single Machine Scheduling with Proportional Weights , 1993 .

[13]  D. B. Duncan.  MULTIPLE RANGE AND MULTIPLE F TESTS , 1955 .

[14]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[15]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

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

[17]  Donald C Carroll,et al.  Heuristic sequencing of single and multiple component jobs. , 1965 .

[18]  M. Selim Akturk,et al.  A new lower bounding scheme for the total weighted tardiness problem , 1998, Comput. Oper. Res..

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

[20]  Esther M. Arkin,et al.  Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..

[21]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

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

[23]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[24]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

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

[26]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

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