Logic-based Benders decomposition for the preemptive Flexible Job-Shop Scheduling Problem - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Journal Articles Computers & Operations Research Year : 2023

Logic-based Benders decomposition for the preemptive Flexible Job-Shop Scheduling Problem

Abstract

In this paper, we focus on exact methods to solve the preemptive Flexible Job-Shop Scheduling Problem with makespan and total completion time minimisation objective functions. Mathematical and constraint programming models enable the resolution of this problem for small instances. However, as an NP-hard problem, the cost of solving grows rapidly when considering larger instances. In this regard, we propose a logic-based Benders decomposition that relies on an efficient branch-and-bound procedure to solve the subproblem representing a pure (non-flexible) preemptive job-shop scheduling problem. Computational experiments are carried out and show the very good performance of our proposals.
Fichier principal
Vignette du fichier
Article_pFJSSP_JuvinHoussinLopez.pdf (478.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03696252 , version 1 (15-06-2022)

Identifiers

Cite

Carla Juvin, Laurent Houssin, Pierre Lopez. Logic-based Benders decomposition for the preemptive Flexible Job-Shop Scheduling Problem. Computers & Operations Research, 2023, 152, ⟨10.1016/j.cor.2023.106156⟩. ⟨hal-03696252⟩
57 View
51 Download

Altmetric

Share

Gmail Facebook X LinkedIn More