Branch and bound crossed with GA to solve hybrid flowshops

Author： Portmann M.-C.   Vignier A.   Dardilhac D.   Dezalay D.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.107, Iss.2, 1998-06, pp. : 389-400

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 branch and bound algorithm for the traveling purchaser problem

By Singh K.N.   van Oudheusden D.L.  

European Journal of Operational Research, Vol. 97, Iss. 3, 1997-03 ,pp. : 571-579

Elsevier

Access to resources Recommend Favorite

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

By Hahn P.   Grant T.   Hall N.  

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 629-640

Elsevier

Access to resources Recommend Favorite

A branch-and-bound algorithm for the mini-max spanning forest problem

By Yamada T.   Takahashi H.   Kataoka S.  

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 93-103

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for the resource-constrained project scheduling problem

By Brucker P.   Knust S.   Schoo A.   Thiele O.  

European Journal of Operational Research, Vol. 107, Iss. 2, 1998-06 ,pp. : 272-288

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for mixed zero-one multiple objective linear programming

By Mavrotas G.   Diakoulaki D.  

European Journal of Operational Research, Vol. 107, Iss. 3, 1998-06 ,pp. : 530-541

Elsevier

Access to resources Recommend Favorite