English, Article edition: PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS TATJANA DAVIDOVIÄ; PIERRE HANSEN; NENAD MLADENOVIÄ

User activity

Share to:
 
Bookmark: http://trove.nla.gov.au/version/131645
Physical Description
  • article
Language
  • English

Edition details

Title
  • PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
Author
  • TATJANA DAVIDOVIÄ
  • PIERRE HANSEN
  • NENAD MLADENOVIÄ
Physical Description
  • article
Notes
  • 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.
  • Task scheduling, communication delays, metaheuristics, variable neighborhood search, tabu search, genetic algorithms
  • RePEc:wsi:apjorx:v:22:y:2005:i:03:p:297-326
Language
  • English
Contributed by
OAIster

Get this edition

  • Set up My libraries

    How do I set up "My libraries"?

    In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.

  • All (1)
  • Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this edition

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this version

Add a comment