Multitasking scheduling with alternate periods
In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and a 4 3 -approximation algorithm for a special case when jobs have identical release...
Uloženo v:
| Vydáno v: | Journal of combinatorial optimization Ročník 45; číslo 3; s. 92 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Springer US
01.04.2023
Springer Nature B.V |
| Témata: | |
| ISSN: | 1382-6905, 1573-2886 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and a
4
3
-approximation algorithm for a special case when jobs have identical release dates. And we prove that the problem is strongly NP-hard when jobs have different release dates. For the minimization of makespan on identical parallel machines, we present a
(
5
2
-
1
m
)
-approximation algorithm for the general case and a pseudo-polynomial time algorithm when the number of machines is constant. Furthermore, we prove that the single-machine scheduling of minimizing the lateness is strongly NP-hard. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1382-6905 1573-2886 |
| DOI: | 10.1007/s10878-023-01020-x |