文献类型：期刊文献

中文题名：工序加工时间不确定的可重入调度问题的求解

英文题名：Solution of reentrant scheduling problem with uncertain processing time

作者：朱艳艳[1];徐震浩[1];顾幸生[1]

机构：[1]华东理工大学信息科学与工程学院,上海200237

年份：2021

卷号：36

期号：5

起止页码：1127

中文期刊名：控制与决策

外文期刊名：Control and Decision

收录：CSTPCD;;EI(收录号：20211710250340);Scopus;北大核心:【北大核心2020】；CSCD:【CSCD2021_2022】；

基金：国家自然科学基金项目(61573144,61673175,61603139)。

语种：中文

中文关键词：加工时间不确定;区间数;可重入调度;变邻域搜索;化学反应优化算法;提前/拖期惩罚

外文关键词：uncertain processing time;interval number;reentrant scheduling;variable neighborhood search;chemical reaction optimization algorithm;E/T penalty

摘要：针对一类工序加工时间不确定的可重入调度问题,以提前/拖期惩罚区间大小为目标构建调度模型,并设计一种兼顾区间极值和区间跨度的方法对惩罚区间进行定量比较,同时可根据生产的实际需求或调度人员的倾向灵活调节区间极值和区间跨度所占的比重.根据调度模型,提出一种变邻域化学反应优化算法(VNCRO),并设计4种化学反应.其中:碰壁反应采用粒子群算法中对最优粒子的跟踪思想和变步长邻域搜索方法,加速算法收敛,同时使局部搜索更加精细;双分子碰撞反应可使种群内分子进行信息交流.结合所设计的全局搜索分解反应和合成反应,可使局部搜索与全局搜索达到更好的平衡.通过仿真实验验证模型的可靠性,并通过与CRO、DICA、IDABC、DWOA算法的性能比较,说明VNCRO算法在解决工序加工时间不确定的可重入调度问题的优越性.
Aiming at a kind of reentrant scheduling problem that processing time is difficult to accurately express, an scheduling model is constructed taking E/T penalty interval is as the objective. A method considering interval extreme value and interval span is designed to compare different penalty intervals for E/T quantitatively. At the same time, the proportion of interval extreme value and interval span can be adjusted according to the actual demand or the tendency of schedulers. In addition, according to the established scheduling model, a variable neighborhood chemical reaction optimization algorithm(VNCRO) is proposed. Four kinds of chemical reactions are designed. The on-wall ineffective collision adopts the idea of tracking the optimal particle in the PSO algorithm and the method of variable step size neighborhood. The inter-molecular ineffective collision makes the information exchange among the molecules in the population. Combined with the decomposition reaction and synthesis reaction, the local search and the global search reach a better balance. The reliability of the model is verified by simulation experiments. By comparing with CRO,DICA, IDABC, DWOA algorithms, the superiority of the VNCRO algorithm in resolving reentrant scheduling problem with uncertain processing time is illustrated.