Imran Nasim, Michael E. Henderson
Mathematics
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.
Imran Nasim, Michael E. Henderson
Mathematics
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering