Minimizing the makespan on a single machine subject to modular setups

DOI10.1007/s10951-021-00704-8zbMath1486.90089OpenAlexW3200193390MaRDI QIDQ2124915

Dirk Briskorn, Nils Boysen, Konrad Stephan

Publication date: 11 April 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-021-00704-8

zbMATH Keywords

complexityschedulingsequence-dependent setupsmodular products

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• The third comprehensive survey on scheduling problems with setup times/costs
• A survey on single crane scheduling in automated storage/retrieval systems
• Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
• Single-machine group scheduling with general deterioration and learning effects
• Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
• Crane scheduling in railway yards: an analysis of computational complexity
• Classifying and modeling setups and cleanings in lot sizing and scheduling
• Single-machine ready times scheduling with group technology and proportional linear deterioration
• A survey of scheduling problems with setup times or costs
• Single-machine scheduling problems with past-sequence-dependent setup times
• Algorithmic Aspects of Pyramidal Tours with Restricted Jump-Backs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• An improved approximation algorithm for ATSP
• A constant-factor approximation algorithm for the asymmetric traveling salesman problem

This page was built for publication: Minimizing the makespan on a single machine subject to modular setups