An improved approximation algorithm for scheduling monotonic moldable tasks
From MaRDI portal
Publication:6106483
DOI10.1016/j.ejor.2022.08.034OpenAlexW4294204430WikidataQ114184232 ScholiaQ114184232MaRDI QIDQ6106483
Fangfang Wu, Xiandong Zhang, Bo Chen
Publication date: 3 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.08.034
Related Items (2)
Efficient approximation algorithms for scheduling moldable tasks ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
Cites Work
- Unnamed Item
- Unnamed Item
- List scheduling of parallel tasks
- A note on the Kenyon-Remila strip-packing algorithm
- Rectangle packing with one-dimensional resource augmentation
- Scheduling parallel jobs to minimize the makespan
- Scheduling for parallel processing
- A 2.5 times optimal algorithm for packing in two dimensions
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Optimal workforce assignment to operations of a paced assembly line
- Minimizing the number of workers in a paced mixed-model assembly line
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Improved approximation for two dimensional strip packing with polynomial bounded width
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
- Complexity of Scheduling Parallel Task Systems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- A algorithm for two-dimensional packing
- Bounds for Multiprocessor Scheduling with Resource Constraints
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- The Parallel Evaluation of General Arithmetic Expressions
- On approximating strip packing with a better ratio than 3/2
- Improved Pseudo-Polynomial-Time Approximation for Strip Packing
- Closing the Gap for Pseudo-Polynomial Strip Packing
- A (5/3 + ε)-Approximation for Strip Packing
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Approximation Algorithms for Scheduling Parallel Jobs
- Complexity and inapproximability results for parallel task scheduling and strip packing
- Scheduling independent multiprocessor tasks
This page was built for publication: An improved approximation algorithm for scheduling monotonic moldable tasks
