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

Author： Hariri A.M.A.   Potts C.N.  

Publisher： Elsevier

ISSN： 0377-2217

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

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 a production scheduling problem in an assembly system under due date constraints

By Park M.-W.   Kim Y.-D.  

European Journal of Operational Research, Vol. 123, Iss. 3, 2000-06 ,pp. : 504-518

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 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

Design of problem-specific evolutionary algorithm/mixed-integer programming hybrids: two-stage stochastic integer programming applied to chemical batch scheduling

By Urselmann Maren  

Engineering Optimization, Vol. 39, Iss. 5, 2007-07 ,pp. : 529-549

Taylor & Francis Ltd

Access to resources Recommend Favorite

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