Single-Machine Green Scheduling Problem of Multi-speed Machine

Abstract

This paper proposes an accurate dynamic programming algorithm (EDPA) to solve the single-machine scheduling problem with release time (SMSP_RTs), which targets total carbon emissions. First of all, considering the constraints of each workpiece with different release time and expected completion time, and the different speeds of the machine consume different energy, the length of time the workpiece is processed at different speeds is different, and the problem is established on this basis. Sorting model. The model can be expressed as a ternary method. Then, construct a state recursive equation and design an exact dynamic programming algorithm (EDPA). EDPA has the complexity of pseudo-polynomial time to obtain the optimal solution to the problem. Finally, through simulation experiments, the effectiveness of the proposed EDPA is verified, and the influence of machine speed on energy saving and emission reduction is analyzed.