A Variable Neighborhood Search (VNS) metaheuristic for Multiprocessor Scheduling Problem with Communication Delays

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.

[1]  Mitsuo Gen,et al.  A comparison of multiprocessor task scheduling algorithms with communication costs , 2008, Comput. Oper. Res..

[2]  Hesham H. Ali,et al.  An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors , 1995, J. Comput. Syst. Sci..

[3]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Scott J. Mason,et al.  Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems , 2010, Comput. Ind. Eng..

[6]  Garth Isaak,et al.  Scheduling rooted forests with communication delays , 1994 .

[7]  Nenad Mladenović,et al.  Towards the Optimal Solution of the Multiprocessor Scheduling Problem with Communication Delays , 2007 .

[8]  Nenad Mladenovic,et al.  New MIP model for multiprocessor scheduling problem with communication delays , 2017, Optim. Lett..

[9]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[10]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[11]  Zhongzhi Shi,et al.  A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems , 2007, J. Parallel Distributed Comput..

[12]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[13]  Marsha Lise Prastein,et al.  Precedence-Constrained Scheduling with Minimum Time and Communication , 1987 .

[14]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[15]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[16]  Oliver Sinnen,et al.  Optimal Linear Programming Solutions for Multiprocessor Scheduling with Communication Delays , 2012, ICA3PP.

[17]  Stéphane Dauzère-Pérès,et al.  Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine , 2003 .

[18]  Katta G. Murty,et al.  Operations Research: Deterministic Optimization Models , 1994 .

[19]  Scott J. Mason,et al.  Parallel machine scheduling subject to auxiliary resource constraints , 2007 .

[20]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

[21]  Teodor Gabriel Crainic,et al.  Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems , 2006, Comput. Oper. Res..

[22]  TATJANA DAVIDOVIĆ,et al.  Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays , 2004, Asia Pac. J. Oper. Res..