Matching and same time stop scheduling constraint processing technology based on genetic algorithm
Matching and same time stop scheduling constraint processing technology based on genetic algorithm
复制标题
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Wang Xiao-yua
中科院分区：
文献类型：
--
作者：
Wang Xiao-yua
针对作业车间调度问题（JSSP）中工序间的非独立性和资源占用的非独占性，提出了基于改进遗传算法的匹配和同时停止调度约束处理技术，通过分析匹配、批处理、工序顺序和机器约束，建立了批处理机器利用率和任务平均延迟时间的目标模型，解决了匹配约束和批处理约束，设计了一种二维编码染色体，给出了基于遗传算法的调度约束处理流程，提出了满足调度约束的混合染色体动态组合调整机制，较好地解决了工序间的同时停约束，工程实例分析表明了该技术的有效性.
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.