Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups

DOI10.1023/A:1021942422161zbMath1046.90025OpenAlexW2256179311MaRDI QIDQ1411336

Adar A. Kalir, Sarin, Subhash C.

Publication date: 27 October 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021942422161

zbMATH Keywords

optimizationlot streamingflow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27)

Related Items

A study on integration of lot sizing and flow shop lot streaming problems, A survey of scheduling problems with setup times or costs, Lot streaming in a multiple product permutation flow shop with intermingling, Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop, On the equivalence of small batch assembly line balancing and lot streaming in a flow shop