加工时间为区间数的两阶段流水生产鲁棒调度  

Robust Scheduling of Two-Stage Flow Shop with Interval Processing Times

作　　者：张先超 周泓[2] ZHANG Xianchao;ZHOU Hong(School of Information Science and Engineering,Southeast University,Nanjing 210096,China;School of Economics and Management,Beihang University,Beijing 100191,China)

机构地区：[1]东南大学信息科学与工程学院,南京210096 [2]北京航空航天大学经济管理学院,北京100191

出　　处：《计算机工程与应用》2023年第20期266-273,共8页Computer Engineering and Applications

基　　金：国家自然科学基金(71971011)。

摘　　要：离散制造业中加工时间不确定的现象普遍存在,使得生产过程往往难以按照既定的调度方案来执行,而且难以实现满意的生产效果。研究在加工时间为区间数的环境下,以总完工时间为调度目标的两台机器流水生产鲁棒调度问题,旨在求解Min-Max准则的鲁棒调度方案。在详细描述该流水生产鲁棒调度问题的基础上,建立了问题的半无限数学规划模型。为降低求解复杂性,证明了问题的简化性质和占优性质,并设计了用于求解该问题的分支定界-遗传混合算法。仿真实验表明,提出的方法对该鲁棒调度问题具有很好的适用性。Since processing times are usually uncertain in discrete manufacturing industry,it is hard to implement production schedules as planned.The robust scheduling of two-stage flow shop with interval processing times is studied,which aims to solve robust schedules conformed to the Min-Max decision rule.The corresponding original scheduling problem is to minimize total completion times.Firstly,the robust scheduling problem is modeled as a semi-infinite programming formulation.Secondly,three theorems are proved and a hybrid algorithm is provided to combine branch-bound method and genetic algorithm,which contribute to solve the problem effectively and efficiently.At last,a computational experiment is conducted to illustrate the robust scheduling problem that can be solved through the modeling method and the hybrid algorithm proposed in this paper.

关 键 词：鲁棒调度 两阶段流水生产 Min-Max准则 总完工时间 分支定界-遗传混合算法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术] F406.6[自动化与计算机技术—计算机科学与技术]