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

Authors:
John J. Kanet;Xiaoming Li
Affiliations:
Department of MIS, Operations Management, and Decision Sciences, University of Dayton, 300 College Park, Dayton, OH 45469-2130, USA/ E-mail: kanet@udayton.edu;Department of Business Administration, Tennessee State University, 330 10^th Avenue N., Nashville, TN 37203-3401, USA
Venue:
Journal of Scheduling
Year:
2004

Citing 10
Cited 7

Priority rules for job shops with weighted tardiness costs

Management Science
A note on the weighted tardiness problem

Operations Research
A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Weighted-tardiness scheduling on parallel machines with proportional weights

Operations Research
Weighted tardiness single machine scheduling with proportional weights

Management Science
BPSS: a scheduling support system for the packaging industry

Operations Research
A performance comparison of heuristics for the total weighted tardiness problem

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
A new lower bounding scheme for the total weighted tardiness problem

Computers and Operations Research
Improved heuristics for the n-job single-machine weighted tardiness problem

Computers and Operations Research

Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling

Computers and Operations Research
Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems

Computers and Industrial Engineering
An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem

Expert Systems with Applications: An International Journal
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

Journal of Scheduling
Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning

Computers and Operations Research
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

Computers and Operations Research
Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.