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

DOI10.3103/S0278641914020101zbMATH Open1311.65078OpenAlexW2002055826MaRDI QIDQ2018645FDOQ2018645

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

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

zbMATH Keywords

optimizationsimulated annealingalgorithmschedulingembedded systemsasymptotic convergencemultiprocessor systemsstructural synthesis

Mathematics Subject Classification ID

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

Cites Work

• Optimization by simulated annealing
• Convergence of an annealing algorithm
• Job Shop Scheduling by Simulated Annealing
• 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
• A parallel algorithm of simulated annealing for multiprocessor scheduling

Cited In (3)

• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Simulated annealing algorithm in problems of multiprocessor scheduling
• Title not available (Why is that?)

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)