摘要
对于实际生产中经常出现的非紧密衔接工序调度问题,提出一种将非紧密衔接工序变为紧密衔接工序的转换策略,用该策略在对工序间延迟约束进一步研究的基础上,提出标准工序、延迟工序和扩展加工工艺树概念。通过对拟关键路径法和最佳适应调度法算法进一步完善,设计一种通过优先调度延迟工序,对标准工序分批采用拟关键路径法和最佳适应调度法,同时考虑关键设备上标准工序尽量紧凑的具有非紧密衔接工序的动态调度算法。实例验证表明,所提出的调度算法不仅能够较好地解决更具实际意义的动态非紧密衔接工序调度问题,而且能够扩展解决动态紧密衔接工序调度问题。
Aiming at the scheduling problem of non-close- joining operations in the practical production, a new scheduling strategy is put forward. Through further study of lateness constraints among operations, the concepts of the standard operations, the lateness operations and the expansion processing tree are proposed. A dynamic Job-Shop scheduling algorithm with non-close-joining operations is put forward by improving allied critical path method （ACPM） and best fit scheduling method （BFSM）： The lateness operations are scheduled firstly, and the standard operations are scheduled by ACPM and BFSM and are compact on the key machine as soon as possible. The experiment shows that the algorithm not only can solve dynamic Job-shop scheduling problem with non-close-joining operations better but also can be expanded to solve the dynamic Job-shop scheduling problem with close-joining operations.
出处
《机械工程学报》
EI
CAS
CSCD
北大核心
2008年第1期155-160,共6页
Journal of Mechanical Engineering
基金
国家自然科学基金(50575062)
黑龙江省自然科学基金(F200608)
黑龙江省教育厅重大科技基金(10511z0008)
哈尔滨市科技攻关基金(2005AAlCG061-11)资助项目。
关键词
车间调度
非紧密衔接工序
延迟工序
扩展加工工艺树
拟关键路径法
Job-shop scheduling Non-close-joining operation Lateness operation Expansion processing tree Allied critical path method
