An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

Author： Della Croce F.   Ghirardi M.   Tadei R.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.139, Iss.2, 2002-06, pp. : 293-301

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 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 with fuzzy inference for a permutation flowshop scheduling problem

By Jinliang C.   Kise H.   Matsumoto H.  

European Journal of Operational Research, Vol. 96, Iss. 3, 1997-02 ,pp. : 578-590

Elsevier

Access to resources Recommend Favorite

The transportation problem with exclusionary side constraints and two branch-and-bound algorithms

By Sun M.  

European Journal of Operational Research, Vol. 140, Iss. 3, 2002-08 ,pp. : 629-647

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for the two-stage assembly scheduling problem

By Hariri A.M.A.   Potts C.N.  

European Journal of Operational Research, Vol. 103, Iss. 3, 1997-12 ,pp. : 547-556

Elsevier

Access to resources Recommend Favorite