Design and evaluation of tabu search algorithms for multiprocessor scheduling

DOI10.1023/A:1009625629722zbMath0913.90183OpenAlexW1586365479MaRDI QIDQ1273659

Arne Thesen

Publication date: 6 January 1999

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009625629722

zbMATH Keywords

multiprocessor schedulinggreedy local searchHash codingrandom blocking of the tailtabu search algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Balancing perfectly periodic service schedules: An application from recycling and waste management ⋮ Partial solutions and multifit algorithm for multiprocessor scheduling ⋮ PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS ⋮ Bee colony optimization for scheduling independent tasks to identical processors ⋮ A composite algorithm for multiprocessor scheduling ⋮ Minimizing labor requirements in a periodic vehicle loading problem ⋮ Multiple machine JIT scheduling: a tabu search approach ⋮ Tight bounds for the identical parallel machine scheduling problem

This page was built for publication: Design and evaluation of tabu search algorithms for multiprocessor scheduling