工序间存在零等待约束的复杂产品调度研究  

Study on Complex Product Scheduling Problem with No-wait Constraint between Operations

作　　者：谢志强[1] 李志敏[1] 郝淑珍[1] 谭光宇[2] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080 [2]哈尔滨理工大学机械动力工程学院,哈尔滨150080

出　　处：《自动化学报》2009年第7期983-989,共7页Acta Automatica Sinica

基　　金：国家自然科学基金(50575062;60873019);黑龙江省自然科学基金项目(F200608);黑龙江省教育厅海外学人科研资助重点项目(1152hq08)资助~~

摘　　要：针对实际装配生产中工序之间存在零等待约束的复杂产品的调度问题,提出了一种把存在零等待约束的工序虚拟成一个工序的方法.该方法在提出复杂产品、标准工序、虚拟工序、零等待和扩展加工工艺树的概念基础上,对扩展加工工艺树中的标准工序采用拟关键路径法和最佳适应调度的车间调度算法进行调度,对虚拟工序采用移动交换算法在相应设备上分离调度,将存在零等待约束的调度问题转化为存在虚拟工序的无零等待约束的调度问题.实例表明,所提出的调度算法能够较好地解决具有实际意义的工序间存在零等待约束的复杂产品的调度问题,且易于实现.For the complex product scheduling problem with no-wait constraint between operations in practical assembling manufacture, a method to change operations with no-wait constraint into a virtual operation is proposed. Based on the concepts of complex product, standard operation, virtual operation, no-wait and the expansion processing tree defined in this paper, the standard operations are processed by allied critical path method （ACPM） and best fit scheduling method （BFSM）, and the virtual operations are processed respectively on corresponding machine with movement and exchange algorithm in order to translate scheduling problem with no-wait operations into the general scheduling problem with virtual operations. The result of the examples shows that the scheduling algorithm proposed is an effective solution to the complex product scheduling problem with no-wait constraint between operations and can be easily realized.

关 键 词：零等待约束 标准工序 虚拟工序 移动交换算法 复杂产品调度 

分 类 号：F273[经济管理—企业管理] F224[经济管理—国民经济]