Skip to Main content Skip to Navigation
Conference papers

MIP formulations for identical parallel machine scheduling problem with single server

Abstract : This paper considers the problem of scheduling a set of independent jobs on an arbitrary number of identical parallel machines with setup consideration and a makespan objective. The setup operations are performed by one available server. We propose two mixed integer programming (MIP) formulations to solve optimally this problem. The performance of each model is compared with another MIP proposed in the literature. It turns out that our formulation based on time-indexed variables outperforms the other models.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03383549
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Monday, October 18, 2021 - 4:07:48 PM
Last modification on : Monday, November 15, 2021 - 5:50:02 PM

Identifiers

Collections

Citation

Abdelhak El Idrissi, Rachid Benmansour, Mohammed Benbrahim, David Duvivier. MIP formulations for identical parallel machine scheduling problem with single server. 2018 4th International Conference on Optimization and Applications (ICOA), Apr 2018, Mohammedia, Morocco. pp.1-6, ⟨10.1109/ICOA.2018.8370596⟩. ⟨hal-03383549⟩

Share

Metrics

Record views

11