复杂无等待自动化制造系统的调度算法研究  

Polynomial algorithm for cyclic scheduling of a complex no-wait robotic production system

作　　者：车阿大[1] 晏鹏宇[1] 杨乃定[1] 

机构地区：[1]西北工业大学管理学院,陕西西安710072

出　　处：《计算机集成制造系统》2007年第8期1616-1623,共8页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(50605052);国家教育部"新世纪优秀人才支持计划"资助项目(NCET-06-0875);西北工业大学研究生创业种子基金资助项目(Z200674)。~~

摘　　要：针对一类存在并行工作站和可重入工作站的复杂无等待自动化制造系统的调度问题,提出了利用禁止区间法建立该问题的数学模型,并开发了一种多项式时间复杂度的最优算法。该算法已经在自动化电镀生产线中得到应用,证明了该模型和方法的有效性。To deal with cyclic scheduling problem of a complicated no-wait robotic production system in automatic manufacturing system which was characterized by its parallel work stations and re-enter work stations, a mathematical model was set up by a set of forbidden intervals for the cycle time. Then an optimal polynomial algorithm was developed. Effectiveness of the algorithm was verified by an application example of an electroplating line in Printed Circuit Board （PCB） manufacturing.

关 键 词：复杂制造系统 无等待 多项式算法 

分 类 号：O211.1[理学—概率论与数理统计] TP278[理学—数学]