Earliness/tardiness scheduling with a common due date and family setups
- 30 November 2004
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 47 (2-3) , 275-288
- https://doi.org/10.1016/j.cie.2004.07.006
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up timesJournal of Scheduling, 2000
- Scheduling job families about an unrestricted common due date on a single machineInternational Journal of Production Research, 1997
- Scheduling with batch setup times and earliness-tardiness penaltiesEuropean Journal of Operational Research, 1997
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- Single facility multi-class job schedulingComputers & Operations Research, 1990
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- Single facility scheduling with multiple job classesEuropean Journal of Operational Research, 1988
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due dateNaval Research Logistics (NRL), 1987
- Minimizing mean absolute deviation of completion times about a common due dateNaval Research Logistics Quarterly, 1986
- Minimizing the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981