摘要
为解决无等待多机器人制造单元的调度问题,应用禁止区间法,建立了无等待多机器人制造单元调度的数学模型。在分析模型的基础上,证明了问题的最优周期长度必定是某一个特定的周期长度值。提出了基于图论的算法,并以此验证这些特定的周期长度值的可行性。以上述工作为基础,为无等待多机器人制造单元开发了能求解最优解的多项式调度算法,并以自动化印刷电路板电镀生产线为例,对提出的模型和算法进行了验证。
A mathematical model for scheduling a no-wait robotic cell with multiple robots was developed by using forbidden intervals method. Based on the analysis of the developed mathematical model, it was proved that the optimal cycle time was the specific values for the cycle time. Next, a graph-based polynomial algorithm was proposed to check the feasibility of those specific values. Based on above work, an optimal polynomial algorithm was put forward to solve the no-wait scheduling problem. Finally, this algorithm was verified by an example from an electroplating line in Printed Circuit Board (PCB) manufacturing.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2008年第3期525-534,共10页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(50605052)
国家教育部新世纪优秀人才支持计划资助项目(NCET-06-0875)~~