A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

Author： Jinliang C. Kise H. Matsumoto H.

Publisher： Elsevier

ISSN： 0377-2217

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

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

An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem

By Xu Ye Wang Ling Wang Shengyao Liu Min

Engineering Optimization, Vol. 46, Iss. 9, 2014-09 ,pp. : 1269-1283

Taylor & Francis Ltd

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