Algorithms for scheduling deadline-sensitive malleable tasks

DOI10.1007/S43069-024-00300-4MaRDI QIDQ6559486zbMATH OpenFDO

Authors Xiaohu Wu, Patrick Loiseau

Publication date 21 June 2024

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S43069-024-00300-4

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scheduling parallel tasks with individual deadlines
• Scheduling parallel tasks with individual deadlines
• scientific article; zbMATH DE number 1863269
• scientific article; zbMATH DE number 1003247
• A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks

Cites work

• A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A truthful mechanism for value-based scheduling in cloud computing
• Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• Closing the Gap for Pseudo-Polynomial Strip Packing
• Efficient approximation algorithms for scheduling moldable tasks
• scientific article; zbMATH DE number 1196650 (Why is no real title available?)
• scientific article; zbMATH DE number 1003247 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 793950 (Why is no real title available?)
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• Malleable scheduling for flows of jobs and applications to MapReduce
• Some simple scheduling algorithms
• The design of approximation algorithms

This page was built for publication: Algorithms for scheduling deadline-sensitive malleable tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559486)