Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme

DOI10.1007/s00453-003-1078-6zbMath1072.90015OpenAlexW2116636977WikidataQ94701715 ScholiaQ94701715MaRDI QIDQ1879360

Klaus Jansen

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1078-6

zbMATH Keywords

non-preemptive schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (14)

Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ Resource loading with time windows ⋮ Machine scheduling with resource dependent processing times ⋮ Peak demand minimization via sliced strip packing ⋮ Scheduling malleable tasks with precedence constraints ⋮ Online malleable job scheduling for \(m\leq 3\) ⋮ An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ Asymptotically optimal scheduling of random malleable demands in smart grid ⋮ Competitive online scheduling of perfectly malleable jobs with setup times ⋮ Multi-core real-time scheduling for generalized parallel task models ⋮ An approximation algorithm for the general max-min resource sharing problem ⋮ Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models

This page was built for publication: Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme