Approximation methods for discrete lot streaming in flow shops
From MaRDI portal
Recommendations
Cites work
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- 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
- Flow shop scheduling with lot streaming
- Lot streaming in the two-machine flow shop with setup times
- Lot streaming in three-stage production processes
- Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model
- Optimal and Heuristic Procedures for Component Lot-Splitting in Multi-Stage Manufacturing Systems
- Optimal lot streaming for multiple products in a two-machine flow shop
- Two- and three-machine flow shop scheduling problems with equal sized transfer batches
Cited in
(9)- Queueing network analysis on dynamic lot streaming
- Lot streaming multiple jobs in a flow shop
- Flow shop scheduling with lot streaming
- Batch scheduling on two-machine flowshop with machine-dependent setup times
- Discrete Lot Streaming In Two-Machine Flow Shops
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
- The evolution of schematic representations of flow shop scheduling problems
- Lot streaming models with a limited number of capacitated transporters in multistage batch production systems
- Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups
This page was built for publication: Approximation methods for discrete lot streaming in flow shops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375120)
