Full-batch-oriented scheduling algorithm on batch processing workstation of β₁→β₂ type with re-entrant flow

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. doi:10.1287/opre.40.4.750.
   Web of Science ®Google Scholar
• Alarcón, L. 1997. Lean Construction. Boca Raton, FL: CRC Press.
   Google Scholar
• Almeder, C., and L. Mönch. 2010. “Metaheuristics for Scheduling Jobs with Incompatible Families on Parallel Batching Machines.” Journal of the Operational Research Society 62 (12): 2083–2096. doi:10.1057/jors.2010.186.
   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. doi:10.1080/00207540310001636994.
   Web of Science ®Google Scholar
• Bixby, R., R. Burda, and D. Miller, 2006. Short-Interval Detailed Production Scheduling in 300mm Semiconductor Manufacturing Using Mixed Integer and Constraint Programminged. The 17th Annual SEMI/IEEE Advanced Semiconductor Manufacturing Conference (ASMC-2006), Boston, 148–154.
   Google Scholar
• Cheng, T. C. E., and G. Wang. 1998. “Batching and Scheduling to Minimize the Makespan in the Two-Machine Flowshop.” IIE Transactions 30 (5): 447–453. doi:10.1080/07408179808966485.
   Web of Science ®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 & Operations Research 37 (12): 2257–2269. doi:10.1016/j.cor.2010.03.017.
   Web of Science ®Google Scholar
• Chien, C. F., and C. H. Chen. 2007. “A Novel Timetabling Algorithm for A Furnace Process for Semiconductor Fabrication with Constrained Waiting and Frequency-Based Setups.” OR Spectrum 29 (3): 391–419. doi:10.1007/s00291-006-0062-3.
   Web of Science ®Google Scholar
• Choi, S. W., and Y. D. Kim. 2009. “Minimizing Total Tardiness on a Two-Machine Re-Entrant Flowshop.” European Journal of Operational Research 199 (2): 375–384. doi:10.1016/j.ejor.2008.11.037.
   Web of Science ®Google Scholar
• Darlington, J., M. Francis, P. Found, and A. Thomas. 2015. “Design and Implementation of a Drum-Buffer-Rope Pull-System.” Production Planning & Control 26 (6): 489–504. doi:10.1080/09537287.2014.926409.
   Web of Science ®Google Scholar
• Detty, R. B., and J. C. Yingling. 2000. “Quantifying Benefits of Conversion to Lean Manufacturing with Discrete Event Simulation: A Case Study.” International Journal of Production Research 38 (2): 429–445. doi:10.1080/002075400189509.
   Web of Science ®Google Scholar
• Drobouchevitch, I. G., and V. A. Strusevich. 1999. “A Heuristic Algorithm for Two‐Machine Re‐Entrant Shop Scheduling.” Annals of Operations Research 86: 417–439. doi:10.1023/A:1018927407164.
   Web of Science ®Google Scholar
• Du, J., and J. Y. T. Leung. 1990. “Minimizing Total Tardiness on One Machine Is Np-Hard.” Mathematics of Operations Research 15 (3): 483–495. doi:10.1287/moor.15.3.483.
   Web of Science ®Google Scholar
• Fowler, J. W., L. Gary, and D. T. Phillips. 1992. “Control of Multiproduct Bulk Service Diffusion/Oxidation Processes.” IIE Transactions 24 (4): 84–96. doi:10.1080/07408179208964236.
   Web of Science ®Google Scholar
• Ham, M., and J. W. Fowler. 2008. “Scheduling of Wet Etch and Furnace Operations with Next Arrival Control Heuristic.” The International Journal of Advanced Manufacturing Technology 38 (9): 1006–1017. doi:10.1007/s00170-007-1146-1.
   Web of Science ®Google Scholar
• Jia, W. Y., Z. B. Jiang, and Y. Li. 2013. “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. doi:10.1080/00207543.2013.774505.
   Web of Science ®Google Scholar
• Jia, W. Y., Z. B. Jiang, and Y. Li. 2015. “Combined Scheduling Algorithm for Re-Entrant Batch-Processing Machines in Semiconductor Wafer Manufacturing.” International Journal of Production Research 53 (6): 1866–1879. doi:10.1080/00207543.2014.965355.
   Web of Science ®Google Scholar
• Kao, Y.-T., S.-C. Zhan, S.-C. Chang, J.-H. Ho, and P. Wang, 2011. Near Optimal Furnace Tool Allocation with Batching and Waiting Time Constraints. IEEE International Conference on Automation Science and Engineering (CASE), 108–113.
   Google Scholar
• Lev, V., and I. Adiri. 1984. “V-Shop Scheduling.” European Journal of Operational Research 18 (1): 51–56. doi:10.1016/0377-2217(84)90260-1.
   Web of Science ®Google Scholar
• Li, C., Z. Jiang, Y. Li, N. Li, N. Geng, S. Yao, and W. Jia. 2013. “Scheduling of Wet Etch and Furnace Operations with Next Arrival Control Heuristicrule-Based Scheduling of Batch Processing Machine Applied to Semiconductor Wafer Fabrication System.” Journal of Shanghai Jiao Tong University 47 (2): 230–235.
   Google Scholar
• Liao, C. J., and L. M. Liao. 2008. “Improved Milp Models for Two-Machine Flowshop with Batch Processing Machines.” Mathematical and Computer Modelling 48 (7–8): 1254–1264. doi:10.1016/j.mcm.2008.01.001.
   Web of Science ®Google Scholar
