A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

DOI10.1007/s10951-009-0150-8zbMath1230.90087DBLPjournals/scheduling/BruckerS11aOpenAlexW2081195398WikidataQ59902867 ScholiaQ59902867MaRDI QIDQ657253

Natalia V. Shakhlevich, Peter Brucker

Publication date: 16 January 2012

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

Full work available at URL: http://eprints.whiterose.ac.uk/81535/1/FlowShopBatching-BruckerShakhlevich.pdf

zbMATH Keywords

polynomial-time algorithmflow shopbatch scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Integrated problem of soaking pit heating and hot rolling scheduling in steel plants ⋮ Scheduling a proportionate flow shop of batching machines

Cites Work

• Single machine scheduling with batch-dependent setup times
• Batching and scheduling in a multi-machine flow shop
• Batching in single operation manufacturing systems
• One-pass batching algorithms for the one-machine problem
• A polynomial algorithm for a one machine batching problem
• A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
• Open-shop batch scheduling with identical jobs
• Minimizing flow-time on a single machine with integer batch sizes
• Flow-shop batch scheduling with identical processing-time jobs
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial-time algorithm for a flow-shop batching problem with equal-length operations