中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Multi-objective Job Shop Scheduling using a Modified Artificial Bee Colony Algorithm

文献类型:会议论文

作者Ku T(库涛); Zhang H(张浩); Zhu YL(朱云龙)
出版日期2017
会议日期July 31 - August 4, 2017
会议地点Hawaii, USA
页码701-706
英文摘要

To optimize job shop scheduling in smelting process of high-precision copper ingot effectually, a multiobjective model with some nonlinear constraints is established according to the existing production capacity and melting technology of smelting production line for copper ingot. Two objectives of minimizing production time and penalty value for the plans not containing some orders is formulated in this model, which can meet clients' delivery date and reduce production cost. In the paper, a novel modified artificial bee colony algorithm (MABC) is proposed firstly for multi-objective job scheduling optimization according to cooperative coevolution is the concept in symbiosis theory. A new encoding rule for the algorithm is designed to solve the scheduling model of job shop effectively. The experiment results using the actual data in production show that MABC is robust and effective. MABC can obtain better solutions compared to multi-objective particle swarm optimization (MOPSO) and nondominated sorting genetic algorithm II (NSGAII) when solving this scheduling model.

源文献作者IEEE Robotics and Automation Society
产权排序1
会议录2017 IEEE 7th Annual International Conference on CYBER Technology in Automation, Control, and Intelligent Systems, CYBER 2017
会议录出版者IEEE
会议录出版地New York
语种英语
ISBN号978-1-5386-0489-2
WOS记录号WOS:000447628700128
源URL[http://ir.sia.cn/handle/173321/22833]  
专题沈阳自动化研究所_数字工厂研究室
通讯作者Zhang H(张浩)
作者单位Dept. of Information Service and Intelligent Control, Chinese Academy of Sciences, Shenyang Institute of Automation, Shenyang 110016, China
推荐引用方式
GB/T 7714
Ku T,Zhang H,Zhu YL. Multi-objective Job Shop Scheduling using a Modified Artificial Bee Colony Algorithm[C]. 见:. Hawaii, USA. July 31 - August 4, 2017.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。