Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Approximation schemes for constrained scheduling problems
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On-Line Multiple-Strip Packing
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A fast 5/2-approximation algorithm for hierarchical scheduling
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
A (5/3 + ε)-approximation for strip packing
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximation Algorithms for Scheduling Parallel Jobs
SIAM Journal on Computing
Two level job-scheduling strategies for a computational grid
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Approximation algorithms for multiple strip packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
Rectangle packing with one-dimensional resource augmentation
Discrete Optimization
| Hi-index | 0.00 |
In the context of grid scheduling we consider a scheduling scenario, where parallel jobs have to be scheduled non-preemptively on heterogeneous computational platforms of processors. The speed of the processors may differ among the platforms and the jobs are submitted simultaneously or over time and cannot run across multiple platforms. We focus on the target of minimizing the total makespan, i.e. the global latest finishing time of a job. In this paper we present an AFPTAS for the problem without release times and show how to generalize our result to malleable jobs and jobs with release times.