Skip to Main content Skip to Navigation
Conference papers

Greedy heuristics for identical parallel machine scheduling problem with single server to minimize the makespan

Abstract : This paper considers the problem of scheduling a set of n independent jobs on m identical parallel machines with setup times constraints. Immediately before processing, each job must be loaded on a common server to perform the setup operation. During the loading operation, both the machine and the server are occupied. Two greedy heuristics are developed for ( m ≥ 2) in order to minimize respectively the server waiting time and the machine idle time. These heuristics generalize those proposed in the literature for the case of two machines. The computational results show the efficiency of the proposed heuristics.
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03392177
Contributor : Kathleen TORCK Connect in order to contact the contributor
Submitted on : Thursday, April 28, 2022 - 3:20:07 PM
Last modification on : Thursday, April 28, 2022 - 6:15:49 PM
Long-term archiving on: : Friday, July 29, 2022 - 7:30:36 PM

File

matecconf_iwtsce2018_00001.pdf
Publisher files allowed on an open archive

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Abdelhak El Idrissi, Mohammed Benbrahim, Rachid Benmansour, David Duvivier. Greedy heuristics for identical parallel machine scheduling problem with single server to minimize the makespan. Second International Workshop on Transportation and Supply Chain Engineering (IWTSCE’18), National Institute Of Posts And Telecommunications, May 2018, Rabat, Morocco. pp.00001, ⟨10.1051/matecconf/201820000001⟩. ⟨hal-03392177⟩

Share

Metrics

Record views

18

Files downloads

6