The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
From MaRDI portal
Publication:856324
DOI10.1016/j.ejor.2005.12.027zbMath1109.90043MaRDI QIDQ856324
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.027
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Hardware design of a new genetic based disk scheduling method, A simulated annealing algorithm for single machine scheduling problems with family setups, Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Cites Work
- Batch scheduling to minimize maximum lateness
- Scheduling multi-operation jobs on a single machine
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- On the Complexity of Scheduling with Batch Setup Times
- Unnamed Item