摘要
针对具有路径柔性的Ｊｏｂｓｈｏｐ调度问题，以调度长度极小化为优化目标，提出了一种新的动态优化调度算法．该算法将优化分配算法、可行优化调度算法和故障（或修复）调度算法有机地集成起来，能够在系统设备出现异常（例如发生故障或修复等）时，迅速产生最优或次最优调度．并以机床发生故障及修复为例对该算法进行了仿真实验，证实了该算法的高效性和有效性．
For Jobshop scheduling problems with routing flexibility, a new dynamic optimal scheduling algorithm is put forward to achieve the minimum makespan. The algorithm integrates optimal distribution, feasible optimal scheduling and fault(or restore) scheduling algorithms, which quickly generates optimal or near optimal schedules in the event that abnomality occurs in the facilities. This paper simulates the algorithm taking examples of machine fault and/or repair and proves the effectiveness of the algorithm.
出处
《哈尔滨工业大学学报》
EI
CAS
CSCD
北大核心
1998年第5期61-64,共4页
Journal of Harbin Institute of Technology
