CSpace
Approximation schemes for scheduling a batching machine with nonidentical job size
Zhang, Xianzhao1; Zhang, Yuzhong2; Cao, Zhigang3; Cai, Zengxia1
2007-12-01
发表期刊JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
ISSN1009-6124
卷号20期号:4页码:592-600
摘要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.
关键词approximation scheme batching machine size worst case ratio
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Interdisciplinary Applications
WOS记录号WOS:000255240600014
出版者SPRINGER
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/5138
专题中国科学院数学与系统科学研究院
通讯作者Zhang, Xianzhao
作者单位1.Linyi Normal Univ, Dept Math, Linyi 276000, Peoples R China
2.Qufu Normal Univ, Coll Operat Res & Management, Rizhao 276826, Peoples R China
3.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Zhang, Xianzhao,Zhang, Yuzhong,Cao, Zhigang,et al. Approximation schemes for scheduling a batching machine with nonidentical job size[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,2007,20(4):592-600.
APA Zhang, Xianzhao,Zhang, Yuzhong,Cao, Zhigang,&Cai, Zengxia.(2007).Approximation schemes for scheduling a batching machine with nonidentical job size.JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,20(4),592-600.
MLA Zhang, Xianzhao,et al."Approximation schemes for scheduling a batching machine with nonidentical job size".JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 20.4(2007):592-600.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang, Xianzhao]的文章
[Zhang, Yuzhong]的文章
[Cao, Zhigang]的文章
百度学术
百度学术中相似的文章
[Zhang, Xianzhao]的文章
[Zhang, Yuzhong]的文章
[Cao, Zhigang]的文章
必应学术
必应学术中相似的文章
[Zhang, Xianzhao]的文章
[Zhang, Yuzhong]的文章
[Cao, Zhigang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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