Authors: El Cadi, Abdessamad Ait
Atitallah, Rabie Ben
Mladenović, Nenad 
Artiba, Abdelhakim
Title: A Variable Neighborhood Search (VNS) metaheuristic for Multiprocessor Scheduling Problem with Communication Delays
Journal: Proceedings of 2015 International Conference on Industrial Engineering and Systems Management, IEEE IESM 2015
First page: 1091
Last page: 1095
Conference: International Conference on Industrial Engineering and Systems Management, IEEE IESM 2015; Seville; Spain; 21 October 2015 through 23 October 2015
Issue Date: 12-Jan-2016
ISBN: 978-2-960-05326-5
DOI: 10.1109/IESM.2015.7380290
Abstract: 
The purpose of this paper is to present a Variable Neighborhood Search (VNS) metaheuristic for solving the Multiprocessor Scheduling Problem with Communication Delays (MSPCD). The MSPCD problem considers scheduling task graph on a multiprocessor system, taking into account communication delays. The task graph contains precedence relations as well as the amount of exchanged data between tasks. The multiprocessor architecture is composed by a set of identical processors connected in an arbitrary way. The communication is defined throw two symmetric matrices containing, respectively, the communication rate and the access cost between each two processors. Unlike the proposed VNS in the literature, we use a different representation of the solutions that leads to the definition of two natural neigh-borhoods structures. Computational experience shows advantages of our approach.
Keywords: Communication delay | Metaheuristics | Multiprocessors | Task Scheduling | Variable Neighborhood Search | VNS
Publisher: IEEE

Show full item record

SCOPUSTM   
Citations

1
checked on Apr 14, 2021

Page view(s)

7
checked on Apr 15, 2021

Google ScholarTM

Check

Altmetric

Altmetric


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