A state-of-art review and a simple meta-analysis on deterministic scheduling of diffusion furnaces in semiconductor manufacturing

References

• Ahmadi, J. H., R. H. Ahmadi, S. Dasu, and C. S. Tang. 1992. “Batching and Scheduling Jobs on Batch and Discrete Processors.” Operations Research 40 (4): 750–763.
   Web of Science ®Google Scholar
• Almeder, C., and L. Monch. 2011. “Meta Heuristic for Scheduling Jobs with Incompatible Families on Parallel Batching Machines.” Journal of the Operational Research Society 62 (12): 2083–2096.
   Web of Science ®Google Scholar
• Ángel-Bello, F., A. Álvarez, J. Pacheco, and I. Martínez. 2011. “A Heuristic Approach for a Scheduling Problem with Periodic Maintenance and Sequence-Dependent Setup Times.” Computers and Mathematics with Applications 61 (4): 797–808.
   Web of Science ®Google Scholar
• Balasubramanian, H., L. Mönch, J. Fowler, and M. Pfund. 2004. “Genetic Algorithm Based Scheduling of Parallel Batch Machines with Incompatible job Families to Minimize Total Weighted Tardiness.” International Journal of Production Research 42 (8): 1621–1638.
   Web of Science ®Google Scholar
• Bar-Noy, A., S. Guha, Y. Katz, J. S. Naor, B. Schieber, and H. Shachnai. 2002. “Throughput Maximization of Real-Time Scheduling With Batching.” Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms, 742–751.
   Google Scholar
• Bar-Noy, A., S. Guha, Y. Katz, J. S. Naor, B. Schieber, and H. Shachnai. 2009. “Throughput Maximization of Real-Time Scheduling with Batching.” ACM Transactions on Algorithms 5 (2): 1–17.
   Web of Science ®Google Scholar
• Bilyk, A., L. Mönch, and C. Almeder. 2014. “Scheduling Jobs with Ready Times and Precedence Constraints on Parallel Batch Machines Using Meta Heuristics.” Computers and Industrial Engineering 78: 175–185.
   Web of Science ®Google Scholar
• Borba, B. S. M. C., M. Z. Fortes, L. A. Bitencourt, V. H. Ferreira, R. S. Maciel, M. A. R. Guimaraens, G. B. A. Lima, et al. 2019. “A Review on Optimization Methods for Workforce Planning in Electrical Distribution Utilities.” Computers and Industrial Engineering 135: 286–298.
   Web of Science ®Google Scholar
• Chang, C.-C., and F.-C. Li. 2013. “Solving the Wafer Probing Scheduling Problem Using Water Flow-Like Algorithm.” IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA). July 13, 2013, Hiroshima, Japan, 161–165.
   Google Scholar
• Chen, L., L. Chen, H. Xu, and X. Li. 2013. “Learning-Based Adaptive Dispatching Method for Batch Processing Machines.” Proceedings of the 2013 Winter Simulation Conference, IEEE, 3756–3765.
   Google Scholar
• Cheng, H. C., T. C. Chiang, and L. C. Fu. 2008. “A Memetic Algorithm for Parallel Batch Machine Scheduling with Incompatible Job Families and Dynamic Job Arrivals.” IEEE International Conference on Systems, Man and Cybernetics Proceedings, 541–546.
   Google Scholar
• Chiang, T.-C., H.-C. Cheng, and L.-C. Fu. 2008. “An Efficient Heuristic for Minimizing Maximum Lateness on Parallel Batch Machines.” Eighth International Conference on Intelligent Systems Design and Applications, IEEE, 621–627.
   Google Scholar
• Chiang, T.-C., H.-C. Cheng, and L.-C. Fu. 2010. “A Memetic Algorithm for Minimizing Total Weighted Tardiness on Parallel Batch Machines with Incompatible job Families and Dynamic job Arrival.” Computers and Operations Research 37 (12): 2257–2269.
   Web of Science ®Google Scholar
• Christian Artigues, D. P. Stéphane, D. Alexandre, S. Olivier, and Y. Claude. 2006. “A Batch Optimization Solver for Diffusion Area Scheduling in Semiconductor Manufacturing.” IFAC Proceedings 39 (3): 733–738.
   Google Scholar
