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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 45; číslo 3; s. 92
Hlavní autori:	Huo, Yujia, Miao, Cuixia, Kong, Fanyu, Zhang, Yuzhong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2023 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!