approximationschemesforschedulingabatchingmachinewithnonidenticaljobsize

CSpace

	approximationschemesforschedulingabatchingmachinewithnonidenticaljobsize
	Xianzhao Zhang 1; Yuzhong Zhang 2; Zhigang Cao 3; Zengxia Cai 1
	2007
发表期刊	journalofsystemsscienceandcomplexity
ISSN	1009-6124
卷号	020 期号:004 页码:592
摘要	In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having shown that the problem is NP-hard, we put forward three approximation schemes with worst case ratio 4, 2, and 3/2, respectively.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/43103
专题	中国科学院数学与系统科学研究院
作者单位	1.Department of Mathematics, Linyi Normal University 2.曲阜师范大学 3.中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Xianzhao Zhang,Yuzhong Zhang,Zhigang Cao,et al. approximationschemesforschedulingabatchingmachinewithnonidenticaljobsize[J]. journalofsystemsscienceandcomplexity,2007,020(004):592.
APA	Xianzhao Zhang,Yuzhong Zhang,Zhigang Cao,&Zengxia Cai.(2007).approximationschemesforschedulingabatchingmachinewithnonidenticaljobsize.journalofsystemsscienceandcomplexity,020(004),592.
MLA	Xianzhao Zhang,et al."approximationschemesforschedulingabatchingmachinewithnonidenticaljobsize".journalofsystemsscienceandcomplexity 020.004(2007):592.