Batch scheduling with deadlines on parallel machines: an NP-hard case

DOI10.1016/S0020-0190(97)00154-3zbMath1336.90039OpenAlexW2006121311MaRDI QIDQ287238

Mikhail Y. Kovalyov, Yakov M. Shafransky

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00154-3

zbMATH Keywords

computational complexitybatchingparallel machine scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Scheduling with batching: A review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scientific school of Academician V. S. Tanaev: results on the scheduling theory
• Batch scheduling with deadlines on parallel machines
• Scheduling with Deadlines and Loss Functions
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Scheduling Groups of Jobs on a Single Machine