QQ客服 官方微博 反馈留言

	Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities
	Jia,Zhaohong; Leung,Joseph Y. T.; Li,Xiaohao
刊名	Future Generation Computer Systems
	2017
卷号	Vol.67页码:22-34
关键词	PROCESSING SET RESTRICTIONS HYBRID GENETIC ALGORITHM SCHEDULING PROBLEM PARALLEL MACHINES MAXIMUM LATENESS SEMICONDUCTOR ARRIVALS FAMILIES OPTIMIZATION MINIMIZATION
ISSN号	0167-739X
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2155641
专题	安徽大学
作者单位	1.New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA 2.Hefei Univ Technol, Sch Management, Hefei 230009, Anhui, Peoples R China 3.Anhui Univ, Minist Educ, Key Lab Intelligent Comp & Signal Proc, Hefei 230039, Anhui, Peoples R China
推荐引用方式 GB/T 7714	Jia,Zhaohong,Leung,Joseph Y. T.,Li,Xiaohao. Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities[J]. Future Generation Computer Systems,2017,Vol.67:22-34.
APA	Jia,Zhaohong,Leung,Joseph Y. T.,&Li,Xiaohao.(2017).Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities.Future Generation Computer Systems,Vol.67,22-34.
MLA	Jia,Zhaohong,et al."Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities".Future Generation Computer Systems Vol.67(2017):22-34.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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