Skip to Main content Skip to Navigation
Conference papers

Lagrangian relaxation-based lower bound for the two-machine flow shop with synchronized periodic maintenance

Abstract : In this work, we present a Lagrangian relaxation approach to generate a new lower bound for the two-machine flow shop scheduling problem under synchronized and periodic maintenance activities. The word synchronized is used to specify that the maintenance starts at the same time on both machines. The problem is denoted as F2/nr - pm/C max . First, we investigate a time-indexed formulation for the problem. Then, a lower bound was proposed using Lagrangian relaxation. Computational study shows satisfactory results.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03383522
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Monday, October 18, 2021 - 4:00:55 PM
Last modification on : Wednesday, November 3, 2021 - 8:46:50 AM

Identifiers

Collections

Citation

Issam Krimi, Rachid Benmansour, Nizar Elhachemi, David Duvivier. Lagrangian relaxation-based lower bound for the two-machine flow shop with synchronized periodic maintenance. 2018 4th International Conference on Optimization and Applications (ICOA), Apr 2018, Mohammedia, Morocco. pp.1-6, ⟨10.1109/ICOA.2018.8370572⟩. ⟨hal-03383522⟩

Share

Metrics

Record views

9