Premium
Minimizing mean tardiness and earliness in single‐machine scheduling problems with unequal due dates
Author(s) -
Kim YeongDae,
Yano Candace Arai
Publication year - 1994
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199412)41:7<913::aid-nav3220410705>3.0.co;2-a
Subject(s) - tardiness , mathematical optimization , due date , single machine scheduling , computer science , heuristic , scheduling (production processes) , job shop scheduling , retard , mathematics , schedule , medicine , psychiatry , operating system
We consider a single‐machine scheduling problem with the objective of minimizing the mean (or equivalently, total) tardiness and earliness when due dates may differ among jobs. Some properties of the optimal solution are discussed, and these properties are used to develop both optimal and heuristic algorithms. Results of computational tests indicate that optimal solutions can be found for problems with up to 20 jobs, and that two of the heuristic procedures provide optimal or very near optimal solutions in many instances. © 1994 John Wiley & Sons, Inc.