• Lin, B. M. T., and T. Cheng. 2001. “Batch Scheduling in the No-Wait Two-Machine Flowshop to Minimize the Makespan.” Computers & Operations Research 28 (7): 613–624. doi:10.1016/S0305-0548(99)00138-0.
   Web of Science ®Google Scholar
• Mathirajan, M., and A. 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 (9–10): 990–1001. doi:10.1007/s00170-005-2585-1.
   Web of Science ®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. doi:10.1080/07408179808966448.
   Web of Science ®Google Scholar
• Min, H. S., and Y. Yih. 2003. “Development of a Real-Time Multi-Objective Scheduler for a Semiconductor Fabrication System.” International Journal of Production Research 41 (10): 2345–2364. doi:10.1080/0020754031000077275.
   Web of Science ®Google Scholar
• Mönch, 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 2009), Dublin, 106–114.
   Google Scholar
• Ng, S. T., D. X. Zheng, and J. Z. Xie. 2013. “Allocation of Construction Resources through a Pull-Driven Approach.” Construction Innovation 13 (1): 77–97. doi:10.1108/14714171311296066.
   Google Scholar
• Ounnar, F., and P. Pujo. 2012. “Pull Control for Job Shop: Holonic Manufacturing System Approach Using Multicriteria Decision-Making.” Journal of Intelligent Manufacturing 23 (1): 141–153. doi:10.1007/s10845-009-0288-4.
   Web of Science ®Google Scholar
• Pan, J.-H., and J.-S. Chen. 2003. “Minimizing Makespan in Re-Entrant Permutation Flow-Shops.” Journal of the Operational Research Society 54 (6): 642–653. doi:10.1057/palgrave.jors.2601556.
   Web of Science ®Google Scholar
• Pinedo, M. L. 2012. Scheduling. New York: Springer.
   Google Scholar
• Rotondo, A., P. Young, and J. Geraghty. 2015. “Sequencing Optimisation for Makespan Improvement at Wet-Etch Tools.” Computers & Operations Research 53: 261–274. doi:10.1016/j.cor.2014.04.016.
   Web of Science ®Google Scholar
• Shahnaghi, K., H. Shahmoradi-Moghadam, A. Noroozi, and H. Mokhtari. 2016. “A Robust Modelling and Optimisation Framework for A Batch Processing Flow Shop Production System in the Presence of Uncertainties.” International Journal of Computer Integrated Manufacturing 29 (1): 92–106.
   Web of Science ®Google Scholar
• Solomon, L., J. W. Fowler, M. Pfund, and P. H. Jensen. 2002. “The Inclusion of Future Arrivals and Downstream Setups into Wafer Fabrication Batch Processing Decisions.” Journal of Electronics Manufacturing 11 (02): 149–159. doi:10.1142/S0960313102000370.
   Google Scholar
• Su, L. H. 2003. “A Hybrid Two-Stage Flowshop with Limited Waiting Time Constraints.” Computers & Industrial Engineering 44 (3): 409–424. doi:10.1016/S0360-8352(02)00216-4.
   Web of Science ®Google Scholar
• Sung, C. S., Y. H. Kim, and S. H. Yoon. 2000. “A Problem Reduction and Decomposition Approach for Scheduling for A Flowshop of Batch Processing Machines.” European Journal of Operational Research 121 (1): 179–192. doi:10.1016/S0377-2217(99)00031-4.
   Web of Science ®Google Scholar
• Tommelein, I. D. 1998. “Pull-Driven Scheduling for Pipe-Spool Installation: Simulation of Lean Construction Technique.” Journal of Construction Engineering and Management 124 (4): 279–288. doi:10.1061/(ASCE)0733-9364(1998)124:4(279).
   Web of Science ®Google Scholar
• Wang, M., S. Sethi, and S. Van De Velde. 1997. “Minimizing Makespan in a Class of Reentrant Shops.” Operations Research 45 (5): 702–712. doi:10.1287/opre.45.5.702.
   Web of Science ®Google Scholar
• Weng, W. W., and R. C. Leachman. 1993. “An Improved Methodology for Real-Time Production Decisions at Batch-Process Work Stations.” Semiconductor Manufacturing, IEEE Transactions On 6 (3): 219–225. doi:10.1109/66.238169.
   Web of Science ®Google Scholar
• Yang, I.-T., and P. G. Ioannou, 2001. Resource-Driven Scheduling for Repetitive Projects: A Pull-System Approached. Proceedings of the 9th International Group for Lean Construction Conference, Singapore, 365–377.
   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 & Operations Research 39 (5): 939–951. doi:10.1016/j.cor.2011.06.003.
   Web of Science ®Google Scholar
• Yoo, J. K., K. Shinbo, and Y. Shimizu. 2003. “A Scheduling Method for Painting Line under Pull Production.” JSME International Journal Series C 46: 88–92. doi:10.1299/jsmec.46.88.
   Google Scholar
• Yugma, C., J. Blue, S. Dauzère-Pérès, and A. Obeid. 2015. “Integration of Scheduling and Advanced Process Control in Semiconductor Manufacturing: Review and Outlook.” Journal of Scheduling 18 (2): 195–205. doi:10.1007/s10951-014-0381-1.
   Web of Science ®Google Scholar
• Yugma, C., S. Dauzère-Pérès, C. Artigues, A. Derreumaux, 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. doi:10.1080/00207543.2011.575090.
   Web of Science ®Google Scholar
• Yugma, C., S. Dauzère-Pérès, A. Derreumaux, and O. Sibille, 2008. A Batch Optimization Sofware for Diffusion Area Scheduling in Semiconductor Manufacturinged. 2008 Advanced Semiconductor Manufacturing Conference, 327–332.
   Google Scholar