Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals

Authors:
C. S. Sung;Y. I. Choung;J. M. Hong;Y. H. Kim
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, South Korea;System Engineering Group, Kiheung Plant, Samsung Electronics, Yongin 449-900, South Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, South Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, South Korea
Venue:
Computers and Operations Research
Year:
2002

Citing 2
Cited 3

Batching and scheduling jobs on batch and discrete processors

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research

Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

Computers and Operations Research
Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing

Robotics and Computer-Integrated Manufacturing
Makespan minimization on single batch-processing machine via ant colony optimization

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a scheduling problem for a single burn-in oven in the semiconductor manufacturing industry where the oven is a batch processing machine and each batch processing time is represented by the largest processing time among those of all the jobs contained in the batch. Each job belongs to one of the given number of families. Moreover, the release times of the jobs are different from one another. The objective measure of the problem is the maximum completion time (makespan) of all jobs. A dynamic programming algorithm is proposed in the order of polynomial time complexity for a situation where the number of job families is given (fixed). A computational experiment is performed to compare the time complexity of the proposed algorithm with that of another exact algorithm evaluating all possible job sequences based on batching-dynamic programming (BDP). The results of the experiment show that the proposed algorithm is superior to the other.