Efficient approximation algorithms for scheduling moldable tasks

•We study scheduling independent moldable tasks under the proposed (δj,kj)-monotonic model, whose generality is between the classic monotonic and linear-speedup models.•An efficient algorithm for makespan minimization is proposed, achieving an approximation ratio close to 1.333 under mild assumption...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 310; číslo 1; s. 71 - 83
Hlavní autori:	Wu, Xiaohu, Loiseau, Patrick
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2023 Elsevier
Predmet:	Approximation algorithms Computer Science Moldable tasks Operations Research Scheduling Moldable tasks Approximation algorithms Scheduling Scheduling; approximation algorithms; moldable tasks
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!