一种装配产品调度问题的粒子群算法实现  

Realization of Assembly Job Shop Scheduling Problem with Particle Swarm Optimization Algorithm

作　　者：杨婷婷[1,2] 吕海利[1] 董明望[1] 王凯[3] 

机构地区：[1]武汉理工大学物流工程学院,武汉430063 [2]武汉华盛青桐科技有限责任公司,武汉430063 [3]武汉大学经济与管理学院,武汉430072

出　　处：《武汉理工大学学报》2015年第11期93-100,共8页Journal of Wuhan University of Technology

基　　金：国家自然科学基金青年项目(71301124);教育部人文社科青年项目(13YJC630165);湖北省科技支撑计划(DXCY2015000243)

摘　　要：目前,多品种、小批量、高柔性的生产方式已逐渐成为主流,生产方式的复杂化推动了作业车间调度(Job Shop Scheduling,JSS)问题的研究。粒子群算法作为求解复杂调度问题的一种高效的进化类算法,受到众多学者的关注。以往研究更多关注作业车间调度问题,作者则研究有多层装配工序的作业车间调度问题,即装配作业车间调度问题(Assembly Job Shop Scheduling,AJSS)。针对以总加工时间(makespan)最小化为目标的典型装配作业调度问题,提出了粒子群算法的解决方案,并对该算法中的一些重要参数的设置进行了比较分析,对如何设置合适参数提高求解效率提供参考和建议。Nowadays production mode of multi-variety products, small quantity with high-flexibility has become the trend of modern manufacturing systems. Increasing complexity of the manufacturing process promotes more attention for research on problem of job shop scheduling. The Particle Swarm Optimization （PSO）, as an efficient evolutionary algo- rithm for complex scheduling problems, draws many scholars attention. Past research focused more on job shop scheduling problem （JSSP）,while this paper dealed with the job shop scheduling problem with multi-level assembly operations, as- sembly job shop scheduling problem （AJSSP）. The objective was to minimize total production time, makespan, which is corgmonly used in previous research. A PSO solution was presented to optimize this problem. Different settings of impor tarot PSO paramet,ers were tested and useful suggestions about parameter settings were given.

关 键 词：装配作业车间调度 粒子群算法 参数设置 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]