• Dao, T.-K., T.-S. Pan, T.-T. Nguyen, and J.-S. Pan. 2018. “Parallel bat Algorithm for Optimizing Makespan in job Shop Scheduling Problems.” Journal of Intelligent Manufacturing 29: 451–462.
   Web of Science ®Google Scholar
• Dauzère-Pérès, S., and L. Mönch. 2013. “Scheduling Jobs on a Single Batch Processing Machine with Incompatible job Families and Weighted Number of Tardy Jobs Objective.” Computers and Operations Research 40 (5): 1224–1233.
   Web of Science ®Google Scholar
• Devpura, A., J. W. Fowler, M. W. Carlyle, and I. Perez. 2000. “Minimizing Total Weighted Tardiness on a Single Batch Process Machine With Incompatible Job Families.” Proc Symposium on Operations Research, Dresden, Germany, pp 366–371.
   Google Scholar
• Dirk, R., and L. Monch. 2006. “Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines.” Lecture Notes in Computer Science 3906: 209–221.
   Google Scholar
• Dobson, G., and R. S. Nambimadom. 2001. “The Batch Loading and Scheduling Problem.” Operations Research 49 (1): 52–65.
   Web of Science ®Google Scholar
• Feng, Q., W.-P. Shang, C.-W. Jiao, and W.-J. Li. 2020. “Two-Agent Scheduling on a Bounded Parallel-Batching Machine with Makespan and Maximum Lateness Objectives.” Journal of the Operations Research Society of China 8: 189–196.
   Web of Science ®Google Scholar
• Fidelis, M. B., and J. E. C. Arroyo. 2017. “Meta-Heuristic Algorithms for Scheduling on Parallel Batch Machines with Unequal Job Ready Times.” Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 542–547.
   Google Scholar
• Fu, Q., A. I. Sivakumar, and K. Li. 2012. “Optimisation of Flow-Shop Scheduling with Batch Processor and Limited Buffer.” International Journal of Production Research 50 (8): 2267–2285.
   Web of Science ®Google Scholar
• Glassey, C. R., and W. W. Weng. 1991. “Dynamic Batching Heuristic for Simultaneous Processing.” IEEE Transactions on Semiconductor Manufacturing 4 (2): 77–82.
   Web of Science ®Google Scholar
• Guo, C., Z. Jiang, and H. Hu. 2010. “A Hybrid Ant Colony Optimization Method for Scheduling Batch Processing Machine in the Semiconductor Manufacturing.” Proceedings of the 2010 IEEE IEEM, 1698–1701.
   Google Scholar
• Ham, A. 2017. “Flexible job Shop Scheduling Problem for Parallel Batch Processing Machine with Compatible job Families.” Applied Mathematical Modelling 45: 551–562.
   Web of Science ®Google Scholar
• Huang, S.-C., and J. T. Lin. 1998. “An Interactive Scheduler for a Wafer Probe Centre in Semiconductor Manufacturing.” International Journal of Production Research 36 (7): 1883–1900.
   Web of Science ®Google Scholar
• Jia, W., H. Chen, L. Liu, Z. Jiang, and Y. Li. 2019. “A Slack Optimization Unified Model of Regrouping and Sequencing Batches for β1 → β2 Manufacturing System.” Proceedings of the Institution of Mechanical Engineers Part B: Journal of Engineering Manufacture 233 (2): 665–672.
   Web of Science ®Google Scholar
• Jia, W., Z. Jiang, and Y. Li. 2013a. “A Job-Family-Oriented Algorithm for Re-Entrant Batch Processing Machine Scheduling.” Proceedings of the 2013 IEEE International Conference on Automation Science and Engineering, 1022–1027.
   Google Scholar
• Jia, W., Z. Jiang, and Y. Li. 2013b. “Closed Loop Control-Based Real-Time Dispatching Heuristic on Parallel Batch Machines with Incompatible job Families and Dynamic Arrivals.” International Journal of Production Research 51 (15): 4570–4584.
   Web of Science ®Google Scholar
