Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.85, Iss.3, 1995-09, pp. : 515-531

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

Minimizing the makespan for the flow shop scheduling problem with availability constraints

By Aggoune R.

European Journal of Operational Research, Vol. 153, Iss. 3, 2004-03 ,pp. : 534-543

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

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 sequencing rules for minimizing the expected makespan in flexible machines

By Gunnell Y. Bourgeon G. Chakravarty A.K. Balakrishnan N.

European Journal of Operational Research, Vol. 96, Iss. 2, 1997-01 ,pp. : 274-288

Elsevier

Access to resources Recommend Favorite