Energy-efficient rescheduling with time-of-use energy cost: Application of variable neighborhood search algorithm

• Published in: Computers & industrial engineering Vol. 156; p. 107286
• Main Authors: Kong, Min, Xu, Jin, Zhang, Tinglong, Lu, Shaojun, Fang, Chang, Mladenovic, Nenad
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.06.2021
• Subjects: Dynamic programming; Energy-efficient scheduling; Meta-heuristic; Rescheduling; Time-of-use cost; Rescheduling; Dynamic programming; Meta-heuristic; Time-of-use cost; Energy-efficient scheduling
• ISSN: 0360-8352; 1879-0550
• DOI: 10.1016/j.cie.2021.107286

•Proposing a new energy efficient rescheduling problem with deteriorating jobs.•Characterizing several structural properties for the optimal rescheduling scheme.•Developing LDR-LDR algorithm to obtain the optimal sequence for both the original jobs and new jobs.•Proposing variable neighborhood search algorithm with three novel neighborhood structures.•Designing a fitness measure algorithm based on a dynamic programming algorithm. Energy-efficient scheduling has drawn wide attention in the last few decades from both academia and industry due to its significance in energy saving and environmental protection. However, dynamic disruptions in practical scenarios such as dynamic arrival of orders, release time of raw materials, and machine breakdown, make it challenging to find an energy-efficient scheduling scheme. In an effort to overcome this challenge, we propose a novel energy- efficient rescheduling model with Time-of-use (TOU) energy cost, where two energy costs in peak and off-peak periods for processing jobs are considered. The objective of this work is to minimize the total energy consumption of both the original and new arrival jobs without excessively disrupting the original jobs’ schedule. To solve this problem, we first analyze the characteristics and calculation of energy consumption. We then apply a variable neighborhood search algorithm (VNS) to obtain near-optimal solutions. To avoid invalid swapping operations in the existing swapping neighborhood structures, three novel swapping neighborhood structures are proposed in the VNS algorithm. Computational experiments are performed to show the effectiveness and efficiency of the proposed algorithm.