Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey
Authors:
- Tapan SenTSTapan Sen
- Joanne M SulekJSJoanne M Sulek
- Parthasarati DileepanPDParthasarati Dileepan
- 1 January 2003
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 83 (1) , 1-12
Abstract
No abstract availableKeywords
This publication has 68 references indexed in Scilit:
- The impact of priority rule combinations on lateness and tardinessIIE Transactions, 1998
- A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shopsIIE Transactions, 1998
- 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
- The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobsIIE Transactions, 1995
- The parallel machine min-max weighted absolute lateness scheduling problemNaval Research Logistics (NRL), 1994
- Heuristics for Flowshop Scheduling Problems Minimizing Mean TardinessJournal of the Operational Research Society, 1993
- Single Machine Tardiness Sequencing HeuristicsIIE Transactions, 1991
- On the Single-machine Scheduling Problem with Tardiness PenaltiesJournal of the Operational Research Society, 1991