An improved approximation algorithm for scheduling monotonic moldable tasks

DOI10.1016/J.EJOR.2022.08.034MaRDI QIDQ6106483zbMATH OpenOpenAlexWikidataFDO

Authors Fangfang Wu, Xiandong Zhang, Bo Chen

Publication date 3 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2022.08.034

zbMATH Keywords

approximation algorithmmoldable tasksscheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
• A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• scientific article; zbMATH DE number 1241387
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Algorithms and Computation

Cites work

• A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• A 2.5 times optimal algorithm for packing in two dimensions
• A (5/3 + )-approximation for strip packing
• A algorithm for two-dimensional packing
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
• A near-optimal solution to a two-dimensional cutting stock problem
• A note on the Kenyon-Remila strip-packing algorithm
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• A structural lemma in 2-dimensional packing, and its implications on approximability
• Approximation algorithms for scheduling parallel jobs
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Closing the Gap for Pseudo-Polynomial Strip Packing
• Complexity of Scheduling Parallel Task Systems
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1003247 (Why is no real title available?)
• Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
• Improved pseudo-polynomial-time approximation for strip packing
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• List scheduling of parallel tasks
• Minimizing the number of workers in a paced mixed-model assembly line
• On approximating strip packing with a better ratio than 3/2
• Optimal workforce assignment to operations of a paced assembly line
• Orthogonal Packings in Two Dimensions
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
• Rectangle packing with one-dimensional resource augmentation
• Scheduling for parallel processing
• Scheduling independent multiprocessor tasks
• Scheduling parallel jobs to minimize the makespan
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(4)

• Dynamising Interval Scheduling: The Monotonic Case
• Efficient approximation algorithms for scheduling moldable tasks
• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
• Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs

This page was built for publication: An improved approximation algorithm for scheduling monotonic moldable tasks

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