Lagrangian relaxation-based lower bound for the two-machine flow shop with synchronized periodic maintenance - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year : 2018

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.
Not file

Dates and versions

hal-03383522 , version 1 (18-10-2021)

Identifiers

Cite

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⟩
8 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More