4.7 Article

Energy-efficient production scheduling through machine on/off control during preventive maintenance

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2021.104359

关键词

Energy-efficient scheduling; Machine maintenance; Heuristics; Machine on/off control; Multi-objective optimisation

资金

  1. National Nature Science Foundation of China [72001217]
  2. Nature Science Foundation of Changsha, China [kq2007033, kq2014151]
  3. National Key R&D Program of China [2018YFB1701400]
  4. State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body, Hunan University, China [71775004]
  5. State Key Laboratory of Construction Machinery, China [SKLCM2019-03]

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

This paper investigates an extension of energy-efficient production scheduling incorporating machine on/off control and maintenance, providing rules and heuristics to optimize scheduling solutions with different objectives and constraints. Experimental results demonstrate promising performance across various types of scheduling problems.
This paper studies an important extension of energy-efficient production scheduling research, where machine on/off control and machine maintenance are considered simultaneously. The inspiration of this extension is that a machine must be turned off if it needs to be maintained, and an already-turned-off machine can be maintained without needing to be restarted. We therefore formulate an energy-efficient production scheduling problem with machine maintenance through machine on/off control, aiming to optimise three objectives the makespan, total number of machine restarts, and energy consumption - at the same time. Four rules are designed to set the machine on/off criteria, maintenance periods and predefined maintenance windows, based on solutions of the job shop scheduling problem (JSP) as a test case. Three heuristics are proposed to insert the maintenance activities into the solutions and move their maintenance-operation blocks to optimise the objectives. The effectiveness of the first rule and the moving of maintenance-operation blocks have been proven mathematically. Our proposed heuristics, unlike traditional heuristic algorithms, are expected to be applicable and effective even if we change the objectives and constraints, require minimal computational time (only a few seconds) to optimise a scheduling solution, and can solve different types of scheduling problems without needing any modification. Experiments undertaken indicate promising performance of the proposed heuristics based on 182 JSP benchmark instances.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据