Dynamic scheduling problem of batch processing machine in semiconductor burn-in operations

Authors:
Pei-Chann Chang;Yun-Shiow Chen;Hui-Mei Wang
Affiliations:
Department of Industrial Engineering and Management, Yuan Ze University, Chungli, Taoyuan, Taiwan, R.O.C.;Department of Industrial Engineering and Management, Yuan Ze University, Chungli, Taoyuan, Taiwan, R.O.C.;Department of Industrial Engineering and Management, Yuan Ze University, Chungli, Taoyuan, Taiwan, R.O.C.
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 3
Cited 1

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure

Computers and Operations Research
A genetic algorithm to minimize maximum lateness on a batch processing machine

Computers and Operations Research

A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The dynamic scheduling problem of batch processing machine in semiconductor burn-in operations is studied and the objective is to minimize the total flow time of all jobs. This paper presents a constraint programming approach and develops different bounds, i.e., job-based bound and batch-based bound which can be embedded in branch and bound procedure to further improve the efficiency of the procedure. Also, some properties of the problem are also developed to further reduce the complexity of the problem.