Abstract: Aiming at the non-independent processes and non-exclusive resources occupation of Job Shop Scheduling Problem (JSSP),the processing technology of matching and same-time-stop scheduling constraints based on improved genetic algorithm was proposed.By analyzing matching,batch processing,process sequence and machine constraints,the target model for utilization rate of batch processing machines and average delay time of task was built.To solve matching and batch processing constraints,a two-dimensional encoding chromosome was designed and the processing procedure of scheduling constraints based on Genetic Algorithm (GA) was presented.To meet scheduling constraints,the adjustment mechanism of blending chromosome meeting dynamic process combination was raised.The same-time-stop constraint within processes was well solved.The engineering example analysis demonstrated the effectiveness of proposed technology.

Key words: genetic algorithms, dynamic process combination, batch processing, matching constraint, same time stop constraint, scheduling

摘要： 针对离散作业车间调度中的工序作业非独立以及资源非独占式占用的作业排产需求,提出面向配作及批处理的基于改进遗传算法的配作齐停类调度约束处理技术。通过分析配作、批处理、工艺顺序和设备能力等约束,建立了综合批处理设备的利用率和订单平均延误时间的目标模型。设计了一种综合适应配作和批处理约束的二维染色体编码方式,提出基于遗传算法的配作齐停类调度约束处理流程。结合配作和批处理约束所要求的工序级协调需求,提出一种面向配作约束的加工序列染色体调整机制,以及面向动态分批的合批染色体调整机制,解决了多工序间的加工时间齐停控制问题。最后结合工程实例验证了技术的有效性。

关键词: 遗传算法, 动态工序组合, 批处理, 配作约束, 齐停约束, 调度