Scheduling jobs on a flexible batching machine: model, complexity and algorithms

Authors:
Baoqiang Fan;Guochun Tang
Affiliations:
Department of Applied Mathematics, Tongji University, Shanghai, China;Department of Applied Mathematics, Tongji University, Shanghai, China
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 4
Cited 1

Batching and scheduling jobs on batch and discrete processors

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Scheduling one batch processor subject to job release dates

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

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

Scheduling a Flexible Batching Machine

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Normal batching machine scheduling problems are assumed that the capacity of the machine, the maximum number of jobs that the machine can handle up to simultaneously, is fixed. However, in some realistic situations, the capacity of a machine is not constant. We call it a flexible batching machine. In this paper, we address the problem of scheduling jobs on a flexible batching machine to minimize the makespan. We prove that the problem is strong NP-hard, and its two agreeable cases are NP-hard. Then two pseudo-polynomial algorithms for the two cases are presented respectively.