We conducted this study with the aim of resolving the scheduling problem of parallel batch processing machines (PBPM) with different capacity constraints and different energy consumption per unit of time, as well as jobs with different processing times, arrival times, delivery dates and sizes, with the goal of simultaneously minimizing the maximum completion time, ET and total energy consumption. The IUDRLM rule is used to batch and sort jobs, and a decomposition-based multi-objective differential evolution algorithm MODE/D is proposed. Simulation experiments are performed to compare the performance of the proposed algorithm to those of existing algorithms. The proposed MODE/D algorithm outperformed NSGA-III in terms of NR value (0.96) and IGD (6.6) measures.
With the continuous development of the information industry, semiconductor manufacturing has become a key basic industry in the information age. Due to the demands of the process, there are more batch processes in the semiconductor manufacturing process, such as the aging test session of chips. In this paper, in the context of semiconductor manufacturing, we consider the unrelated parallel batch processing machine (UPBPM) scheduling problem in which jobs have different processing times, arrival times, sizes, and processing eligibility constraints, where the machines have different capacity constraints and the objective of minimizing the makespan. We propose the actor–critic algorithm, incorporating the Rolling Time Window (R-AC algorithm) to solve the UPBPM scheduling problem. Through simulation experiments, the R-AC algorithm outperforms the separate heuristic scheduling rules.