The single-machine total tardiness scheduling problem: Review and extensions
Author:
- Christos KoulamasCKChristos Koulamas
- 1 April 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 202 (1) , 1-7
Abstract
No abstract availableThis publication has 60 references indexed in Scilit:
- Solution of the NP-hard total tardiness minimization problem in scheduling theoryComputational Mathematics and Mathematical Physics, 2007
- Two due date assignment problems in scheduling a single machineOperations Research Letters, 2006
- A special case of the single-machine total tardiness problem is NP-hardJournal of Computer and Systems Sciences International, 2006
- Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problemJournal of the Operational Research Society, 1997
- Decomposition of the single machine total tardiness problemOperations Research Letters, 1996
- Augmentations of consistent partial orders for the one-machine total tardiness problemDiscrete Applied Mathematics, 1996
- On decomposition of the total tardiness problemOperations Research Letters, 1995
- A note on the equivalence of the Wilkerson-Irwin and modified due-data rules for the mean tardiness sequencing problemComputers & Industrial Engineering, 1992
- Single Machine Tardiness Sequencing HeuristicsIIE Transactions, 1991
- Scheduling Problems With Generalized Due DatesIIE Transactions, 1986