Solving Scheduling Problems by Simulated Annealing

DOI10.1137/S0363012996307813MaRDI QIDQ4210178zbMATH OpenOpenAlexFDO

Authors 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 annealingMetropolis algorithmscheduling problemsIET 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)

Recommendations

• Some new results on simulated annealing applied to the job shop scheduling problem
• Job Shop Scheduling by Simulated Annealing
• Simulated annealing for resource-constrained scheduling
• Simulated annealing algorithm in problems of multiprocessor scheduling

Cited in

(10)

• scientific article; zbMATH DE number 4149877 (Why is no real title available?)
• Asymptotical behaviour of several interacting annealing processes
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• scientific article; zbMATH DE number 1966253 (Why is no real title available?)
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms
• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• Simulated annealing algorithm in problems of multiprocessor scheduling
• A Simulated Annealing Genetic Algorithm for Solving Timetable Problems
• A simulated annealing approach to the cyclic staff-scheduling problem

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

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