Fast movement strategies for a step‐and‐scan wafer stepper

C. M. H. Kuijpers, C. A. J. Hurkens and J. B. M. Melissen

Statistica Neerlandica, 1997, vol. 51, issue 1, 55-71

Abstract: We describe algorithms for the determination of fast movement strategies for a step‐and‐scan wafer stepper, a device that is used for the photolithographic processing of integrated circuits. The proposed solution strategy consists of two parts. First, we determine the maximum number of congruent rectangular chips that can be packed on a wafer, subject to the restriction that the chips are placed in a rectangular grid. Second, we find fast movement strategies for scanning all chips of a given packing, given the mechanical restrictions of the wafer stepper. The corresponding combinatorial optimization problem is formulated as a generalized asymmetric traveling salesman problem. We show how feasible scan strategies are determined, and how these strategies are improved by local search techniques, such as iterative improvement based on 2‐ and 3‐exchanges, and simulated annealing based on 2‐exchanges.

Date: 1997
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/1467-9574.00037

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:51:y:1997:i:1:p:55-71

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().