M. Tismenetsky
International Journal of Computer 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.
M. Tismenetsky
International Journal of Computer Mathematics
Imran Nasim, Melanie Weber
SCML 2024
John S. Lew
Mathematical Biosciences
Chai Wah Wu
Linear Algebra and Its Applications