4.7 Article

A two-stage memetic algorithm for energy-efficient flexible job shop scheduling by means of decreasing the total number of machine restarts

期刊

SWARM AND EVOLUTIONARY COMPUTATION
卷 75, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.swevo.2022.101131

关键词

Energy -efficient flexible job shop scheduling; Multi -objective optimization; Memetic algorithm

资金

  1. National Nature Science Foundation of China [72001217]
  2. Nature Science Foundation of Hunan [2021JJ41081]
  3. Nature Science Foundation of Changsha [kq2007033]
  4. National Key R & D Program of China [2018YFB1701400]
  5. State Key Laboratory of Construction Machinery [SKLCM2019-03]
  6. Foshan Technological Innovation Project [1920001000041]

向作者/读者索取更多资源

The study proposes a mathematical model for energy-efficient flexible job shop scheduling, aiming to minimize total energy consumption and the number of machine restarts. By adjusting the start time of operations, the study effectively reduces the number of restarts and total energy consumption without affecting the makespan.
Machine on/off control is an effective way to achieve energy-efficient production scheduling. Turning off ma-chines and restarting them frequently, however, would incur a considerable amount of additional energy and may even cause damage to the machines. In this paper, we propose a mathematical model based on the energy -efficient flexible job shop scheduling problem (EEFJSP), aiming to minimize not just the makespan and total energy consumption but also the total number of machine restarts. Our idea here is that shifting the start time of operations on different machines appropriately can effectively decrease the number of restarts required and the total energy consumption. We present a two-stage memetic algorithm (TMA) to solve the EEFJSP. A variable neighborhood search approach is designed to improve the convergence speed and fully exploit the solution space of the TMA. An operation-block moving operator is developed to further reduce the total energy consumption as well as the total number of machine restarts without affecting the makespan. Extensive computational experi-ments carried out to compare the TMA with some well-known algorithms confirm that the proposed TMA can easily obtain better Pareto solutions for the EEFJSP.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据