QQ客服 官方微博 反馈留言

	Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion
	Sang, Hong-Yan[1]; Pan, Quan-Ke[2]; Li, Jun-Qing[3]; Wang, Ping[4]; Han, Yu-Yan[5]; Gao, Kai-Zhou[6]; Duan, Peng[7]
刊名	SWARM AND EVOLUTIONARY COMPUTATION
	2019
卷号	44页码:64-73
关键词	Flowshop Assembly system Meta-heuristics Invasive weed optimization
ISSN号	2210-6502
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2163674
专题	上海大学
作者单位	1.[1]Liaocheng Univ, Sch Comp Sci, Liaocheng 252059, Peoples R China. 2.[2]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China. 3.[3]Shandong Normal Univ, Sch Informat Sci & Engn, Jinan 250014, Shandong, Peoples R China. 4.[4]Liaocheng Univ, Sch Comp Sci, Liaocheng 252059, Peoples R China. 5.[5]Liaocheng Univ, Sch Comp Sci, Liaocheng 252059, Peoples R China. 6.[6]Macau Univ Sci & Technol, Inst Syst Engn, Macau 999078, Peoples R China. 7.[7]Liaocheng Univ, Sch Comp Sci, Liaocheng 252059, Peoples R China.
推荐引用方式 GB/T 7714	Sang, Hong-Yan[1],Pan, Quan-Ke[2],Li, Jun-Qing[3],et al. Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion[J]. SWARM AND EVOLUTIONARY COMPUTATION,2019,44:64-73.
APA	Sang, Hong-Yan[1].,Pan, Quan-Ke[2].,Li, Jun-Qing[3].,Wang, Ping[4].,Han, Yu-Yan[5].,...&Duan, Peng[7].(2019).Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion.SWARM AND EVOLUTIONARY COMPUTATION,44,64-73.
MLA	Sang, Hong-Yan[1],et al."Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion".SWARM AND EVOLUTIONARY COMPUTATION 44(2019):64-73.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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