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 fl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:4OR Ročník 19; číslo 2; s. 265 - 288
Hlavní autoři: Alfieri, Arianna, Zhou, Shuyu, Scatamacchia, Rosario, van de Velde, Steef L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2021
Springer Nature B.V
Témata:
Algorithms
Business and Management
Dynamic programming
Heuristic
Industrial and Production Engineering
Integer programming
Lower bounds
Manufacturing
Operations research
Operations Research/Decision Theory
Optimization
Research Paper
Total flow time
Lagrangian relaxation
Setup times
90-08
90B35
Lot streaming
90C39
Flow shop
Dynamic programming
ISSN:1619-4500, 1614-2411
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1619-4500
1614-2411
DOI:10.1007/s10288-020-00449-8