• Jia, Z., C. Wang, and J. Y.-T. Leung. 2016. “An ACO Algorithm for Makespan Minimization in Parallel Batch Machines with non-Identical job Sizes and Incompatible job Families.” Applied Soft Computing 38 (10): 395–404.
   Google Scholar
• Jolai, F. 2005. “Minimizing Number of Tardy Jobs on a Batch Processing Machine with Incompatible job Families.” European Journal of Operational Research 162 (1): 184–190.
   Web of Science ®Google Scholar
• Jung, C., D. Pabst, M. Ham, M. Stehli, and M. Rothe. 2013. “An Effective Problem Decomposition Method for Scheduling of Diffusion Processes Based on Mixed Integer Linear Programming.” Proceeding of 24th Advanced Semiconductor Manufacturing Conference (ASMC 2013), IEEE, 35–40.
   Google Scholar
• Jung, C., D. Pabst, M. Ham, M. Stehli, and M. Rothe. 2014. “An Effective Problem Decomposition Method for Scheduling of Diffusion Processes Based on Mixed Integer Linear Programming.” IEEE Transactions on Semiconductor Manufacturing 27 (3): 357–363.
   Web of Science ®Google Scholar
• Kashan, A. H., and B. Karimi. 2008. “Scheduling a Single Batch-Processing Machine with Arbitrary job Sizes and Incompatible job Families: An ant Colony Framework.” Journal of the Operational Research Society 59 (9): 1269–1280.
   Web of Science ®Google Scholar
• Kim, Y.-D., B.-J. Joo, and S.-Y. Choi. 2010. “Scheduling Wafer Lots on Diffusion Machines in a Semiconductor Wafer Fabrication Facility.” IEEE Transactions on Semiconductor Manufacturing 23 (2): 246–254.
   Web of Science ®Google Scholar
• Kim, B., and S. Kim. 2002. “Application of Genetic Algorithms for Scheduling Batch-Discrete Production System.” Production Planning and Control 13 (2): 155–165.
   Web of Science ®Google Scholar
• Kim, Y.-D., J.-G. Kim, B. Choi, and H.-U. Kim. 2001. “Production Scheduling in a Semiconductor Wafer Fabrication Facility Producing Multiple Product Types with Distinct due Dates.” IEEE Transactions on Robotics and Automation 17: 589–598.
   Google Scholar
• Knopp, S., S. Dauzere-Peres, and C. Yugma. 2014. Flexible Job-Shop Scheduling With Extended Route Flexibility for Semiconductor Manufacturing.” Proceedings of the 2014 Winter Simulation Conference, 2478–2489.
   Google Scholar
• Knopp, S., S. Dauzère-Pérès, and C. Yugma. 2017. “A Batch-Oblivious Approach for Complex Job-Shop Scheduling Problems.” European Journal of Operational Research 263 (1): 50–61.
   Web of Science ®Google Scholar
• Kurz, M. E. 2003. “On the Structure of Optimal Schedules for Minimizing Total Weighted Tardiness on Parallel, Batch-Processing Machines.” Proceedings of 10th IE Research Conference. Portland, 2003; 1–5.
   Google Scholar
• Kurz, M. E., and S. J. Mason. 2008. “Minimizing Total Weighted Tardiness on a Batch-Processing Machine with Incompatible job Families and job Ready Times.” International Journal of Production Research 46 (1): 131–151.
   Web of Science ®Google Scholar
• Laha, D., and J. N. D. Gupta. 2018. “An Improved Cuckoo Search Algorithm for Scheduling Jobs on Identical Parallel Machines.” Computers & Industrial Engineering 126: 348–360.
   Web of Science ®Google Scholar
• Lausch, S., and L. Mönch. 2016. “Metaheuristic Approaches for Scheduling Jobs on Parallel Batch Processing Machines.” Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, Volume 236 of the series International Series in Operations Research & Management Science, Chapter 10, 187–207.
   Google Scholar
