CORC  > 上海大学
An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems
Niu, Qun[1]; Zhou, Taijin[2]; Fei, Minrui[3]; Wang, Bing[4]
刊名MATHEMATICS AND COMPUTERS IN SIMULATION
2012
卷号84页码:1-25
关键词Hybrid flow shop scheduling Immune algorithm Quantum algorithm Mean flow time
ISSN号0378-4754
URL标识查看原文
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/2296293
专题上海大学
作者单位1.[1]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai Key Lab Power Stn Automat Technol, Shanghai 200072, Peoples R China.
2.[2]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai Key Lab Power Stn Automat Technol, Shanghai 200072, Peoples R China.
3.[3]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai Key Lab Power Stn Automat Technol, Shanghai 200072, Peoples R China.
4.[4]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai Key Lab Power Stn Automat Technol, Shanghai 200072, Peoples R China.
推荐引用方式
GB/T 7714
Niu, Qun[1],Zhou, Taijin[2],Fei, Minrui[3],et al. An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems[J]. MATHEMATICS AND COMPUTERS IN SIMULATION,2012,84:1-25.
APA Niu, Qun[1],Zhou, Taijin[2],Fei, Minrui[3],&Wang, Bing[4].(2012).An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems.MATHEMATICS AND COMPUTERS IN SIMULATION,84,1-25.
MLA Niu, Qun[1],et al."An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems".MATHEMATICS AND COMPUTERS IN SIMULATION 84(2012):1-25.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


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