Please wait a minute...
浙江大学学报(工学版)
J4  2011, Vol. 45 Issue (4): 719-726    DOI: 10.3785/j.issn.1008-973X.2011.04.022
机械工程、能源工程     
柔性作业车间分批调度多目标优化方法
王云, 冯毅雄, 谭建荣, 高一聪
浙江大学 流体传动及控制国家重点实验室,浙江 杭州 310027
Multi-objective optimization method of flexible
job-shop lot-splitting scheduling
WANG Yun, FENG Yi-xiong, TAN Jian-rong, GAO Yi-cong
State Key Laboratory of Fluid Power Transmission and Control, Zhejiang University, Hangzhou 310027, China
 全文: PDF  HTML
摘要：

为了解决柔性作业车间中小批量工件的分批调度多目标优化问题,构建以制造工期、拖期惩罚、加工成本、批次数量和机器总负荷为目标函数的柔性作业车间多目标调度模型.应用改进的强度Pareto进化算法（SPEA）求解.在该算法中,应用模糊c均值聚类（FCM）加快外部种群的聚类过程,引入自适应的变异算子来增强解的多样性.采用约束Pareto支配和可变长度的编码策略,一次运行就能够求得Pareto最优解集.利用模糊集合理论得到Pareto解的优先选择序列,并从中选出一个最优解.该方法将工件分割成具有柔性数量的多个批次,使各批次的工艺路线选取及加工顺序得到优化.通过实例仿真对该方法的性能进行比较分析.将该方法应用于某机械公司车间调度中,验证了该方法的有效性和适应性.
Abstract:

The multiobjective flexible job-shop scheduling optimization model was conducted in order to solve multi-objective optimization problem of flexible job-shop small batch lotsplitting scheduling. The model was concerned with makespan, tardiness penalty, manufacturing cost, count of batch and total workload. The optimal solutions were obtained by using improved strength Pareto evolutionary algorithm (SPEA). The algorithm was improved by using the fuzzy c-means clustering algorithm to accelerate the clustering procedure within the external population. A self-adaptive mutation operator was also introduced to enhance the diversity of solutions. A Pareto optimal set can be achieved in a single run with the constraint Pareto domination concept and the flexible representation schema. Then the preference sequence of Pareto solutions was achieved and a solution was extracted as the best compromise one based on set theory. The jobs were split into flexible size batch, and the batch routing and sequencing were simultaneously optimized by the method. The performance of the method was evaluated through simulation. The feasibility and validity of the method were proved in a workshop scheduling.
出版日期: 2011-05-05
:  F 406  
基金资助:

国家“863”高技术研究发展计划资助项目(2008AA042301); 国家自然科学基金资助项目(50835008,50875237).
通讯作者: 冯毅雄，男，副教授.     E-mail: cjh1106@zju.edu.cn
作者简介: 王云(1978—)，男，浙江杭州人，博士生, 从事制造业信息化、先进制造技术和多目标优化研究. E-mail: iwangbruce@126.com
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　

引用本文:

王云, 冯毅雄, 谭建荣, 高一聪. 柔性作业车间分批调度多目标优化方法[J]. J4, 2011, 45(4): 719-726.

WANG Yun, FENG Yi-xiong, TAN Jian-rong, GAO Yi-cong. Multi-objective optimization method of flexible
job-shop lot-splitting scheduling. J4, 2011, 45(4): 719-726.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2011.04.022    或    http://www.zjujournals.com/eng/CN/Y2011/V45/I4/719

［1］ XING L N, CHEN Y W, YANG K W. Multiobjective exible job shop schedule: design and evaluation by simulation modeling ［J］. Applied Soft Computing, 2009, 9(1): 362-376.
［2］ 余建军,孙树栋,郝京辉.免疫算法求解多目标柔性作业车间调度研究［J］.计算机集成制造系统,2006,12(10): 1643-1651.
YU Jianjun,SUN Shudong,HAO Jinghui. Multi objective flexible jobshop scheduling based on immune algorithm ［J］. Computer Integrated Manufacturing Systems, 2006, 12(10): 1643-1651.
［3］ 陈勇,吴国献,林飞龙.多品种多工艺车间作业调度的multiAgent建模［J］.浙江大学学报:工学版,2009,43(9): 1672-1678.
CHEN Yong, WU Guoxian, LIN Feilong. Multiagent modeling on scheduling of multivariety and multiprocess jobshop ［J］. Journal of Zhejiang University: Engineering Science, 2009, 43(9): 1672-1678.
［4］ ZHANG G H, SHAO X Y, LI P G, et al. An effective hybrid particle swarm optimization algorithm for multiobjective exible jobshop scheduling problem ［J］. Computers and Industrial Engineering, 2009, 56(4): 1309-1318.
［5］ XIA W J, WU Z M. An effective hybrid optimization approach for multiobjective exible jobshop scheduling problems ［J］. Computers and Industrial Engineering, 2005, 48(2): 409-425.
［6］ LOW C Y, HSU C M, HUANG K I. Benefits of lot splitting in jobshop scheduling ［J］. International Journal of Advanced Manufacturing Technology, 2004, 24(9/10): 773-780.
［7］ JEONG H I, PARK J, LEACHMAN R C. Batch splitting method for a job shop scheduling problem in an MRP environment ［J］. International Journal of Production Research, 1999, 37(15): 3583-3598.
［8］ CHAN F T S, WONG T C, CHAN P L Y. Equal size lot streaming to jobshop scheduling problem using genetic algorithms ［C］∥ Proceedings of the 2004 IEEE International Symposium on Intelligent Control. Taipei: IEEE, 2004: 472-476.

［9］ 潘全科,朱剑英.多工艺路线的批量生产调度优化［J］.机械工程学报,2004,40(4): 36-39.
PAN Quanke, ZHU Jianying. Optimization method for a jobshop scheduling problem with alternative machines in the batch process ［J］. Chinese Journal of Mechanical Engineering, 2004, 40(4): 36-39.
［10］ 鞠全勇,朱剑英.多目标批量生产柔性作业车间优化调度［J］.机械工程学报,2007,43(8): 148-154.
JU Quanyong, ZHU Jianying. Multiobjective flexible job shop scheduling of batch production ［J］. Chinese Journal of Mechanical Engineering, 2007, 43(8): 148-154.
［11］ 孙志峻,安进,黄卫清.作业车间多工艺路线批量作业计划优化［J］.中国机械工程,2008,19(2): 183-187.
SUN Zhijun, AN Jin, HUANG Weiqing. Lot scheduling with multiple process routes in job shop ［J］. China Mechanical Engineering, 2008, 19(2): 183-187.
［12］ ZITZLER E, THIELE L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach ［J］. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257-271.
［13］ 冯士刚,艾芊.火电站多目标负荷调度及其算法的研究［J］.动力工程,2008,28(3): 404-407.
FENG Shigang, AI Qian. Study on multiobjective load dispatch of thermal power plant and it’s algorithm ［J］. Journal of Power Engineering, 2008, 28(3): 404-407.
［14］ DRIK B, PETER S, ROLF D, et al. Multiobjective evolutionary algorithm for the optimization of noisy combustion process ［J］. IEEE Transactions on Systems, Man and Cybernetics, 2002, 32(4): 460-473.
［15］ NIKHIL R, KUHU P, KELER M, et al. A possiblistic fuzzy cmeans clustering algorithm ［J］. IEEE Transactions on Fuzzy Systems, 2005, 13(4): 517-530.
［16］ GUO Y S. A genetic algorithm applied to a class job: shop scheduling problem ［J］. International Journal of Systems Science, 1997, 28 (1): 25-32.
［17］ ABIDO M A. Multiobjective evolutionary algorithms for electric power dispatch problem ［J］. IEEE Transactions on Evolutionary Computation, 2006, 10(3): 315-329.
No related articles found!