• Leachman, R. C. 2002. Competitive Semiconductor Manufacturing: Summary Report on Findings from Benchmarking Eight-Inch, Sub-350 nm Wafer Fabrication Lines, University of California at Berkeley. Accessed July 9, 2021. https://www.academia.edu/26733104/Competitive_Semiconductor_Manufacturing_Final_Report_on_Findings_from_Benchmarking_Eight_inch_sub_350nm_Wafer_Fabrication_Lines.
   Google Scholar
• Li, L., and F. Qiao. 2008. “ACO-Based Scheduling for a Single Batch Processing Machine in Semiconductor Manufacturing.” 4th IEEE International Conference on Automation Science and Engineering, 85–90.
   Google Scholar
• Li, L., F. Qiao, and G. Pan. 2010. ACO-based multi-objective scheduling of identical parallel batch processing machines in semiconductor manufacturing. INTECH Open Access Publisher. Accessed July 9, 2021. http://www.intechopen.com/books/future-manufacturing-systems/aco-based-multi-objective-scheduling-of-identical-parallel-batch-processing-machines-in-semiconducto.
   Google Scholar
• Li, L., F. Qiao, and Q. D. Wu. 2009. “ACO-Based Scheduling of Parallel Batch Processing Machines to Minimize the Total Weighted Tardiness.” 5th Annual IEEE Conference on Automation Science and Engineering, 280–285.
   Google Scholar
• Malve, S., and R. Uzsoy. 2007. “A Genetic Algorithm for Minimizing Maximum Lateness on Parallel Identical Batch Processing Machines with Dynamic job Arrivals and Incompatible job Families.” Computers and Operations Research 34 (10): 3016–3028.
   Web of Science ®Google Scholar
• Mason, S. J., J. W. Fowler, and C. W. Matthew. 2002. “A Modified Shifting Bottleneck Heuristic for Minimizing Total Weighted Tardiness in Complex job Shops.” Journal of Scheduling 5 (3): 247–262.
   Web of Science ®Google Scholar
• Mathirajan, M., V. Bhargav, and V. Ramachandran. 2010. “Minimizing Total Weighted Tardiness on a Batch-Processing Machine with non-Agreeable Release Times and due Dates.” The International Journal of Advanced Manufacturing Technology 48: 1133–1148.
   Web of Science ®Google Scholar
• Mathirajan, M., and A. I. Sivakumar. 2006. “A Literature Review, Classification and Simple Meta-Analysis on Scheduling of Batch Processors in Semiconductor.” The International Journal of Advanced Manufacturing Technology 29: 990–1001.
   Web of Science ®Google Scholar
• Mathirajan, M., and M. Vimalarani. 2012. “Scheduling a BPM with Incompatible Job-Families and Dynamic Job-Arrivals”, Proceeding of the 2012 IEEE IEEM, 1–5. Accessed on July 9, 2021. https://www.researchgate.net/publication/265597365_Scheduling_a_BPM_with_Incompatible_Job-Families_and_Dynamic_Job-Arrivals.
   Google Scholar
• Mehta, S. V., and R. Uzsoy. 1998. “Minimizing Total Tardiness on a Batch Processing Machine with Incompatible job Families.” IIE Transactions 30 (2): 165–178.
   Web of Science ®Google Scholar
• Monch, L., and C. Almeder. 2009. “Ant Colony Optimization Approaches for Scheduling Jobs with Incompatible Families on Parallel Batch Machines”, Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), 105–114.
   Google Scholar
• Mönch, L., H. Balasubramanian, J. W. Fowler, and M. E. Pfund. 2002. “Minimizing Total Weighted Tardiness on Parallel Batch Process Machines Using Genetic Algorithms.” Operations Research Proceedings 2002: 229–234.
   Google Scholar
• Mönch, L., H. Balasubramanian, J. W. Fowler, and M. E. Pfund. 2005. “Heuristic Scheduling of Jobs on Parallel Batch Machines with Incompatible job Families and Unequal Ready Times.” Computers and Operations Research 32 (11): 2731–2750.
   Web of Science ®Google Scholar
• Monch, L., and S. Roob. 2018. “A Matheuristic Framework for Batch Machine Scheduling Problems with Incompatible job Families and Regular sum Objective.” Applied Soft Computing 68: 835–846.
   Web of Science ®Google Scholar
