Online scheduling of integrated single-wafer processing tools with temporal constraints

Cited 26 time in webofscience Cited 0 time in scopus
  • Hit : 165
  • Download : 0
This paper addresses the issues of online scheduling for integrated single-wafer processing tools with temporal constraints. The integrated single-wafer processing tool is an integrated processing system consisting of single-wafer processing modules and transfer modules. Certain chemical processes require that the wafer flow satisfies temporal constraints, especially, postprocessing residency constraints. This paper proposes an online scheduling method that guarantees both logical and temporal correctness for the integrated single-wafer processing tools. First, mathematical formulation of the scheduling problem using temporal constraint sets is presented. Then, an online, noncyclic scheduling algorithm with polynomial complexity is developed. The proposed scheduling algorithm consists of two subalgorithms: FEASIBLE_SCHED_SPACE and OPTIMAL_SCHER The former computes the feasible solution space in the continuous time domain, and the latter computes the optimal solution that minimizes the completion time of the last operation of a newly inserted wafer.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2005-08
Language
English
Article Type
Article
Keywords

TIME-WINDOW CONSTRAINTS; CLUSTER TOOLS; HOIST; NETWORKS

Citation

IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, v.18, pp.390 - 398

ISSN
0894-6507
DOI
10.1109/TSM.2005.852103
URI
http://hdl.handle.net/10203/91136
Appears in Collection
ME-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 26 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0