Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
In the paper we consider the problem of scheduling n identical jobs on 4 uniform machines with speeds s ≥ s ≥ s ≥ s , respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of mutual exclusion constraints modeled by a bipartite incomp...
Uložené v:
| Vydané v: | Bulletin of the Polish Academy of Sciences. Technical sciences Ročník 65; číslo 1; s. 29 - 34 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Warsaw
De Gruyter Open
01.02.2017
Polish Academy of Sciences |
| Predmet: | |
| ISSN: | 2300-1917, 0239-7528, 2300-1917 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | In the paper we consider the problem of scheduling n identical jobs on 4 uniform machines with speeds s
≥ s
≥ s
≥ s
, respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of mutual exclusion constraints modeled by a bipartite incompatibility graph of degree Δ, where two incompatible jobs cannot be processed on the same machine. We show that the general problem is NP-hard even if s
= s
= s
. If, however, Δ ≤ 4 and s
≥ 12s
, s
= s
= s
, then the problem can be solved to optimality in time O(n
). The same algorithm returns a solution of value at most 2 times optimal provided that s
≥ 2s
. Finally, we study the case s
≥ s
≥ s
= s
and give a 32/15-approximation algorithm running also in O(n
) time. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2300-1917 0239-7528 2300-1917 |
| DOI: | 10.1515/bpasts-2017-0004 |