Abstract
We study a scheduling problem motivated by the challenges observed in the newest semiconductor manufacturing wafer fabrication facilities. As wafers are larger and heavier in these wafer fabs, it is becoming more common to use specialized material handling containers that carry multiple orders coming from different customers and to schedule the containers as jobs in the fab. The system performance is a function of the completion times of orders, which ultimately depend on both (1) how the orders are assigned to such containers (“job formation”), and (2) how the containers are scheduled in the fab (“job scheduling”). The overall problem is to find the best way to form and schedule the jobs subject to complicating constraints, including the restrictions on the number of containers that can be used at one time and on the number of wafers the containers can carry. We focus on the single machine job formation and scheduling problem with the total completion time objective. We show that this problem is quite different from conventional parallel and serial batching scenarios and prove that the uncapacitated special case is polynomially solvable and the capacitated case is strongly NP-hard. We use a dynamic programming algorithm to solve the uncapacitated problem, which not only provides tight lower bounds for the capacitated problem, but also becomes a basis for a heuristic approach for the capacitated problem. The computational results show that this approach is very effective, leading to small optimality gaps that get even smaller as the problems become larger.
Similar content being viewed by others
References
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
Albers, S., & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87–107.
Azizoglu, M., & Webster, S. (2001). Scheduling a batch processing machine with incompatible job families. Computers and Industrial Engineering, 39, 325–335.
Chandra, P., & Gupta, S. (1997). Managing batch processors to reduce lead time in a semiconductor packaging line. International Journal of Production Research, 35(3), 611–633.
Chandru, V., Lee, C. Y., & Uzsoy, R. (1993a). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31(9), 2097–2121.
Chandru, V., Lee, C. Y., & Uzsoy, R. (1993b). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61–65.
Cheng, T. C. E., & Kovalyov, M. Y. (2001). Single machine batch scheduling with sequential job processing. IIE Transactions, 33, 413–420.
Coffman, E. G., Nozari, A., & Yannakakis, M. (1989). Optimal scheduling of products with two subassemblies on a single machine. Operations Research, 37(3), 426–436.
Coffman, E. G., Yannakakis, M., Magazine, M. J., & Santos, C. A. (1990). Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135–147.
Dash Optimization. (2006). XPRESS-optimizer reference manual—Release 17.
Dobson, G., & Nambimadom, R. S. (2001). The batch loading and scheduling problem. Operations Research, 49(1), 52–65.
Fowler, J. W., Knutson, K., & Carlyle, W. M. (2000). Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility. International Journal of Production and Research, 38(8), 1841–1853.
Ghazvini, F. J., & DuPont, L. (1998). Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. International Journal of Production Economics, 55, 273–280.
Hochbaum, D. S., & Landy, D. (1994). Scheduling with batching: Minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79–86.
ILOG. I. (2005). ILOG CPLEX 10.0 reference manual.
Knutson, K., Kempf, K., Fowler, J. W., & Carlyle, M. (1999). Lot-to-order matching for a semiconductor assembly and test facility. IIE Transactions, 31(11), 1103–1111.
Korte, B., & Vygen, J. (2006). Combinatorial optimization: Theory and algorithms. Berlin: Springer.
Mason, S. J., Kutanoglu, E., Fowler, J. W., & Qu, P. (2004, submitted). The single machine multiple orders per job scheduling problem. IIE Transactions. Second revision.
Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operations Research, 120, 228–249.
Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615–1635.
Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33(10), 2685–2708.
Yuan, J. J., Yang, A. F., & Cheng, T. C. E. (2003). A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. European Journal of Operations Research, 158(2), 525–528.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tanrisever, F., Kutanoglu, E. Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem. Ann Oper Res 159, 5–24 (2008). https://doi.org/10.1007/s10479-007-0273-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0273-2