Minimizing total completion time on a batch processing machine with job families

Authors:
Vijaya Chandru;Chung-Yee Lee;Reha Uzsoy
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560-012, India;Department of Industrial and Systems Engineering, 303 Weil Hall, University of Florida, Gainesville, FL 32611, USA;School of Industrial Engineering, 1287 Grissom Hall, Purdue University, West Lafayette, IN 47907, USA
Venue:
Operations Research Letters
Year:
1993

Citing 3
Cited 7

Batching and scheduling jobs on batch and discrete processors

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Efficient scheduling algorithms for a single batch processing machine

Operations Research Letters

Scheduling a capacitated batch-processing machine to minimize makespan

Robotics and Computer-Integrated Manufacturing
Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

Computers and Operations Research
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

Mathematical and Computer Modelling: An International Journal
Scheduling a batching machine with convex resource consumption functions

Information Processing Letters
Bounded parallel-batching scheduling with two competing agents

Journal of Scheduling
Scheduling unrelated parallel batch processing machines with non-identical job sizes

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry.