minimizing makespan on a single batching machine with release times and     non-identical job sizes

ISCAS OpenIR

	minimizing makespan on a single batching machine with release times and non-identical job sizes
	Li SG; Li GJ; Wang XL; Liu QM
	2005
发表期刊	OPERATIONS RESEARCH LETTERS
ISSN	0167-6377
卷号	33 期号:2 页码:157-164
收录类别	sci ; sciencedirect ; ei
关键词	Approximation Algorithms Scheduling Batch Processing Makespan Release Times
部门归属	Yantai Univ, Dept Math & Informat Sci, Yantai 264005, Peoples R China. Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Yantai Normal Univ, Sch Comp Sci & Technol, Yantai 264025, Peoples R China.
学科领域	Operations Research & Management Science
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12476
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Li SG,Li GJ,Wang XL,et al. minimizing makespan on a single batching machine with release times and non-identical job sizes[J]. OPERATIONS RESEARCH LETTERS,2005,33(2):157-164.
APA	Li SG,Li GJ,Wang XL,&Liu QM.(2005).minimizing makespan on a single batching machine with release times and non-identical job sizes.OPERATIONS RESEARCH LETTERS,33(2),157-164.
MLA	Li SG,et al."minimizing makespan on a single batching machine with release times and non-identical job sizes".OPERATIONS RESEARCH LETTERS 33.2(2005):157-164.