考虑配合加工的作业车间启发式倒排调度算法  

The Reserve Heuristic Algorithm Based on Matching Machining Job Shop Scheduling Problem

作　　者：赵芳[1] 姜莉莉[1] 习小英[1] 李根[1] 

机构地区：[1]广东工业大学机电工程学院,广东广州510006

出　　处：《机电工程技术》2010年第3期51-53,共3页Mechanical & Electrical Engineering Technology

基　　金：广州市科技计划项目(项目编号2007C13G0021);广东工业大学校青年基金"配合加工条件下的车间调度模型的研究及建立"

摘　　要：目前对制造业领域作业车间调度问题研究中,配合加工增加了调度的约束,使调度的难度进一步加大。根据实际配合加工作业车间环境,建立了以最短加工时间为目标的调度模型,采用启发式倒排算法对其求解,该算法能保证工件的交货期,最后通过实例对算法进行验证并给出对比结果。In study of job shop scheduling problem in manufacturing field,scheduling constraint is added by matching machining hence scheduling is made more difficult. A model whose objective is minimizing the overall completion time is established according to the actual environment. The backward heuristic scheduling algorithm is proposed to solve the model and can ensure the delivery date. Finally,an example is illustrated to verify the algorithm and the comparison result is given.

关 键 词：作业车间调度 配合加工 倒排 交货期 

分 类 号：TH186[机械工程—机械制造及自动化]