arrow
Return

A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling

delete2019-11-01
delete103
PRE
AI
陈靖方 cover
陈靖方 (Jing-fang Chen)
王玲 cover
王玲 (Ling Wang) *
Z
Zhiping Peng
DOI:10.1016/j.swevo.2019.100557delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
Distributed no-idle flow-shop
Energy-efficient multi-objective scheduling
Collaborative optimization algorithm
Competitive
Local intensification
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Swarm and Evolutionary Computation cover
Swarm and Evolutionary Computation
IF:
8.5
Papers:
2.2K
Citations:
1.0W

Organization

T
tsinghua university
Scholars:
11.8W
Papers: 10.0W
Citations: 137
G
Guangdong University of Petrochemical Technology
Scholars:
2.0K
Papers: 1.6K
Citations: 1