Algorithms for scheduling deadline-sensitive malleable tasks
From MaRDI portal
Publication:6559486
DOI10.1007/S43069-024-00300-4zbMATH Open1541.90178MaRDI QIDQ6559486FDOQ6559486
Authors: Xiaohu Wu, Patrick Loiseau 
Publication date: 21 June 2024
Published in: SN Operations Research Forum (Search for Journal in Brave)
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Cites Work
- The design of approximation algorithms
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Some simple scheduling algorithms
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
- Title not available (Why is that?)
- Malleable scheduling for flows of jobs and applications to MapReduce
- A truthful mechanism for value-based scheduling in cloud computing
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Efficient approximation algorithms for scheduling moldable tasks
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)
