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

Author： T'kindt V.   Monmarche N.   Tercinet F.   Laugt D.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

By  

International Journal of Applied Industrial Engineering (IJAIE), Vol. 3, Iss. 1, 2016-01 ,pp. : 55-73

IGI Global_journal

Access to resources Recommend Favorite

A bicriteria two-machine permutation flowshop problem

By Sivrikaya-Serifoglu F.   Ulusoy G.  

European Journal of Operational Research, Vol. 107, Iss. 2, 1998-06 ,pp. : 414-430

Elsevier

Access to resources Recommend Favorite

The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

By Allahverdi A.  

European Journal of Operational Research, Vol. 147, Iss. 2, 2003-06 ,pp. : 373-396

Elsevier

Access to resources Recommend Favorite

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

By Han Yu-Yan   Gong Dunwei   Sun Xiaoyan  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Optimization of the keyboard arrangement problem using an Ant Colony algorithm

By Eggers J.   Feillet D.   Kehl S.   Oliver Wagner M.   Yannou B.  

European Journal of Operational Research, Vol. 148, Iss. 3, 2003-08 ,pp. : 672-686

Elsevier

Access to resources Recommend Favorite