关键词: 设置时间, 绿色并行机调度, 自适应多种群Jaya算法, 多目标优化, Pareto寻优

Abstract: Considering that there was sequence dependent preparation time when the same machine processed different jobs,the Green Parallel Machine Scheduling Problem with Set Time (GPMSP-ST) was studied.Aiming at the problem,a two-dimensional real coding scheme was used to map the solution space effectively and an Self-adaptive Multi-population Jaya algorithm (SAMP-Jaya) was designed to solve the multi-objective problem.The algorithm was optimized by Pareto optimization and congestion calculation mechanism.On the basis of Jaya algorithm,the position vector sorting mechanism was designed to realize the effective combination of continuous solution and GPMSP-ST discrete solution.The random rule and equilibrium rule were combined to improve the initial population quality and the search diversity and convergence rate of the adaptive multi-population enhancement algorithm were designed.The results showed that SAMP-Jaya was superior in solving GPMSP-ST problem through the test and analysis of several examples and other four algorithms.

Key words: set time, green parallel machine scheduling, self-adaptive multi-population Jaya algorithm, multi-objective optimization, Pareto optimization