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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 310; no. 1; pp. 71 - 83
Main Authors:	Wu, Xiaohu, Loiseau, Patrick
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2023 Elsevier
Subjects:	Approximation algorithms Computer Science Moldable tasks Operations Research Scheduling Moldable tasks Approximation algorithms Scheduling Scheduling; approximation algorithms; moldable tasks
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!