Abstrakt
Structural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems, but so far only rough bounds for these parameters have been derived for specific problems. This paper sharpens the bounds on these structural parameters for a well-known open problem in the theory of preemptive scheduling: Instances consist of in-trees of n unit-execution-time jobs with release dates, and the objective is to minimize the total completion time on two processors. This is among the current, tantalizing “threshold” problems of scheduling theory: Our literature survey reveals that any significant generalization leads to an NP-hard problem, but that any significant, but slight simplification leads to tractable problem with a polynomial-time solution. For the above problem, we show that the number of preemptions necessary for optimality need not exceed 2n−1; that the number must be of order Ω(logn) for some instances; and that the minimum shift need not be less than 2−2n+1. These bounds are obtained by combinatorial analysis of optimal preemptive schedules rather than by the analysis of polytope corners for linear-program formulations of the problem, an approach to be found in earlier papers. The bounds immediately follow from a fundamental structural property called normality, by which minimal shifts of a job are exponentially decreasing functions. In particular, the first interval between a preempted job’s start and its preemption must be a multiple of 1 / 2, the second such interval must be a multiple of 1 / 4, and in general, the i-th preemption must occur at a multiple of 2−i. We expect the new structural properties to play a prominent role in finally settling a vexing, still-open question of complexity.
Cytowania
-
2
CrossRef
-
0
Web of Science
-
2
Scopus
Autorzy (4)
Cytuj jako
Pełna treść
- Wersja publikacji
- Accepted albo Published Version
- DOI:
- Cyfrowy identyfikator dokumentu elektronicznego (otwiera się w nowej karcie) 10.1007/s10951-015-0446-9
- Licencja
- otwiera się w nowej karcie
Słowa kluczowe
Informacje szczegółowe
- Kategoria:
- Publikacja w czasopiśmie
- Typ:
- artykuł w czasopiśmie wyróżnionym w JCR
- Opublikowano w:
-
JOURNAL OF SCHEDULING
nr 19,
wydanie 6,
strony 701 - 728,
ISSN: 1094-6136 - Język:
- angielski
- Rok wydania:
- 2016
- Opis bibliograficzny:
- Chen B., Coffman E., Dereniowski D., Kubiak W.: Normal-form preemption sequences for an open problem in scheduling theory// JOURNAL OF SCHEDULING. -Vol. 19, iss. 6 (2016), s.701-728
- DOI:
- Cyfrowy identyfikator dokumentu elektronicznego (otwiera się w nowej karcie) 10.1007/s10951-015-0446-9
- Weryfikacja:
- Politechnika Gdańska
wyświetlono 103 razy