Single machine batch scheduling problem with family setup times and release dates to minimize makespan

DOI10.1007/s10951-006-8776-2zbMath1154.90507OpenAlexW1976300665MaRDI QIDQ880565

N. E. Zubov

Publication date: 15 May 2007

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

Full work available at URL: http://hdl.handle.net/10397/1142

zbMATH Keywords

SchedulingRelease datesBatchingMakespanFamily

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single-machine scheduling with advanced process control constraints ⋮ A survey of scheduling problems with setup times or costs ⋮ Scheduling batches in flowshop with limited buffers in the shampoo industry ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ Vehicle scheduling with combinable delivery and pickup operations

Cites Work

• Batch scheduling to minimize maximum lateness
• Scheduling with batching: A review
• 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
• Unnamed Item