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

Share/Save/Bookmark

Kuijpers, C.M.H. and Hurkens, C.A.J. and Melissen, J.B.M. (1997) Fast movement strategies for a step-and-scan wafer stepper. Statistica Neerlandica, 51 (1). pp. 55-71. ISSN 0039-0402

open access
[img]
Preview
PDF
712kB
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.

Item Type:Article
Copyright:© 1997 Blackwell
Research Group:
Link to this item:http://purl.utwente.nl/publications/58538
Official URL:http://dx.doi.org/10.1111/1467-9574.00037
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page