• Mönch, L., J. Zimmermann, and P. Otto. 2006. “Machine Learning Techniques for Scheduling Jobs with Incompatible Families and Unequal Ready Times on Parallel Batch Machines.” Engineering Applications of Artificial Intelligence 19 (3): 235–245.
   Web of Science ®Google Scholar
• Neale, J. J., and I. Duenyas. 2000. “Control of Manufacturing Networks Which Contain a Batch Processing Machine.” IIE Transactions 32 (11): 1027–1041.
   Web of Science ®Google Scholar
• Mansoer, P., and P.-H. Koo. 2015. “A Batching Strategy for Batch Processing Machine with Multiple Product Types.” Journal of Industrial and Intelligent Information 3 (2): 138–142.
   Google Scholar
• Perez, I. C., J. W. Fowler, and W. M. Carlyle. 2005. “Minimizing Total Weighted Tardiness on a Single Batch Process Machine with Incompatible job Families.” Computers and Operations Research 32 (2): 327–341.
   Web of Science ®Google Scholar
• Phrueksanant, J. 2013. “Machine Scheduling Using the Bees Algorithm” PhD diss., Cardiff University, UK.
   Google Scholar
• Pinedo, M. 2016. Scheduling: Theory, Algorithms, and Systems. New York, NY: Springer-Verlag New York.
   Google Scholar
• Pirovano, G., F. Ciccullo, M. Pero, and T. Rossi. 2020. “Scheduling Batches with Time Constraints in Wafer Fabrication.” International Journal of Operational Research 37 (1): 1–31.
   Google Scholar
• Qi, C. 2005. “Closed –Loop Job Release Based on WIP Load Control in Semiconductor Wafer Fabrication”, PhD diss., School of Mechanical and Aerospace Engineering, Nanyang Technological University.
   Google Scholar
• Quadt, D. 2004. “Lot-Sizing and Scheduling for Flexible Flow Lines.” 546 Lecture Notes in Economics and Mathematical Systems, Springer-Verlag Berlin Heidelberg.
   Google Scholar
• Rajak, N., and D. Shukla. 2020. “A Systematic Analysis of Task Scheduling Algorithms in Cloud Computing.” Lecture Notes in Networks and Systems 100: 39–49.
   Google Scholar
• Rocholl, J., L. Monch, and J. W. Fowler. 2018. “Electricity Power Cost-Aware Scheduling of Jobs on Parallel Batch Processing Machines.” Proceedings of the 2018 Winter Simulation Conference. IEEE, 3420–3431.
   Google Scholar
• Rocholl, J., L. Mönch, and J. Fowler. 2020. “Bi-criteria Parallel Batch Machine Scheduling to Minimize Total Weighted Tardiness and Electricity Cost.” Journal of Business Economics 90 (9): 1345–1381.
   Google Scholar
• Sha, D., S.-Y. Hsu, and X. Lai. 2007. “Design of due-Date Oriented Look-Ahead Batching Rule in Wafer Fabrication.” International Journal of Advanced Manufacturing Technology 35: 5–6.
   Web of Science ®Google Scholar
• Yao, S., Z. Jiang, and N. Li. 2012. “A Branch and Bound Algorithm for Minimizing Total Completion Time on a Single Batch Machine with Incompatible job Families and Dynamic Arrivals.” Computers and Operations Research 39 (5): 939–951.
   Web of Science ®Google Scholar
• Stevenson, William J. 2017. Operations Management. New York, NY: McGraw-Hill Education Pvt Limited.
   Google Scholar
• Su, L.-H. 2003. “A Hybrid two-Stage Flow-Shop with Limited Waiting Time Constraints.” Computers and Industrial Engineering 44: 409–424.
   Web of Science ®Google Scholar
• Sung, C. S., and Y. H. Kim. 2003. “Minimizing due Date Related Performance Measures on two Batch Processing Machines.” European Journal of Operational Research 147 (3): 644–656.
   Web of Science ®Google Scholar
