A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
From MaRDI portal
Publication:2164700
DOI10.1007/978-3-031-06901-7_18zbMath1497.90087arXiv2111.06733OpenAlexW3213982602MaRDI QIDQ2164700
Orestis Papadigenopoulos, Jannik Matuschke, Dimitris Fotakis
Publication date: 16 August 2022
Full work available at URL: https://arxiv.org/abs/2111.06733
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Strong LP formulations for scheduling splittable jobs on unrelated machines
- Walrasian equilibrium with gross substitutes
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Gross substitutability: an algorithmic survey
- Scheduling cleaning activities on trains by minimizing idle times
- Computing Walrasian equilibria: fast algorithms and structural properties
- The Santa Claus problem
- Complexity of Scheduling Parallel Task Systems
- Job Matching, Coalition Formation, and Gross Substitutes
- Discrete Convex Analysis
- M♮-Convexity and Its Applications in Operations
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Approximation Algorithms for Scheduling Parallel Jobs
- Matrices and matroids for systems analysis
- Approximating Nash social welfare under rado valuations
This page was built for publication: A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
