期刊论文

Xing, Lining

英文

IEEE Transactions on Cybernetics

2168-2267

2021

51

3

1430-1442

10.1109/TCYB.2019.2939219

Manuscript received July 28, 2018; revised December 8, 2018; accepted August 31, 2019. Date of publication September 26, 2019; date of current version February 17, 2021. This work was supported in part by the National Natural Science Foundation of China under Grant 61773120, Grant 61873328, and Grant 61876163, in part by the National Natural Science Fund for Distinguished Young Scholars of China under Grant 61525304, in part by the Natural Science Foundation of Hunan Province under Grant 2018JJ3891, in part by the Dongguan Innovative Research Team Program under Grant 2018607202007, and in part by the Foundation for the Author of National Excellent Doctoral Dissertation of China under Grant 2014-92. This article was recommended by Associate Editor L. Tang. (Corresponding authors: Lining Xing; Ling Wang.) S. Zhou is with the School of Automation, Central South University, Changsha 410083, China (e-mail: zhousc@mail.ustc.edu.cn).

本校为其他机构

Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity constraint and then sort the batches to minimize the makespan. A self-adaptive differential evolution algorithm is developed for addressing the problem. In our proposed algorithm, mutation operators are adaptively chosen based on their historical performances. Also, control parameter values are adaptivel...