A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking

Author： Han Yu-Yan Gong Dunwei Sun Xiaoyan

Publisher： Taylor & Francis Ltd

E-ISSN： 1029-0273|47|7|927-946

ISSN： 0305-215X

Source： Engineering Optimization, Vol.47, Iss.7, 2015-07, pp. : 927-946

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

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

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

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

An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem

By T'kindt V. Monmarche N. Tercinet F. Laugt D.

European Journal of Operational Research, Vol. 142, Iss. 2, 2002-10 ,pp. : 250-257

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