MINIMIZING MEAN TARDINESS AND EARLINESS IN SINGLE-MACHINE SCHEDULING PROBLEMS WITH UNEQUAL DUE-DATES

Authors
KIM YD YANO CA
Citation
Yd. Kim et Ca. Yano, MINIMIZING MEAN TARDINESS AND EARLINESS IN SINGLE-MACHINE SCHEDULING PROBLEMS WITH UNEQUAL DUE-DATES, Naval research logistics, 41(7), 1994, pp. 913-933
Citations number
39
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Engineering, Marine
Journal title
Naval research logistics → ACNP
ISSN journal
0894069X
Volume
41
Issue
7
Year of publication
1994
Pages
913 - 933
Database
ISI
SICI code
0894-069X(1994)41:7<913:MMTAEI>2.0.ZU;2-P
Abstract
We consider a single-machine scheduling problem with the objective of minimizing the mean (or equivalently, total) tardiness and earliness w hen due dates may differ among jobs. Some properties of the optimal so lution are discussed, and these properties are used to develop both op timal and heuristic algorithms. Results of computational tests indicat e 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. (C) 1994 John Wiley & Sons, Inc.