minimizing makespan with release times on identical parallel batching     machines

ISCAS OpenIR

	minimizing makespan with release times on identical parallel batching machines
	Li SG; Li GJ; Zhang SQ
	2005
发表期刊	DISCRETE APPLIED MATHEMATICS
ISSN	0166-218X
卷号	148 期号:1 页码:127-134
收录类别	sci ; acm ; sciencedirect ; ei
关键词	Polynomial Time Approximation Scheme Identical Parallel Hatching Machines Scheduling Makespan
部门归属	Yantai Univ, Dept Math & Informat Sci, Yantai 264005, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China. Tianjin Normal Univ, Sch Comp & Informat Engn, Tianjin 300074, Peoples R China.
学科领域	Mathematics, Applied
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12474
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Li SG,Li GJ,Zhang SQ. minimizing makespan with release times on identical parallel batching machines[J]. DISCRETE APPLIED MATHEMATICS,2005,148(1):127-134.
APA	Li SG,Li GJ,&Zhang SQ.(2005).minimizing makespan with release times on identical parallel batching machines.DISCRETE APPLIED MATHEMATICS,148(1),127-134.
MLA	Li SG,et al."minimizing makespan with release times on identical parallel batching machines".DISCRETE APPLIED MATHEMATICS 148.1(2005):127-134.