%0 Journal Article
%T Study on Complex Product Scheduling Problem with No-wait Constraint between Operations<br>工序间存在零等待约束的复杂产品调度研究
%A XIE Zhi-Qiang LI Zhi-Min HAO Shu-Zhen TAN Guang-YuSchool of Computer Science
%A Technology
%A Harbin University of Science
%A Technology
%A Harbin School of Mechanical Power Engineering
%A Harbin
%A <br>谢志强
%A 李志敏
%A 郝淑珍
%A 谭光宇
%J 自动化学报
%D 2009
%I 
%X 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.
%K No-wait constraint
%K standard operation
%K virtual operation
%K movement and exchange algorithm
%K complex product scheduling<br>零等待约束
%K 标准工序
%K 虚拟工序
%K 移动交换算法
%K 复杂产品调度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=9F45E1327D9AFBFA518B1C572CD5A506&yid=DE12191FBD62783C&vid=6209D9E8050195F5&iid=DF92D298D3FF1E6E&sid=88B4027FEBE4F5FF&eid=A73A882009D0AEFE&journal_id=0254-4156&journal_name=自动化学报&referenced_num=0&reference_num=0