Solving the batch scheduling problem with family setup times

DOI10.1007/978-3-642-00142-0_19MaRDI QIDQ5392000zbMATH OpenOpenAlexFDO

Authors Udo Buscher, Liji Shen

Publication date 7 April 2011

Published in Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00142-0_19

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Family scheduling with batch availability in flow shops to minimize makespan
• Flow shop batching and scheduling with sequence-dependent setup times
• Solving the serial batching problem in job shop manufacturing systems
• A sequencing problem with family setup times
• Flow-shop batch scheduling with identical processing-time jobs

Cited in

(11)

• Family scheduling with batch availability in flow shops to minimize makespan
• A sequencing problem with family setup times
• Solving the serial batching problem in job shop manufacturing systems
• Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing
• Family-based scheduling of shops with functional layouts
• Impact of family-based scheduling on transfer batches in a job shop manufacturing cell
• Scheduling with product family set-up times: an application in TFT LCD manufacturing
• Flow shop batching and scheduling with sequence-dependent setup times
• Single machine batch scheduling problem with family setup times and release dates to minimize makespan
• Scheduling batches on parallel machines with major and minor set-ups

This page was built for publication: Solving the batch scheduling problem with family setup times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392000)