Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
The exact LPT-bound for maximizing the minimum completion time
Operations Research Letters
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Vector Assignment Problems: A General Framework
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Vector assignment problems: a general framework
Journal of Algorithms
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Information and Computation
Tight bounds for bandwidth allocation on two links
Discrete Applied Mathematics
ACM SIGecom Exchanges
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Theoretical Computer Science
Optimal semi-online algorithms for machine covering
Theoretical Computer Science
On allocations that maximize fairness
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel machine scheduling problems with proportionally deteriorating jobs
International Journal of Systems Science
MaxMin allocation via degree lower-bounded arborescences
Proceedings of the forty-first annual ACM symposium on Theory of computing
Online Scheduling with Bounded Migration
Mathematics of Operations Research
Semi-online machine covering for two uniform machines
Theoretical Computer Science
Maximizing the minimum load for selfish agents
Theoretical Computer Science
Note: Tight bounds for bandwidth allocation on two links
Discrete Applied Mathematics
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Information and Computation
Maximizing the minimum load for selfish agents
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Max-min online allocations with a reordering buffer
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A robust PTAS for machine covering and packing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A truthful constant approximation for maximizing the minimum load on related machines
WINE'10 Proceedings of the 6th international conference on Internet and network economics
On-line machine covering on two machines with local migration
Computers & Mathematics with Applications
A note on semi-online machine covering
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximation with a fixed number of solutions of some biobjective maximization problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Optimal partitions in additively separable hedonic games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Computing desirable partitions in additively separable hedonic games
Artificial Intelligence
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We consider the problem of assigning a set of n jobs to a system of m identical parallel machines so as to maximize the earliest machine completion time (without using idle times). This problem has applications in the sequencing of maintenance actions for modular gas turbine aircraft engines. Up to now, only approximation algorithms were known whose worst case ratio was bounded strictly away from one. In this note, we derive the first polynomial-time approximation scheme for this problem. The time complexity of our algorithms is O(c"@?nlogm), where c"@? is a constant that depends on the desired precision @?.