Skip to Main content Skip to Navigation
Book sections

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 :
Book sections
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03691376
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Thursday, June 9, 2022 - 9:21:17 AM
Last modification on : Thursday, August 11, 2022 - 1:14:05 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. Variable Neighborhood Search, 12010, Springer International Publishing, pp.112-125, 2020, Lecture Notes in Computer Science, 978-3-030-44931-5. ⟨10.1007/978-3-030-44932-2_8⟩. ⟨hal-03691376⟩

Share

Metrics

Record views

5