Scheduling a Flexible Batching Machine

Authors:
Baoqiang Fan;Jianzhong Gu;Guochun Tang
Affiliations:
Department of Mathematics and Information, Ludong University, Yantai 264025, People's Republic of China;Department of Mathematics and Information, Ludong University, Yantai 264025, People's Republic of China;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209, People's Republic of China
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 3
Cited 0

Batching and scheduling jobs on batch and discrete processors

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling jobs on a flexible batching machine: model, complexity and algorithms

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimizing total completion time 茂戮驴 Cjon normal batching machine is solvable in polynomial time for fixed B(B 1), while Minimizing total completion time 茂戮驴 Cjfor arbitrary Band minimizing total weighted completion time 茂戮驴 WjCjare 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.