柔性作业车间的任务分配及优化方法  

Task distributions and their optimization in flexible job-shops

作　　者：张国军[1] 湛红晖[1] 邵新宇[1] 朱海平[1] 

机构地区：[1]华中科技大学数字制造装备与技术国家重点实验室,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2010年第3期4-7,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家高技术研究发展计划重点资助项目(2007AA040701);国家重点基础研究发展计划资助项目(2005CB724100)

摘　　要：针对柔性作业车间中存在的多工艺路线和多加工路径的生产条件,以整个任务的加工时间最小化为目标,提出了有限缓冲条件下的任务分配模型.基于Wardrop用户平衡原理,利用增量分配法求解该模型,进而求解各路径和各加工单元的任务分配量,以及任务的最小化加工时间.通过一个加工单元具有非线性加工时间和多工艺路线的实例证明了该模型和方法的有效性.该模型和算法,可以将任务分解到各加工路径上,并且能够确定各资源加工的时间窗.The problems of flexitable job-shops were analyzed.A novel model for task distribution with buffer constraint was proposed.On the principle of user equilibrium proposed by Wardrop,the model was solved by incremental assignment method to obtain the task distributions of all manufacture cells and process routes and to settle the minimum makespan of tasks.A practical example with non-linear process rate and multi-process-routes was afforded,and the validity of the model and the algorithm also has been proved.Using the model and the algorithm provided,the process time-windows of all cells can be acquired,and there is a better instructional significance for flexible job-shops scheduling.

关 键 词：柔性作业车间 任务分配模型 增量分配法 完工时间 多工艺路线 多加工路径 缓冲约束 

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