Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
In this paper, we propose exact and heuristic solution approaches based on dynamic programming for an open lot streaming problem. We also present the first application of Lagrangian relaxation to compute strong lower bounds to such a problem. The application concerns the minimization of the total flow time for the discrete version of a single-job lot streaming problem from the literature in a two-machine flow shop with attached setup times. Computational results on benchmark instances illustrate the effectiveness of the proposed approaches and give evidence of the strength of the Lagrangian relaxation lower bounds.
|Keywords||Dynamic programming, Flow shop, Lagrangian relaxation, Lot streaming, Setup times, Total flow time|
|Persistent URL||dx.doi.org/10.1007/s10288-020-00449-8, hdl.handle.net/1765/128829|
Alfieri, A, Zhou, S, Scatamacchia, R. (Rosario), & van de Velde, S.L. (2020). Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop. 4OR. doi:10.1007/s10288-020-00449-8