Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems. © 2010 Elsevier B.V. All rights reserved.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004