2023
DOI: 10.1007/s11518-023-5564-x
|View full text |Cite
|
Sign up to set email alerts
|

DTFab: A Digital Twin based Approach for Optimal Reticle Management in Semiconductor Photolithography

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…Kim et al [20] adopt a deep reinforcement learning approach to learn a near-optimal scheduling policy by incorporating work-in-progress, reticles, and the tardiness of jobs. Sivasubramanian et al [21] propose a simulation-based approach for real-time reticle management problem with the capability of retrieving information from the real-world system and improve upon commonly used policies. In our paper, we consider a static problem, but with additional complications such as the presence of pods and auxiliary-resource travel times.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Kim et al [20] adopt a deep reinforcement learning approach to learn a near-optimal scheduling policy by incorporating work-in-progress, reticles, and the tardiness of jobs. Sivasubramanian et al [21] propose a simulation-based approach for real-time reticle management problem with the capability of retrieving information from the real-world system and improve upon commonly used policies. In our paper, we consider a static problem, but with additional complications such as the presence of pods and auxiliary-resource travel times.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Similarly, constraints ( 15)-( 17) and constraints ( 18)-( 20) ensure a correct sequencing of jobs per reticle and per pod, respectively. Constraint (21) ensures that each a machine can start a job not earlier than time zero. (22) calculates the end time of job on a machine and constraint (23) ensures that a job starts after the immediate preceding job ends.…”
Section: Mixed Integer Programming Formulationmentioning
confidence: 99%