期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 37, 期 2, 页码 1361-1368出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2009.06.105
关键词
Flow shop scheduling; Multi-objective; Makespan; Flowtime; Heuristics; Ant colony optimization
In this paper, we consider the flow shop scheduling problem with respect to the both objectives of makespan and total flowtime. This problem is known to be NP-hard type in literature Several algorithms have been proposed to solve this problem We present a multi-objective ant colony system algorithm (MOACSA). which combines ant colony optimization approach and a local search strategy in order to solve this scheduling problem. The proposed algorithm is tested with well-known problems in literature Its solution performance was compared with the existing multi-objective heuristics. The Computational results show that proposed algorithm is more efficient and better than other methods compared (C) 2009 Elsevier Ltd. All rights reserved
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据