Conference paper
Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
We consider the High-Multiplicity Cyclic Job Shop Scheduling Problem. There are two objectives of interest: the cycle time and the flow time. We give several approximation algorithms after showing that a very restricted case is APX-hard. © 2008 Elsevier B.V. All rights reserved.
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
J. LaRue, C. Ting
Proceedings of SPIE 1989