John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
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.
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.