机构:
Ludong Univ, Dept Math & Informat, Yantai 264025, Peoples R ChinaLudong Univ, Dept Math & Informat, Yantai 264025, Peoples R China
Fan, Baoqiang
[1
]
Gu, Jianzhong
论文数: 0引用数: 0
h-index: 0
机构:
Ludong Univ, Dept Math & Informat, Yantai 264025, Peoples R ChinaLudong Univ, Dept Math & Informat, Yantai 264025, Peoples R China
Gu, Jianzhong
[1
]
Tang, Guochun
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Second Polytechn Univ, Inst Management Engn, Shanghai 201209, Peoples R ChinaLudong Univ, Dept Math & Informat, Yantai 264025, Peoples R China
Tang, Guochun
[2
]
机构:
[1] Ludong Univ, Dept Math & Informat, Yantai 264025, Peoples R China
[2] Shanghai Second Polytechn Univ, Inst Management Engn, Shanghai 201209, Peoples R China
来源:
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS
|
2007年
/
4508卷
基金:
中国国家自然科学基金;
关键词:
scheduling;
batching machine;
complexity;
D O I:
暂无
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
Minimizing total completion time Sigma Ci on normal batching machine is solvable in polynomial time for fixed B(B > 1), while Minimizing total completion time Sigma Cj for arbitrary B and minimizing total weighted completion time Sigma WjCj are open problems. In this paper, we consider the problem of scheduling jobs on a flexible batching machine in order to minimizing the total completion time. We prove that the problem is strongly NP-hard. Then the problem with agreeable is NP-hard even if there have three fixed capacities all the time.