The complexity of scheduling job families about a common due date
- 1 February 1997
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 20 (2) , 65-74
- https://doi.org/10.1016/s0167-6377(96)00054-5
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Parallel Machine Scheduling with Batch Setup TimesOperations Research, 1994
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and ComplexityJournal of the Operational Research Society, 1992
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due DateOperations Research, 1991
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- On the Complexity of Scheduling with Batch Setup TimesOperations Research, 1989
- Minimizing the sum of absolute lateness in single‐machine and multimachine schedulingNaval Research Logistics Quarterly, 1984
- Minimizing the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956