A parallel algorithm of simulated annealing for multiprocessor scheduling

DOI10.1134/S1064230708030155zbMath1171.90414MaRDI QIDQ733994

V. A. Kostenko, A. V. Kalashnikov

Publication date: 19 October 2009

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (7)

DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems ⋮ A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times ⋮ Scheduling algorithms for real-time computing systems admitting simulation models ⋮ Combinatorial optimization algorithms combining greedy strategies with a limited search procedure ⋮ Simulated annealing algorithm in problems of multiprocessor scheduling ⋮ Algorithm for synthesis of real-time systems under reliability constraints ⋮ Estimating the convergence of a simulated annealing algorithm for the problem of constructing multiprocessor schedules

Cites Work

• Optimization by Simulated Annealing
• The problem of schedule construction in the joint design of hardware and software
• A distributed implementation of simulated annealing for the travelling salesman problem
• Preemptive Scheduling with Release Times, Deadlines, and Due Times
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Analytical performance evaluation of distributed computer systems

This page was built for publication: A parallel algorithm of simulated annealing for multiprocessor scheduling