Approximation methods for discrete lot streaming in flow shops
From MaRDI portal
Publication:1375120
DOI10.1016/S0167-6377(97)00039-4zbMath0888.90087OpenAlexW1985524238WikidataQ126389163 ScholiaQ126389163MaRDI QIDQ1375120
Publication date: 12 January 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00039-4
Related Items
Batch scheduling on two-machine flowshop with machine-dependent setup times ⋮ Lot streaming multiple jobs in a flow shop ⋮ The evolution of schematic representations of flow shop scheduling problems
Cites Work
- Optimal lot streaming for multiple products in a two-machine flow shop
- Lot streaming in three-stage production processes
- Flow shop scheduling with lot streaming
- Lot streaming in the two-machine flow shop with setup times
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- Optimal and Heuristic Procedures for Component Lot-Splitting in Multi-Stage Manufacturing Systems
- Two- and three-machine flow shop scheduling problems with equal sized transfer batches
- Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model
- Author's Reply to Vergin's Note on the Paper “Lot Size Scheduling on a Single Machine for Stochastic Demand”
- Basic Techniques for Lot Streaming
This page was built for publication: Approximation methods for discrete lot streaming in flow shops
