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

Author： Xu Ye   Wang Ling   Wang Shengyao   Liu Min  

Publisher： Taylor & Francis Ltd

ISSN： 0305-215X

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

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

Related content

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

Sevast'yanov's algorithm for the flow-shop scheduling problem

By Lourenco H.R.  

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 176-189

Elsevier

Access to resources Recommend Favorite

A fast tabu search algorithm for the permutation flow-shop problem

By Nowicki E.   Smutnicki C.  

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 160-175

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

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times

By Cheng J.   Steiner G.   Stephenson P.  

European Journal of Operational Research, Vol. 130, Iss. 3, 2001-05 ,pp. : 559-575

Elsevier

Access to resources Recommend Favorite