PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
- 1 September 2005
- journal article
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 22 (03) , 297-326
Abstract
The multiprocessor scheduling problem with communication delays that we consider in this paper consists of finding a static schedule of an arbitrary task graph onto a homogeneous multiprocessor system, such that the total execution time (i.e. the time when all tasks are completed) is minimum. The task graph contains precedence relations as well as communication delays (or data transferring time) between tasks if they are executed on different processors. The multiprocessor architecture is assumed to contain identical processors connected in an arbitrary way, which is defined by a symmetric matrix containing minimum distances between every two processors. The solution is represented by a feasible permutation of tasks. In order to obtain the objective function value (i.e. schedule length, makespan), the feasible permutation has to be transformed into the actual schedule by the use of some heuristic method. For solving this NP-hard problem, we develop basic tabu search and variable neighborhood search heuristics, where various types of reduced Or-opt-like neighborhood structures are used for local search. A genetic search approach based on the same solution space is also developed. Comparative computational results on random graphs with up to 500 tasks and 8 processors are reported. On average, it appears that variable neighborhood search outperforms the other metaheuristics. In addition, a detailed performance analysis of both the proposed solution representation and heuristic methods is presented.Keywords
This publication has 23 references indexed in Scilit:
- Guidelines for the use of meta-heuristics in combinatorial optimizationEuropean Journal of Operational Research, 2003
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Variable neighborhood searchComputers & Operations Research, 1997
- Scheduling multiprocessor tasks — An overviewEuropean Journal of Operational Research, 1996
- Task scheduling with and without communication delays: A unified approachEuropean Journal of Operational Research, 1996
- Scheduling in and out forests in the presence of communication delaysIEEE Transactions on Parallel and Distributed Systems, 1996
- A Compile-Time Scheduling Heuristic for Multiprocessor ArchitecturesThe Computer Journal, 1996
- Scheduling DAG's for asynchronous multiprocessor executionIEEE Transactions on Parallel and Distributed Systems, 1994
- A genetic algorithm for multiprocessor schedulingIEEE Transactions on Parallel and Distributed Systems, 1994
- A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecturesIEEE Transactions on Parallel and Distributed Systems, 1993