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

DOI10.3103/S0278641914020101MaRDI QIDQ2018645zbMATH OpenOpenAlexFDO

Authors 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

optimizationsimulated annealingalgorithmschedulingembedded systemsasymptotic convergencemultiprocessor systemsstructural synthesis

Mathematics Subject Classification ID

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

Recommendations

• Simulated annealing algorithm in problems of multiprocessor scheduling
• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Convergence and finite-time behavior of simulated annealing
• Note on the Convergence of Simulated Annealing Algorithms
• scientific article; zbMATH DE number 4186782

Cites work

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

Cited in

(3)

• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Simulated annealing algorithm in problems of multiprocessor scheduling
• scientific article; zbMATH DE number 1810465 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018645)