Abstract
In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akçali, E., Nemoto, K., & Uzsoy, R. (2001). Cycle time improvements for photolithography process in semiconductor manufacturing. IEEE Transaction of Semiconductor Manufacturing, 14(1), 48–56.
Blazewicz, J., Lenstra, J. K., & Rinnooy Kan, A. H. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5(1), 11–24.
Cakici, E., & Mason, S. J. (2007). Parallel machine scheduling subject to auxiliary resource constraints. Production Planning and Control, 18(3), 217–225.
Chandra, S. M., Mathirajan, M., Gopinath, R., & Sivakumar, A. I. (2008). Taboo search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints. International Journal of Operational Research, 3(1–2), 119–139.
de Diaz, S. L. M., Fowler, J. W., Pfund, M. E., Mackulak, G. T., & Hickie, M. (2005). Evaluating the impacts of reticle requirements in semiconductor wafer fabrication. IEEE Transactions on Semiconductor Manufacturing, 18(4), 622–632.
Kempf, K., Uzsoy, R., & Wang, C.-S. (1998). Scheduling a single batch processing machine with secondary resource constraints. Journal of Manufacturing Systems, 17(1), 37–51.
Leung, J. Y. T., & Li, C. L. (2008). Scheduling with processing set restrictions: A survey. International Journal of Production Economics, 116(2), 251–262.
Mönch, L. (2002). A genetic algorithm heuristic applied to stepper scheduling. In Proceedings of the International Conference on Modelling and Analysis of Semiconductor Manufacturing, Tempe, USA, (pp. 276–281).
Mönch, L., Fowler, J. W., & Mason, S. J. (2012). Production planning and control for semiconductor wafer fabrication facilities: Modeling, analysis, and systems. New York: Springer.
Mönch, L., Fowler, J. W., Dauzère-Pérès, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583–599.
Sarin, S. C., Varadarajan, A., & Wang, L. (2011). A survey of dispatching rules for operational control in wafer fabrication. Production Planning & Control, 22(1), 4–24.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bitar, A., Dauzère-Pérès, S., Yugma, C. et al. A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. J Sched 19, 367–376 (2016). https://doi.org/10.1007/s10951-014-0397-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-014-0397-6