Pré-Publication, Document De Travail Année : 2023

Decomposition methods for the preemptive Flexible Job-Shop Scheduling Problem

Résumé

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_v1.pdf (472.57 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
licence

Dates et versions

hal-04243944 , version 1 (16-10-2023)

Licence

Identifiants

  • HAL Id : hal-04243944 , version 1

Citer

Carla Juvin, Laurent Houssin, Pierre Lopez. Decomposition methods for the preemptive Flexible Job-Shop Scheduling Problem. 2023. ⟨hal-04243944⟩
345 Consultations
422 Téléchargements

Partager

  • More