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

Author： Zesheng H.   Taeyong Y.   Tiger A.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

By Steinhofel K.   Albrecht A.   Wong C.K.  

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

Elsevier

Access to resources Recommend Favorite

Job-shop scheduling with processing alternatives

By Kis T.  

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 307-332

Elsevier

Access to resources Recommend Favorite

Job-shop scheduling with blocking and no-wait constraints

By Mascis A.   Pacciarelli D.  

European Journal of Operational Research, Vol. 143, Iss. 3, 2002-12 ,pp. : 498-517

Elsevier

Access to resources Recommend Favorite

Deterministic job-shop scheduling: Past, present and future

By Jain A.S.   Meeran S.  

European Journal of Operational Research, Vol. 113, Iss. 2, 1999-03 ,pp. : 390-434

Elsevier

Access to resources Recommend Favorite