Batch scheduling with deadlines on parallel machines: An NP-hard case
- 28 October 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 64 (2) , 69-74
- https://doi.org/10.1016/s0020-0190(97)00154-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Complexity of scheduling problems with multi-purpose machinesAnnals of Operations Research, 1997
- Scheduling Groups of Jobs on a Single MachineOperations Research, 1995
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and ComplexityJournal of the Operational Research Society, 1992
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959