Skip to content

Transient Scheduling of Dual-Armed Cluster Tools With Concurrent Processing: An MIP Model and a Fast Heuristic

2026 · IEEE transactions on engineering management · Vol 73, pp. 4326-4341 · 0 citations · 34 references
Computer Science

Abstract

Efficient transient scheduling of cluster tools is critical to stable fab-level operations in high-mix, low-volume semiconductor manufacturing. This study investigates the transient scheduling problem of dual-armed cluster tools (DACTs) processing two wafer types concurrently. From an engineering-management perspective, the problem is important because wafer release and robot sequencing decisions affect tool utilization, completion-time predictability, and fab-level responsiveness. A mixed-integer programming model is developed to jointly optimize wafer release order and robot task sequence with the objective of minimizing total completion time. To address the computational intractability of medium- and large-scale instances, a two-combined swap sequence (2-CSS) is proposed. Numerical results show that 2-CSS substantially reduces computation time while incurring only a 5.31% average increase in total completion time. The results also show that DACTs provide substantial throughput benefits over single-armed configurations, with improvements of up to 9.51%. Robustness analysis further shows that the observed dual-arm advantage persists across varying robot loading/unloading times and wafer residency time constraint-to-processing time ratios, while 2-CSS maintains small optimality gaps as the loading/unloading time and the processing time of a selected step vary, even when the system bottleneck shifts between processing steps. These findings can help fab managers evaluate transient schedules more quickly and coordinate tool operations more effectively in high-mix production.

View source

Similar papers

Conference Aug 2026

Transient Scheduling of Dual-Armed Cluster Tools with Concurrent Processing for Enhancing Fab-Level Resilience

With the rapid evolution of global semiconductor supply chains, maintaining efficient and stable fab-level operations is critical to manufacturing performance. As core processing platforms in advanced wafer fabrication, cluster tools face increasing scheduling complexity under high-mix, lowvolume production. This study...

Zhen-Yan Wu, Chao Li, Fa-Jun Yang · 0 citations
Open access

Novel solution algorithms for machine scheduling problems emerging in complex systems

The findings demonstrate how mathematical optimization and advanced metaheuristics can be combined with problem-specific structural insights to improve solution quality and computational efficiency in production and operations research.

Söhnke Maecker · 0 citations
Open access Aug 2026

An Adaptive Co-Evolutionary Memetic Algorithm for a Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup and Transportation Times

The hybrid flow shop scheduling problem (HFSP) with unrelated parallel machines (UPMs), sequence-dependent setup times (SDSTs), and inter-stage transportation times has recently emerged as a prominent research topic. To address this scheduling problem with the objective of minimizing the maximum completion time (makesp...

De-Kun Wang, Yue-Chang Lei, Zheng Yuan et al. · 0 citations
Open access Sep 2026

Distributionally Robust Optimization for Permutation Flow Shop Scheduling with Sequence-Dependent Setup Times and Operational Cost Under Uncertainty in Industry 4.0 Manufacturing Systems

Production scheduling in sustainable manufacturing systems must cope with processing time uncertainty while maintaining operational efficiency and controlling operational costs. This paper proposes a Distributionally Robust Optimization (DRO) model for the permutation flow shop scheduling problem with sequence-dependen...

Hafsa Mimouni, A. Jalid, Said Aqil · 0 citations
Open access 2026

A Real-Time Heuristic for Large-Scale Workforce Task Assignment, Multi-Vehicle Routing, and Scheduling With Time-Dependent Profits

A real-time, parallelizable algorithm that assigns and schedules tasks based on their profitability and deadlines, on technician availability, and on skill compatibility, while dynamically adjusting routes and schedules in response to delays or new task requests is provided, preserving service quality under uncertainty...

D. Deplano, C. Seatzu, M. Franceschelli · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.