基于禁忌搜索的柔性作业车间分批调度  

An Integrated Tabu Search Algorithm for the Lot Streaming Problem in Flexible Job Shops

作　　者：陆汉东[1] 何卫平[1] 周旭[1] 李亚杰[1] 

机构地区：[1]西北工业大学现代设计与集成制造教育部重点实验室,西安710072

出　　处：《上海交通大学学报》2012年第12期2003-2008,共6页Journal of Shanghai Jiaotong University

基　　金：国防基础科研项目(A2720110011)

摘　　要：针对柔性作业车间的分批调度问题,提出了一种基于禁忌搜索算法的柔性分批调度算法.首先进行批次初始划分;然后利用禁忌搜索算法优化批次加工路线和子批加工顺序;最后在零件子批数不变的前提下,利用批量变化局部搜索进行批量分割的优化,实现了最小化完工时间和机床负荷的调度目标.实例分析结果证明了柔性分批调度算法的可行性、高效性和适用性.To solve the problem of flexible job shop scheduling with lot-splitting,a flexible size lot-splitting scheduling algorithm based on tabu search was presented,which incorporates the predetermination of sublot sizes,the determination of schedules based on tabu search and the variation of sublot sizes,to minimize the makespan and machine workload.Performance of the algorithm was evaluated through simulations,and the results demonstrate the feasibility,efficiency and utility of the algorithm.

关 键 词：调度 批量分割 柔性作业车间 禁忌搜索法 

分 类 号：F406[经济管理—产业经济]