| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419484 | Discrete Applied Mathematics | 2011 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ph. Baptiste, J. Carlier, A. Kononov, M. Queyranne, S. Sevastyanov, M. Sviridenko,