Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Paper
High-multiplicity cyclic job shop scheduling
Abstract
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.
Related
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Conference paper
Isotropic treatment of EMF effects in advanced photomasks
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
Fernando Martinez, Juntao Chen, et al.
AAAI 2025