期刊
SWARM AND EVOLUTIONARY COMPUTATION
卷 50, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.swevo.2019.100557
关键词
Distributed no-idle flow-shop; Energy-efficient multi-objective scheduling; Collaborative optimization algorithm; Competitive; Local intensification
资金
- National Key R&D Program of China [2016YFB0901900]
- National Natural Science Fund for Distinguished Young Scholars of China [61525304]
- National Natural Science Foundation of China [61873328, 61772145, 2018607202007]
Facing the energy crisis, manufacturers is paying much attention to the energy-efficient scheduling by taking both economic benefits and energy conservation into account. Meanwhile, with the economic globalization, it is significant to facilitate the advanced manufacturing and scheduling in the distributed way. This paper addresses the energy-efficient distributed no-idle permutation flow-shop scheduling problem (EEDNIPFSP) to minimize makespan and total energy consumption simultaneously. By analyzing the characteristics of the problem, several properties are derived. To solve the problem effectively, a collaborative optimization algorithm (COA) is proposed by using the properties and some collaborative mechanisms. First, two heuristics are collaboratively utilized for population initialization to guarantee certain quality and diversity. Second, multiple search operators collaborate in a competitive way to enhance the exploration adaptively. Third, different local intensification strategies are designed for the dominated and non-dominated individuals to enhance the exploitation. Fourth, a speed adjusting strategy for the non-critical operations is designed to improve total energy consumption. The effect of key parameters is investigated using the design-of-experiment with full factorial setting. Comparisons based on extensive numerical tests are carried out, which demonstrate the effectiveness of the proposed algorithm in solving the EEDNIPFSP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据