Abstract
This paper studies the problem of scheduling semiconductor burn-in operations, where each job has non-identical lot sizes and an oven (a batch processing machine) that processes several jobs within its capacity limit simultaneously. We present some properties of the problem and an efficient heuristic algorithm. In a computational experiment, pairs of burning operations (α,β) were presented with the arrival time ri and processing time pi for different (α,β) pairs to examine the effect of arrival time and the processing time on minimising the total completion time. The result shows that a ratio of α to β greater than 1 was superior to other ratios, which can be a guide for schedule planners of burn-in operations. The heuristic obtains a satisfactory average performance rapidly.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ikura Y, Gimple M (1986) Efficient scheduling algorithms for a single batch processing machine. Oper Res Lett 5:61–65
Glassey CR, Weng WW (1991) Dynamic batching heuristics for simultaneous processing. IEEE Trans Semicond Manuf 5:158–163
Lee C-Y, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40(4):764–775
Ahmadi JH, Ahmadi RH, Dasu S, Tang CS (1992) Batching and scheduling jobs on batch and discrete processors. Oper Res 39(4):750–763
Qi X, Tu F (1999) Earliness and tardiness scheduling problems on a batch processor. Discret Appl Math 98:131–145
Chandru V, Lee C-Y, Uzsoy R (1993) Minimizing total completion time on batch processing machines. Int J Prod Res 31(9):2097–2121
Dupont L, Ghazvini FJ (1997) A branch and bound algorithm for minimizing mean flow time on a single batch processing machine. Int J Ind Eng 4(3):197–203
Hochbaum DS, Landy D (1997) Scheduling semiconductor burn-in operations to minimize total flowtime. Oper Res 45(6):874–885
Li C-L, Lee C-Y (1997) Scheduling with agreeable release times and due dates on a batch processing machine. Eur J Oper Res 96:564–569
Lee C-Y, Uzsoy R (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37(1):219–236
Sung CS, Choung YI (2000) Minimizing makespan on a single burn-in oven in semiconductor manufacturing. Eur J Oper Res 120:559–574
Sung CS, Choung YI, Hong JM, Kim YH (2002) Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Comput Oper Res 29:995–1007
Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research 32(7):1615–1635
Ghazvini FJ, Dupont L (1998) Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. Int J Prod Econ 55:273–280
Chang P-C, Wang H-M A batch processing scheduling in minimizing flowtimes with job sizes. Research working paper, Department of Industrial Engineering and Management, Yuan-Ze University
Dupont L, Dhaenens-Flipo C (2002) Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Comput Oper Res 29:807–819
Chand S, Traub R, Uzsoy R (1996) Single-Machine Scheduling with Dynamic Arrivals: Decomposition results and an improved algorithm. Naval Res Logist 43:709–719
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chang, PC., Wang, HM. A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes. AMT 24, 615–620 (2004). https://doi.org/10.1007/s00170-003-1740-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-003-1740-9