期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 227, 期 2, 页码 301-313出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2012.12.031
关键词
Scheduling; Permutation flowshop; Multi-objective; Sequence dependent setup times; Iterated greedy
资金
- Spanish Ministry of Science and Innovation [DPI2008-03511/DPI]
- Small and Medium Industry of the Generalitat Valenciana (IMPIVA)
- European Union through the European Regional Development Fund (FEDER) [IMDEEA/2011/142, IMDEEA/2012/143]
- [DPI2012-36243-C02-01]
The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of-art method for this important and practical scheduling problem. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据