Estimating the convergence of a simulated annealing algorithm for the problem of constructing multiprocessor schedules

DOI10.3103/S0278641914020101zbMath1311.65078OpenAlexW2002055826MaRDI QIDQ2018645

D. A. Zorin

Publication date: 25 March 2015

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641914020101

zbMATH Keywords

optimizationalgorithmschedulingsimulated annealingembedded systemsstructural synthesismultiprocessor systemsasymptotic convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cites Work

• Optimization by Simulated Annealing
• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Design of computer systems for digital signal processing based on the concept of ``open architecture
• Algorithm for synthesis of real-time systems under reliability constraints
• Convergence of an annealing algorithm
• Job Shop Scheduling by Simulated Annealing

This page was built for publication: Estimating the convergence of a simulated annealing algorithm for the problem of constructing multiprocessor schedules