Heuristics for search sequencing under time-dependent probabilities of existence

DOI10.1016/j.cor.2005.08.007zbMath1187.90151OpenAlexW2081418950MaRDI QIDQ868139

Ho-Joo Lee, Yeong-Dae Kim

Publication date: 19 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.08.007

zbMATH Keywords

simulated annealingmilitary

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A note on the effect of neighborhood structure in simulated annealing
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A systematic procedure for setting parameters in simulated annealing algorithms
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
• Simulated annealing with extended neighbourhood
• Job Shop Scheduling by Simulated Annealing
• Neighborhood Size in the Simulated Annealing Algorithm

This page was built for publication: Heuristics for search sequencing under time-dependent probabilities of existence