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

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. © Springer-Verlag Berlin Heidelberg 2005.