柔性作业车间中机床与自动导引车在线调度方法  

On-line Scheduling Method for Simultaneous Scheduling of Machines and Automated Guided Vehicles in Flexible Job Shop

作　　者：肖海宁[1] 楼佩煌[1] 严伟国[1] 钱晓明[1] 

机构地区：[1]南京航空航天大学机电学院,南京210016

出　　处：《农业机械学报》2013年第4期280-286,共7页Transactions of the Chinese Society for Agricultural Machinery

基　　金：国家自然科学基金资助项目(61105114);江苏省科技支撑计划资助项目(BE2010189);江苏省'六大人才高峰'基金资助项目

摘　　要：针对柔性作业车间中机床与自动导引车同时调度问题,提出了在线调度算法,将调度问题分解成机床选择和自动导引车调度两个子问题求解;首先针对机床选择子问题,根据问题规模分别采用穷举法和小生境遗传算法求解,目标是最小化机床最大负荷,平衡各机床负荷以及最小化搬运系统负荷;在小生境遗传算法设计过程中,采用邻域搜索以提高遗传算法的收敛速度;采用基于海明距离的小生境淘汰运算以保持种群多样性。然后针对自动导引车调度子问题,提出了一种启发式调度算法。为避免作业车间出现死锁,采用基于剩余容量的死锁避免规则。最后通过仿真实验验证了所提算法是可行的。An on-line scheduling algorithm was proposed for simultaneous scheduling of machines and automated guided vehicles in flexible job shop. The problem was decomposed into two sub-problems： machine selection problem and vehicle dispatching problem. The machine selection problem was solved by enumerative method for small size and niche genetic algorithm otherwise. Local search was executed to improve the convergence speed of genetic algorithm. To keep a high degree of population diversity, Hamming distance based niche competition operation was adopted. For vehicle dispatching problem, a heuristic dispatching algorithm was proposed. To ensure the job shop to be deadlock-free, a remaining capacity based deadlock avoidance rule was employed. The simulation results showed that the proposed algorithm was feasible.

关 键 词：自动导引车 柔性作业车间 遗传算法 调度 

分 类 号：TP24[自动化与计算机技术—检测技术与自动化装置] TH165.1[自动化与计算机技术—控制科学与工程]