Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing

Author： Sadeh N.M.   Nakakuki Y.   Thangiah S.R.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.75, Iss.1, 1997-01, pp. : 189-208

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A simulated annealing algorithm for job shop scheduling

By Ponnambalam S. G.   Jawahar N.   Aravindan P.  

Production Planning and Control, Vol. 10, Iss. 8, 1999-12 ,pp. : 767-777

Taylor & Francis Ltd

Access to resources Recommend Favorite

A search space analysis of the Job Shop Scheduling Problem

By Mattfeld D.C.   Bierwirth C.   Kopfer H.  

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 441-453

Springer Publishing Company

Access to resources Recommend Favorite

Local Search Genetic Algorithms for the Job Shop Scheduling Problem

By  

Applied Intelligence, Vol. 21, Iss. 1, 2004-07 ,pp. : 99-109

Springer Publishing Company

Access to resources Recommend Favorite

Prototyped genetic search: a cybernetical approach to job-shop scheduling problems

By Khoukhi Amar  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 31, Iss. 1, 2002-02 ,pp. : 96-114

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Depth-first heuristic search for the job shop scheduling problem

By Mencía Carlos  

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 265-296

Springer Publishing Company

Access to resources Recommend Favorite