Paper Info
Title
Dynamic Programming Algorithms And Lagrangian Lower Bounds For A Discrete Lot Streaming Problem In A Two-Machine Flow Shop
Abstract
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.
Year
DOI
Venue
2021
10.1007/s10288-020-00449-8
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
Keywords
DocType
Volume
Lot streaming, Setup times, Flow shop, Total flow time, Lagrangian relaxation, Dynamic programming
Journal
19
Issue
ISSN
Citations 
2
1619-4500
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Arianna Alfieri113415.09
Shuyu Zhou231.09
Rosario Scatamacchia3587.66
Steef L. Van De Velde428525.31