Ιδρυματικό Αποθετήριο Ακαδημαϊκής Έρευνας
Πανεπιστήμιο Μακεδονίας
Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://ruomo.lib.uom.gr/handle/7000/870Πλήρης εγγραφή μεταδεδομένων
| Πεδίο DC | Τιμή | Γλώσσα |
|---|---|---|
| dc.contributor.author | Benmansour, Rachid | - |
| dc.contributor.author | Sifaleras, Angelo | - |
| dc.date.accessioned | 2021-03-15T20:59:25Z | - |
| dc.date.available | 2021-03-15T20:59:25Z | - |
| dc.date.issued | 2021 | - |
| dc.identifier | 10.1007/978-3-030-69625-2_6 | en_US |
| dc.identifier.isbn | 978-3-030-69624-5 | en_US |
| dc.identifier.isbn | 978-3-030-69625-2 | en_US |
| dc.identifier.issn | 0302-9743 | en_US |
| dc.identifier.issn | 1611-3349 | en_US |
| dc.identifier.uri | https://doi.org/10.1007/978-3-030-69625-2_6 | en_US |
| dc.identifier.uri | https://ruomo.lib.uom.gr/handle/7000/870 | - |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Springer | en_US |
| dc.relation.ispartofseries | Lecture Notes in Computer Science | en_US |
| dc.subject | FRASCATI::Natural sciences::Mathematics::Applied Mathematics | en_US |
| dc.subject | FRASCATI::Natural sciences::Computer and information sciences | en_US |
| dc.subject.other | Scheduling | en_US |
| dc.subject.other | Parallel machine | en_US |
| dc.subject.other | Mixed integer programming | en_US |
| dc.subject.other | Variable neighborhood search | en_US |
| dc.subject.other | Single server | en_US |
| dc.title | Scheduling in parallel machines with two servers: The restrictive case | en_US |
| dc.type | Book chapter | en_US |
| dc.contributor.department | Τμήμα Εφαρμοσμένης Πληροφορικής | en_US |
| local.identifier.volume | 12559 | en_US |
| local.identifier.firstpage | 71 | en_US |
| local.identifier.lastpage | 82 | en_US |
| local.identifier.volumetitle | Variable Neighborhood Search | en_US |
| Εμφανίζεται στις Συλλογές: | Τμήμα Εφαρμοσμένης Πληροφορικής | |
Αρχεία σε αυτό το Τεκμήριο:
| Αρχείο | Περιγραφή | Μέγεθος | Μορφότυπος | |
|---|---|---|---|---|
| Scheduling_in_parallel_machines_with_two_servers._The_restrictive_case.pdf | 289 kB | Adobe PDF | Προβολή/Ανοιγμα |
Τα τεκμήρια στο Αποθετήριο προστατεύονται από πνευματικά δικαιώματα, εκτός αν αναφέρεται κάτι διαφορετικό.