Abstract
In this paper, we discuss scheduling problems motivated by a real-world production setting found in 300-mm semiconductor wafer fabrication facilities (wafer fabs). Front opening unified pods (FOUPs) transfer wafers in 300-mm wafer fabs. Several orders can be grouped in one FOUP. We study lot and single item processing environments. The total weighted tardiness (TWT) and the weighted number of tardy orders (WNTO) objectives are considered. Mixed integer programming (MIP) formulations are presented for the scheduling problems. We prove that the researched scheduling problems are NP-hard. Grouping genetic algorithms (GGAs) are proposed to form the content of the FOUPs. We compare the performance of the GGAs with another GA from the literature available for the problem with TWT measure based on randomly generated problem instances. It turns out that the GGA outperforms the heuristic from the literature for both environments. For the WTNO measure, we assess the performance of the GGA approach using MIP formulations for small-size problem instances and a GA-based heuristic for large-size problem instances. Again, the GGA performs well with respect to solution quality and amount of computing time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal, G. K., & Heragu, S. S. (2006). A survey of automated material handling systems in 300-mm semiconductor fabs. IEEE Transactions on Semiconductor Manufacturing, 19(1), 112–120.
Brown, E., & Sumichrast, R. (2003). Impact of the replacement heuristic in a grouping genetic algorithm. Computers & Operations Research, 30, 1575–1593.
Erramilli, V., & Mason, S. J. (2006). Multiple orders per job compatible batch scheduling. IEEE Transactions on Electronics Packaging Manufacturing, 29(4), 285–296.
Erramilli, V., & Mason, S. J. (2008). Multiple orders per job batch scheduling with incompatible jobs. Annals of Operations Research, 159, 245–260.
Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2, 5–30.
Falkenauer, E. (1998). Genetic algorithms and grouping problems. Chichester: Wiley.
Foster, L., & Pillai, D. (2000). Wafer logistics and automated material handling systems. Handbook of semiconductor manufacturing technology. New York: Marcel Dekker.
FOUP. (2015). http://www.brooks.com/products/semiconductor-automation/alignment-calibration-tools/interface-adapters/wafers-adapters-in-foup/200mm. Accessed July 15, 2015.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading: Addison-Wesley.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathe-matics, 5, 287–326.
Jampani, J., & Mason, S. J. (2008). Column generation heuristics for multiple machine, multiple orders per job scheduling problems. Annals of Operations Research, 159(1), 261–273.
Jampani, J., Pohl, E. A., Mason, S. J., & Mönch, L. (2010). Integrated heuristics for scheduling multiple order jobs in a complex job shop. International Journal of Metaheuristics, 1(2), 158–180.
Jia, J., & Mason, S. J. (2009). Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. International Journal of Production Research, 47(10), 2565–2585.
Klemmt, A., Weigert, G., Almeder, C., & Mönch, L. (2009). A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems. Proceedings of the Modeling and Analysis of Semiconductor Manufacturing Conference (MASM), 2009, 1686–1694.
Kondakci, S., & Bekiroglu, T. (1997). Scheduling with bicriteria: Total flowtime and number of tardy jobs. International Journal of Production Economics, 53, 91–99.
Laub, J. D., Fowler, J. W., & Keha, A. B. (2007). Minimzing makespan with multiple-orders-per-job in a two-machine flowshop. European Journal of Operational Research, 128(1), 63–79.
Mason, S. J., & Chen, J.-S. (2010). Scheduling multiple orders per job in a single machine to minimize total completion time. European Journal of Operational Research, 207, 70–77.
Mason, S. J., Qu, P., Kutanoglu, E., & Fowler, J. W. (2004). The single machine multiple orders per job scheduling problem. Technical Report, ASUIE-ORPS-2004-04, Arizona State University, Tempe.
Michalewics, Z. (1996). Genetic algorithms + data structures = evolution programs (3rd ed.). Berlin: Springer.
Mönch, L., Fowler, J. W., Dauzère-Pérès, S., Mason, S. J., & Rose, O. (2011a). Scheduling semiconductor manufacturing operations: Problems, solution techniques, and future challenges. Journal of Scheduling, 14(6), 583–595.
Mönch, L., Fowler, J. W., & Mason, S. J. (2013). Production planning and control for wafer fabrication facilities: Modeling, analysis, and systems. New York: Springer.
Mönch, L., Zimmermann, J., Mason, S. J., & Fowler, J. W. (2011b). Multiple orders per job formation and release strategies in large scale wafer fabs: A simulation study. Journal of Simulation, 5(1), 25–43.
Montoya-Torres, J. R. (2006). A literature survey on the design approaches and operational issues of Au-to-mated wafer-transport systems for wafer fabs. Production Planning & Control, 17(6), 648–663.
Pankratz, G. (2005). A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectrum, 27(1), 21–41.
Qu, P., & Mason, S. (2005). Metaheuristic scheduling of 300-mm lots containing multiple orders. IEEE Transactions on Semiconductor Manufacturing, 18, 633–643.
Rainwater, C., Mason, S., Fowler, J. W., & Mönch, L. (2011). Algorithmic paralleli-zation in multi-criteria semiconductor scheduling. Proceedings Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), 2011, 642–644.
Sarin, S. C., Wang, L., & Cheng, M. (2012a). A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times. Computers & Operations Research, 39(7), 1411–1418.
Sarin, S. C., Wang, L., & Cheng, M. (2012b). Minimising makespan for a two-machine, flow shop, single-wafer-processing, multiple-jobs-per-carrier scheduling problem. International Journal of Planning and Scheduling, 1(3), 171–208.
Singh, A., Sevaux, M., & Rossi, A. (2009). A hybrid grouping genetic algorithm for multiprocessor scheduling. In Proceedings of IC3, CCIS 40 (pp. 1-7).
Sobeyko, O., & Mönch, L. (2010). Genetic algorithms to solve a single machine multiple orders per job scheduling problem. In Proceedings of the 2010 winter simulation conference (pp. 2493–2503).
Sobeyko, O., & Mönch, L. (2011). A comparison of heuristics to solve a single machine batching problem with unequal ready times of the jobs. In Proceedings of the 2011 winter simulation con-ference (pp. 2011–2020).
Tanrisever, F., & Kutanoglu, E. (2008). Forming and scheduling jobs with capacitated containers in semi-conductor manufacturing: Single machine problem. Annals of Operations Research, 159(1), 5–24.
Wall, M. (2013). Galib: A C++ library of genetic algorithms components. http://lancet.mit.edu/ga/.
Acknowledgments
We would like to thank Scott Mason for providing us with the problem instances and the computational results presented in Qu and Mason (2005).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest
The authors declare that they have no conflict of interest.
Rights and permissions
About this article
Cite this article
Sobeyko, O., Mönch, L. Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems. Ann Oper Res 235, 709–739 (2015). https://doi.org/10.1007/s10479-015-1976-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-015-1976-4