Local search algorithms for the multiprocessor flow shop scheduling problem

Author： Negenman E.G.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.128, Iss.1, 2001-01, pp. : 147-158

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

Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop

By Oguz C.   Fikret Ercan M.   Edwin Cheng T.C.   Fung Y.F.  

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 390-403

Elsevier

Access to resources Recommend Favorite

A tabu search approach for the flow shop scheduling problem

By Ben-Daya M.   Al-Fawzan M.  

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 88-95

Elsevier

Access to resources Recommend Favorite

Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

By Hoogeveen J.A.   Lenstra J.K.   Veltman B.  

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 172-175

Elsevier

Access to resources Recommend Favorite

Solving the continuous flow-shop scheduling problem by metaheuristics

By Fink A.   Vosz S.  

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

Elsevier

Access to resources Recommend Favorite

A contribution to the stochastic flow shop scheduling problem

By Gourgand M.   Grangeon N.   Norre S.  

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

Elsevier

Access to resources Recommend Favorite