• Sung, C. S., Y. H. Kim, and S. H. Yoon. 2000. “Theory and Methodology-A Problem Reduction and Decomposition Approach for Scheduling for a Flow Shop of Batch Processing Machines.” European Journal of Operational Research 121 (1): 179–192.
   Web of Science ®Google Scholar
• Tanju Y., E. Kutanoglu, and J. Johns. 2009. “Heuristic Based Scheduling System for Diffusion in Semiconductor Manufacturing.” Proceedings of the 2009 Winter Simulation Conference, 1677–1685.
   Google Scholar
• Uzsoy, R. 1995. “Scheduling Batch Processing Machines with Incompatible job Families.” International Journal of Production Research 33 (10): 2685–2708.
   Web of Science ®Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2014. “Dynamic Scheduling of Diffusion Furnace in Semiconductor Manufacturing With Job Related Real Time Events.” Second International Conference on Business Analytics and Intelligence, IISc, Bangalore.
   Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2015. “Dynamic Scheduling of Diffusion Furnace in Semiconductor Manufacturing With Real Time Events.” Proceedings of the 2015 IEEE IEEM, 104–108. doi:10.1109/IEEM.2015.7385617.
   Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2016a. “Performance Evaluation of ATC Based Greedy Heuristic Algorithms in Scheduling Diffusion Furnace in Wafer Fabrication.” Journal of Information and Optimization Sciences 37 (5): 717–762.
   Web of Science ®Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2016b. “Dynamic Scheduling of Diffusion Furnace in Semiconductor Manufacturing with Resource Related Real Time Events.” Edited Volume of Analytics in Operations/Supply Chain Management, I.K International Publishing House Pvt.Ltd, New Delhi, 381–396.
   Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2016c. “Multi Objective Dynamic Real-Time Scheduling of Batch Processing Machine.” International Journal of Operations and Quantitative Management 22 (1): 53–73.
   Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2016d. “A Class of Mathematical Models for Dynamic Scheduling of Diffusion Furnace with Due-Date Based Scheduling Objectives. Sixth National Conference on Management Science and Practice (MSP 2016), September 9–10, IIT-Madras.
   Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2020a. “Meta-heuristics for Dynamic Real Time Scheduling of Diffusion Furnace in Semiconductor Manufacturing Industry.” International Journal of Industrial and System Engineering 34 (3): 365–395.
   Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2020b. “Performance Evaluation of Due-Date Based Dispatching Rules in Dynamic Scheduling of Diffusion Furnace.” OPSEARCH 57: 462–512.
   Web of Science ®Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2021a. “Prescriptive Analytics for Dynamic Real Time Scheduling of Diffusion Furnaces.” In Supply Chain Management in Manufacturing and Service Systems. International Series in Operations Research & Management Science, vol 304, edited by S. Srinivas, S. Rajendran, and H. Ziegler, 241–278. Cham: Springer. doi:10.1007/978-3-030-69265-0_9.
   Google Scholar
• Vimala Rani, M., and M. Mathirajan. 2021b. “Real Time Scheduling of Non-Identical Multiple Batch Processors with Machine Eligibility Restriction, International Journal of Mathematical.” Engineering, and Management Sciences 6 (6): 1460–1486.
   Google Scholar
• Wu, K., E. Huang, M. Wang, and M. Zheng. 2021. “Job Scheduling of Diffusion Furnaces in Semiconductor Fabrication Facilities.” European Journal of Operational Research, https://doi.org/10.1016/j.ejor.2021.09.044.
   Google Scholar
• Yugma, C., S. Dauzere-Peres, A. Derreumaux, C. Artigues, and O. Sibille. 2012. “A Batching and Scheduling Algorithm for the Diffusion Area in Semiconductor Manufacturing.” International Journal of Production Research 50 (8): 2118–2132.
   Web of Science ®Google Scholar
• Yugma, C., S. Dauzere-Peres, A. Derreumaux, and O. Sibille. 2008. “A Batch Optimization Sofware for Diffusion Area Scheduling in Semiconductor Manufacturing.” IEEE/SEMI Advanced Semiconductor Manufacturing Conference Proceedings, 327–332.
   Google Scholar