Abstract
This paper presents an efficient algorithm for diffusion scheduling in a semiconductor fab. The diffusion area commonly creates long queue time in the entire process flow. Due to the complex constraints, such as parallel batching and time windows, and large solution space, it is difficult to find a feasible schedule in a timely manner. A greedy randomized procedure forms the batches. A heuristic method is introduced to handle the time window constraints. Two important properties of the problem are identified and applied to improve the quality of the solution. Simulated annealing is used as a local search procedure. Compared with the real schedule in the fab, the proposed algorithm can increase the effective moves significantly without violating queue time constraints.
Original language | English |
---|---|
Title of host publication | Proceedings - 16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017 |
Editors | Xiaohui Cui, Shaowen Yao, Simon Xu, Guobin Zhu |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 785-789 |
Number of pages | 5 |
ISBN (Electronic) | 9781509055074 |
DOIs | |
State | Published - 27 06 2017 |
Externally published | Yes |
Event | 16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017 - Wuhan, China Duration: 24 05 2017 → 26 05 2017 |
Publication series
Name | Proceedings - 16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017 |
---|
Conference
Conference | 16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017 |
---|---|
Country/Territory | China |
City | Wuhan |
Period | 24/05/17 → 26/05/17 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.
Keywords
- Furnace scheduling
- Greedy randomized solution
- Simulated annealing
- Time window constraints