Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop

DOI10.1007/s10288-020-00449-8zbMath1470.90002MaRDI QIDQ2044553

Shuyu Zhou, Arianna Alfieri, Rosario Scatamacchia, Steef L. van de Velde

Publication date: 9 August 2021

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-020-00449-8

zbMATH Keywords

Lagrangian relaxation; dynamic programming; flow shop; total flow time; setup times; lot streaming

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C39: Dynamic programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming