期刊
COMPUTERS & OPERATIONS RESEARCH
卷 40, 期 6, 页码 1625-1647出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2011.08.009
关键词
Flowshop scheduling; Bi-objective; Makespan; Total flowtime
类别
资金
- National Science Council of the Republic of China (Taiwan) [NSC 99-2628-E-027-003, NSC 99-2410-H-182-023-MY2]
In this study, a bi-objective multi-start simulated-annealing algorithm (BMSA) is presented for permutation flowshop scheduling problems with the objectives of minimizing the makespan and total flowtime of jobs. To evaluate the performance of the BMSA, computational experiments were conducted on the well-known benchmark problem set provided by Taillard. The non-dominated sets obtained from each of the existing benchmark algorithms and the BMSA were compared, and then combined to form a net non-dominated front. The computational results show that more than 64% of the solutions in the net non-dominated front are contributed by the proposed BMSA. It is believed that these solutions can serve as new benchmarks for future research. (C) 2011 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据