节点文献
基于工序集的动态关键路径多产品制造调度算法
Dynamic Critical Paths Multi-Product Manufacturing Scheduling Algorithm Based on Operation Set
【摘要】 针对已有的树状结构多产品加工和装配综合调度方法,不能兼顾树状结构纵横双向、影响调度结果的问题,提出基于工序集的动态关键路径多产品制造调度算法.该算法首先采用根对齐的方法,将多个树状结构的产品转化成一个虚拟加工树,使多产品调度问题简化为单产品调度问题;在调度过程中,根据虚拟加工树动态生成可调度的备选工序集合,按提出的动态关键路径策略和短用时调度策略从备选集中选择工序,并应用首次适应调度法调度工序,直到备选集合为空,即所有产品加工完毕,实现以纵向为主兼顾横向的双向调度优化.实例证明,算法对多产品加工和装配综合调度问题可以获得更优的解.
【Abstract】 Aiming at the problem that multi-product processing of tree structure and assembly integrated scheduling for schemes existing can not take into account vertical and horizontal of the tree structure so that affect the scheduling result,this paper presents multi-product manufacturing scheduling algorithm dynamic critical paths based on operation set.The algorithm converts multi-products of tree structure into a virtual manufacturing tree in the way of root alignment,and simplifies the multi-product scheduling problem to the single product scheduling problem.In the process of scheduling,a standby operation set is dynamically generated according to the virtual manufacturing tree.Then the operation is chosen from the generated set with dynamic critical paths strategy and Short-time strategy,and scheduled with first fit scheduling method until the set is empty,that is all operations have been manufactured.The algorithm realizes the vertical and horizontal scheduling optimization.It is validated that the algorithm can obtain favorable result for the multi-product processing and assembly integrated scheduling problem.
【Key words】 dynamic critical paths; virtual manufacturing tree; standby operation set; multi-product manufacture; first fit scheduling method;
- 【文献出处】 计算机学报 ,Chinese Journal of Computers , 编辑部邮箱 ,2011年02期
- 【分类号】TP301.6
- 【被引频次】73
- 【下载频次】850