Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines

DOI10.1007/s10951-018-0561-5zbMath1420.90022OpenAlexW2793302140MaRDI QIDQ2317137

Dominik Kress, Erwin Pesch, Maksim Barketau

Publication date: 8 August 2019

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

Full work available at URL: https://doi.org/10.1007/s10951-018-0561-5

zbMATH Keywords

approximation algorithmstrong NP-hardnessbatch schedulingsetup costjob familiesEDD-scheduleGT-schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing

Cites Work

• Unnamed Item
• Unnamed Item
• The third comprehensive survey on scheduling problems with setup times/costs
• The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
• Scheduling multi-operation jobs on a single machine
• Scheduling with batching: A review
• The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
• A survey of scheduling problems with setup times or costs
• Principles of Sequencing and Scheduling
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Complexity of Scheduling with Batch Setup Times
• Solving a Class Scheduling Problem with a Genetic Algorithm
• Handbook on Scheduling