Improved Formulations and Branch-and-Cut Algorithm for the Unrelated Parallel Machines Scheduling Problem with a Common Server and Job-Sequence Dependent Setup Times - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Improved Formulations and Branch-and-Cut Algorithm for the Unrelated Parallel Machines Scheduling Problem with a Common Server and Job-Sequence Dependent Setup Times

Abstract

In this work, we focus on a non-preemptive unrelated parallel machines scheduling problem with a common server and job-sequence dependent setup times. This problem arises when planning the production of some mechanical parts of automobile, hydraulic and electrical sectors. It's well known to be NP-Hard. We first propose new mixed integer linear programming formulations for the problem. We then compare them with the only state-of-the-art formulation for the same problem. Based on these results, we devise a Branch-and-Cut algorithm along with computational results are presented to evaluate the performance of our approach. Moreover, we provide a warm starting algorithm for the problem, and further show its influence on boosting the Branch-and-Cut algorithm.
Fichier principal
Vignette du fichier
Hadhbi_et_al_CODIT_2023_Final_Version.pdf (237.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY - Attribution

Dates and versions

hal-04434873 , version 1 (02-02-2024)

Licence

Copyright

Identifiers

Cite

Youssouf Hadhbi, Nathalie Grangeon, Laurent Deroussi, Sylvie Norre. Improved Formulations and Branch-and-Cut Algorithm for the Unrelated Parallel Machines Scheduling Problem with a Common Server and Job-Sequence Dependent Setup Times. 9TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES, Jul 2023, Rome, Italy. ⟨10.1109/CoDIT58514.2023.10284149⟩. ⟨hal-04434873⟩
6 View
9 Download

Altmetric

Share

Gmail Facebook X LinkedIn More