QQ客服 官方微博 反馈留言

	A meta-heuristic for minimizing total weighted flow time on parallel batch machines.
	Li, Wei; Leung, Joseph Y-T.; Long, Wen-tao; Zhang, Han; Li, Kai; Jia, Zhao-hong
刊名	Computers & Industrial Engineering
	2018
卷号	Vol.125页码:298-308
关键词	Ant colony optimization algorithm Non-identical job sizes Parallel scheduling Patch processing machines Total weighted completion time
ISSN号	0360-8352
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2204459
专题	安徽大学
作者单位	Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230039, PR China
推荐引用方式 GB/T 7714	Li, Wei,Leung, Joseph Y-T.,Long, Wen-tao,et al. A meta-heuristic for minimizing total weighted flow time on parallel batch machines.[J]. Computers & Industrial Engineering,2018,Vol.125:298-308.
APA	Li, Wei,Leung, Joseph Y-T.,Long, Wen-tao,Zhang, Han,Li, Kai,&Jia, Zhao-hong.(2018).A meta-heuristic for minimizing total weighted flow time on parallel batch machines..Computers & Industrial Engineering,Vol.125,298-308.
MLA	Li, Wei,et al."A meta-heuristic for minimizing total weighted flow time on parallel batch machines.".Computers & Industrial Engineering Vol.125(2018):298-308.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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