PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
From MaRDI portal
Publication:5708845
DOI10.1142/S021759590500056XzbMath1085.90020OpenAlexW2059572074MaRDI QIDQ5708845
Nenad Mladenović, Tatjana Davidović, Pierre Hansen
Publication date: 21 November 2005
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021759590500056x
metaheuristicstabu searchgenetic algorithmsvariable neighborhood searchcommunication delaysTask scheduling
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Variable neighborhood search for metric dimension and minimal doubly resolving set problems, Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem, Bee colony optimization for scheduling independent tasks to identical processors, Variable neighbourhood search: methods and applications, New MIP model for multiprocessor scheduling problem with communication delays, Variable neighbourhood search: Methods and applications, MPI Parallelization of Variable Neighborhood Search
Cites Work
- Unnamed Item
- NP-complete scheduling problems
- Task scheduling with and without communication delays: A unified approach
- Design and evaluation of tabu search algorithms for multiprocessor scheduling
- Scheduling multiprocessor tasks -- An overview
- Multiprocessor scheduling in a genetic paradigm
- Variable neighborhood search
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints
- Variable Neighborhood Search
- A note on LPT scheduling
- Variable neighborhood search: Principles and applications