Please use this identifier to cite or link to this item:
Title: Scheduling in parallel machines with two servers: The restrictive case
Authors: Benmansour, Rachid
Sifaleras, Angelo
Type: Book chapter
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
FRASCATI::Natural sciences::Computer and information sciences
Keywords: Scheduling
Parallel machine
Mixed integer programming
Variable neighborhood search
Single server
Issue Date: 2021
Publisher: Springer
Volume: 12559
First Page: 71
Last Page: 82
Volume Title: Variable Neighborhood Search
Part of Series: Lecture Notes in Computer Science
Part of Series: Lecture Notes in Computer Science
Abstract: In this paper we study the Parallel machine scheduling problem with Two Servers in the Restrictive case (PTSR). Before its processing, the job must be loaded on a common loading server. After a machine completes processing one job, an unloading server is needed to remove the job from the machine. During the loading, respectively the unloading, operation, both the machine and the loading, respectively the unloading, server are occupied. The objective function involves the minimization of the makespan. A Mixed Integer Linear Programming (MILP) model is proposed for the solution of this difficult problem. Due to the NP-hardness of the problem, a Variable Neighborhood Search (VNS) algorithm is proposed. The proposed VNS algorithm is compared against a state-of-the-art solver using a randomly generated data set. The results indicate that, the obtained solutions computed in a short amount of CPU time are of high quality. Specifically, the VNS solution approach outperformed IBM CPLEX Optimizer for instances with 15 and 20 jobs.
ISBN: 978-3-030-69624-5
ISSN: 0302-9743
Other Identifiers: 10.1007/978-3-030-69625-2_6
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
  Until 2022-03-15
289 kBAdobe PDFView/Open Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.