Solving Scheduling Problems by Simulated Annealing

DOI10.1137/S0363012996307813zbMath0913.60045OpenAlexW2038303746MaRDI QIDQ4210178

Olivier Catoni

Publication date: 21 September 1998

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0363012996307813

zbMATH Keywords

simulated annealingscheduling problemsMetropolis algorithmIET algorithm

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Asymptotical behaviour of several interacting annealing processes ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms

This page was built for publication: Solving Scheduling Problems by Simulated Annealing