CORC  > 西安交通大学
Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines
Zhao, Boxuan; Gao, Jianmin; Chen, Kun; Guo, Ke
刊名JOURNAL OF INTELLIGENT MANUFACTURING
2018
卷号29页码:93-108
关键词Multiple objective scheduling Unrelated parallel machines Flexible job shop scheduling Alternative process plan Two-generation Pareto ant colony algorithm
ISSN号0956-5515
URL标识查看原文
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/2919340
专题西安交通大学
推荐引用方式
GB/T 7714
Zhao, Boxuan,Gao, Jianmin,Chen, Kun,et al. Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines[J]. JOURNAL OF INTELLIGENT MANUFACTURING,2018,29:93-108.
APA Zhao, Boxuan,Gao, Jianmin,Chen, Kun,&Guo, Ke.(2018).Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines.JOURNAL OF INTELLIGENT MANUFACTURING,29,93-108.
MLA Zhao, Boxuan,et al."Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines".JOURNAL OF INTELLIGENT MANUFACTURING 29(2018):93-108.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace