期刊
COMPUTERS & OPERATIONS RESEARCH
卷 36, 期 9, 页码 2682-2689出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2008.11.018
关键词
Assembly flowshop; Bicriteria; Makespan; Maximum lateness; Heuristic
类别
资金
- Kuwait University Research Administration [EO 06/06]
We consider a two-stage assembly flowshop scheduling problem with the objective of minimizing a weighted sum of makespan and maximum lateness. The problem is known to be NP-hard, and therefore, we propose heuristics to solve the problem. The proposed heuristics are Tabu search (Tabu), particle swarm optimization (PSO), and self-adaptive differential evolution (SDE). An extensive computational experiment is conducted to compare performances of the proposed heuristics. The computational experiment reveals that both PSO and SIDE are much superior to Tabu. Moreover, it is statistically shown that PSO performs better than SDE. The computation times of both PSO and SDE are close to each other and they are less than 40 and 45 s, respectively, for the largest size problem considered. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据