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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial optimization Jg. 45; H. 3; S. 92
Hauptverfasser: Huo, Yujia, Miao, Cuixia, Kong, Fanyu, Zhang, Yuzhong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.04.2023
Springer Nature B.V
Schlagworte:
Algorithms
Approximation
Combinatorics
Convex and Discrete Geometry
Dynamic programming
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Multitasking
Operations Research/Decision Theory
Optimization
Polynomials
Scheduling
Theory of Computation
Strongly NP-hard
Multitasking scheduling
Approximation algorithm
Pseudo-polynomial-time algorithm
ISSN:1382-6905, 1573-2886
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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