摘要
通过对产品加工树的分解,可将产品加工工序分为存在具有唯一紧前、紧后相关工序和独立工序,在对这两类工序研究分批综合应用拟关键路径法(ACPM)和最佳适应调度方法(BFSM)调度时,考虑关键设备的工序紧凑性。通过分析与实例验证,所提出的调度方法对解决复杂Job-Shop调度问题不仅算法简练而且效果较好。
The working procedures of products can be divided into the attached one which has the only precursor and subsequence and unattached one by analyzing products procession tree. When ACPM (allied critical path method) and BFSM (best fit scheduling method) are applied to these two procedures and considering the procedures are grouped, the compact of the procedures should be taken into account. The scheduling algorithm is concise and satisfying for settling complicated Job-Shop scheduling by tested with practical examples.
出处
《机械工程学报》
EI
CAS
CSCD
北大核心
2004年第8期13-17,共5页
Journal of Mechanical Engineering
基金
国家自然科学基金(69984002)
黑龙江省自然科学基金(F0309)资助项目。
