Two simulated annealing-based heuristics for the job shop scheduling problem

Author： Steinhofel K.   Albrecht A.   Wong C.K.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.118, Iss.3, 1999-11, pp. : 524-548

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

Some new results on simulated annealing applied to the job shop scheduling problem

By Kolonko M.  

European Journal of Operational Research, Vol. 113, Iss. 1, 1999-02 ,pp. : 123-136

Elsevier

Access to resources Recommend Favorite

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

By Drobouchevitch I.G.   Strusevich V.A.  

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 229-240

Elsevier

Access to resources Recommend Favorite

An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

By Zesheng H.   Taeyong Y.   Tiger A.  

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 99-117

Elsevier

Access to resources Recommend Favorite

Improvement heuristics for the Vehicle Routing Problem based on Simulated Annealing

By Van Breedam A.  

European Journal of Operational Research, Vol. 86, Iss. 3, 1995-11 ,pp. : 480-490

Elsevier

Access to resources Recommend Favorite

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

By Katayama K.   Narihisa H.  

European Journal of Operational Research, Vol. 134, Iss. 1, 2001-10 ,pp. : 103-119

Elsevier

Access to resources Recommend Favorite