A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Throughput maximization of real-time scheduling with batching
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
Journal of Experimental Algorithmics (JEA)
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Journal of Scheduling
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Scheduling an active camera to observe people
Proceedings of the ACM 2nd international workshop on Video surveillance & sensor networks
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Surveillance camera scheduling: a virtual vision approach
Proceedings of the third ACM international workshop on Video surveillance & sensor networks
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
Algorithmic aspects of bandwidth trading
ACM Transactions on Algorithms (TALG)
A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
Computers and Operations Research
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
Computers and Industrial Engineering
Graph colouring approaches for a satellite range scheduling problem
Journal of Scheduling
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms (TALG)
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
Integrated Production and Delivery Scheduling with Disjoint Windows
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Quality-aware segment transmission scheduling in peer-to-peer streaming systems
MMSys '10 Proceedings of the first annual ACM SIGMM conference on Multimedia systems
Integrated production and delivery scheduling with disjoint windows
Discrete Applied Mathematics
Algorithmic aspects of bandwidth trading
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Real-time scheduling with a budget
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximating interval scheduling problems with bounded profits
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Randomized priority algorithms
Theoretical Computer Science
Virtual appliance content distribution for a global infrastructure cloud service
INFOCOM'10 Proceedings of the 29th conference on Information communications
Bandwidth allocation in cellular networks with multiple interferences
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Algorithms and complexity for periodic real-time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Theoretical Computer Science
A truthful mechanism for value-based scheduling in cloud computing
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Pickup and delivery for moving objects on broken lines
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
Priority algorithms for the subset-sum problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Interval selection with machine-dependent intervals
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
Theory of Computing Systems
Hi-index | 0.00 |
We consider the following fundamental scheduling problem. The input to the problem consists of n jobs and k machines. Each of the jobs is associated with a release time, a deadline, a weight, and a processing time on each of the machines. The goal is to find a nonpreemptive schedule that maximizes the weight of jobs that meet their respective deadlines. We give constant factor approximation algorithms for four variants of the problem, depending on the type of the machines (identical vs. unrelated) and the weight of the jobs (identical vs. arbitrary). All these variants are known to be NP-hard, and the two variants involving unrelated machines are also MAX-SNP hard. The specific results obtained are as follows: For identical job weights and unrelated machines: a greedy $2$-approximation algorithm. For identical job weights and k identical machines: the same greedy algorithm achieves a tight $\frac{(1+1/k)^k}{(1+1/k)^k-1}$ approximation factor. For arbitrary job weights and a single machine: an LP formulation achieves a 2-approximation for polynomially bounded integral input and a 3-approximation for arbitrary input. For unrelated machines, the factors are 3 and 4, respectively. For arbitrary job weights and k identical machines: the LP-based algorithm applied repeatedly achieves a $\frac{(1+1/k)^k}{(1+1/k)^k-1}$ approximation factor for polynomially bounded integral input and a $\frac{(1+1/2k)^k}{(1+1/2k)^k-1}$ approximation factor for arbitrary input. For arbitrary job weights and unrelated machines: a combinatorial $(3+2\sqrt{2} \approx 5.828)$-approximation algorithm.