A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
DOI10.1007/S10951-009-0150-8zbMATH Open1230.90087DBLPjournals/scheduling/BruckerS11aOpenAlexW2081195398WikidataQ59902867 ScholiaQ59902867MaRDI QIDQ657253FDOQ657253
N. 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
Recommendations
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Open-shop batch scheduling with identical jobs
- Batching in single operation manufacturing systems
- Title not available (Why is that?)
- Batching and scheduling in a multi-machine flow shop
- Minimizing flow-time on a single machine with integer batch sizes
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
- Title not available (Why is that?)
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- Flow-shop batch scheduling with identical processing-time jobs
- Single machine scheduling with batch-dependent setup times
Cited In (2)
This page was built for publication: A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657253)
