A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
From MaRDI portal
Publication:657253
DOI10.1007/s10951-009-0150-8zbMath1230.90087WikidataQ59902867 ScholiaQ59902867MaRDI QIDQ657253
Peter Brucker, Natalia V. Shakhlevich
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
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- 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