APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
From MaRDI portal
Publication:3021973
DOI10.1142/S0129054102001308zbMath1066.68010OpenAlexW1975231449MaRDI QIDQ3021973
Gerhard J. Woeginger, Renaud Lepère, Denis Trystram
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054102001308
schedulingapproximation algorithmparallel computingproject managementprecedence constraintsbounded widthmalleable tasksdiscrete time-cost tradeoff problemseries parallel order
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Scheduling malleable tasks with precedence constraints, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
Cites Work