Scheduling Time-Constrained Cluster Tools With Non-Identical Parallel Processing Chambers
- 9 January 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 11613-11624
Abstract
As a computer-integrated manufacturing system, cluster tools are widely used for semiconductor manufacturing. To tackle their scheduling problems with parallel processing chambers, existing studies assume that the parallel processing chambers at each step are identical. However, due to machine aging, some differences could appear among them in reality. This work represents the first one to report the scheduling problems of cluster tools with non-identical parallel processing chambers. By focusing on time-constrained single and dual-armed cluster tools with non-identical parallel processing chambers, it derives the sufficient conditions under which a system is schedulable. Based on them, it develops two algorithms to obtain the feasible and optimal schedules. It also develops two linear programming models to find the feasible and optimal ones if the sufficient conditions are violated. The experimental results based on 5400 random instances show that the proposed scheduling method can be readily used to generate schedules for both time-constrained single and dual-armed cluster tools.Keywords
Funding Information
- National Natural Science Foundation of China (72301166)
- Science and Technology Development Fund (FDCT), Macau, SAR, China (0083/2021/A2, 0011/2023/RIA1)
This publication has 36 references indexed in Scilit:
- Biased random-key genetic algorithm for the job sequencing and tool switching problem with non-identical parallel machinesComputers & Operations Research, 2023
- The production scheduling problem employing non-identical parallel machines with due dates considering carbon emissions and multiple types of energy sourcesExpert Systems with Applications, 2023
- Hybridizing local searching with genetic algorithms for the job sequencing and tool switching problem with non-identical parallel machinesExpert Systems with Applications, 2023
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimizationEuropean Journal of Operational Research, 2023
- A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machinesComputers & Industrial Engineering, 2022
- Optimizing multiple qualifications of products on non-identical parallel machinesComputers & Operations Research, 2022
- Non-identical parallel machines batch processing problem with release dates, due dates and variable maintenance activity to minimize total tardinessComputers & Industrial Engineering, 2022
- An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machinesEuropean Journal of Operational Research, 2022
- A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operationsJournal of Scheduling, 2011
- A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNINGIIE Transactions, 1992