Integrated scheduling algorithm of three workshops taking the finishing time of migration procedure into account
Aiming at the problem that the two asymmetry workshops taking the finishing time of migration into account integrated scheduling algorithm,which didn”t consider about the integrated scheduling problems based on multi-workshops.So the integrated scheduling algorithm of three workshops is proposed,which takes the finishing time of procedure migration into account.This strategy scheduling order is according to the dynamic critical path method(DCPM),and choosing the workshops for procedure sequentially.In order to select the best migration scheme,the strategy of shortest migration time of procedure is designed,all kinds of migration time for procedure are calculated to choose the migration workshop which can make procedures complete earlier.When the workshop cannot confirmed by the strategy,then the strategy of equipment utilization balance is designed,the total processing time of all procedures on the equipment and the final end time are calculated to choose the proper workshop.The instance shows that,the complexity of algorithm is not higher than quadratic polynomial,and it shortens the total processing time of product eff ectively.What”s mo re,it implements distributed integrated scheduling of multi-workshops with different equipment resources.
integrated scheduling algorithm Multi-workshops DCPM the finishing time of migration procedures the equipments utilization balance
Zhiqiang Xie Youwei Wang Wenxiu Su Guang Lu
School of Computer Science and Technology,Harbin University of Science and Technology,Harbin,China
国内会议
第10届全国计算机支持的协同工作学术会议暨中国计算机学会协同计算专委年度工作会议
太原
英文
440-444
2015-08-28（万方平台首次上网日期，不代表论文的发表时间）