Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
Mathematics of Operations Research
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
On Job Scheduling on a Hypercube
IEEE Transactions on Parallel and Distributed Systems
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Independent Jobs on Hypercubes
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Implementation of approximation algorithms for the max-min resource sharing problem
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
An improved approximation scheme for variable-sized bin packing
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An approximation algorithm for the general mixed packing and covering problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A robust AFPTAS for online bin packing with polynomial migration,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
In this paper we present a general technique to solve min-max and max-min resource sharing problems and show how to use it for two applications: scheduling jobs on unrelated machines, and strip packing.