Skip to Main content Skip to Navigation
Conference papers

Variable Neighborhood Search for Identical Parallel Machine Scheduling Problem with a Single Server

Abstract : In this paper, we study the m identical parallel machines scheduling problem with a single server to minimize the schedule length (makespan). Each job requires a prior set-up which must be performed by a single server. For this strongly NP -hard problem, a variable neighborhood search is proposed. We conduct a comparative analysis with existing algorithms using previously solved instances from the literature. The results indicate that the algorithm presented in this paper is effective and efficient regarding the quality of the solution: the obtained objective function values are very close to lower bounds.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03382981
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 18, 2021 - 1:49:10 PM
Last modification on : Monday, November 15, 2021 - 5:50:02 PM

Identifiers

Collections

Citation

Abdelhak El Idrissi, Mohammed Benbrahim, Rachid Benmansour, David Duvivier. Variable Neighborhood Search for Identical Parallel Machine Scheduling Problem with a Single Server. 7th International Conference on Variable Neighborhood Search (ICVNS2019), published as a post-proceedings in Springer's Lecture Notes in Computer Science (LNCS), Oct 2019, Rabat, Morocco. pp.112-125, ⟨10.1007/978-3-030-44932-2_8⟩. ⟨hal-03382981⟩

Share

Metrics

Record views

12