Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
The budgeted maximum coverage problem
Information Processing Letters
Approximation algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Optimal partition of QoS requirements on unicast paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
Some Tractable Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Real time scheduling with a budget: parametric-search is better than binary search
Information Processing Letters
Hi-index | 0.00 |
Suppose that we are given a set of jobs, where each job has a processing time, a non-negative weight, and a set of possible time intervals in which it can be processed. In addition, each job has a processing cost. Our goal is to schedule a feasible subset of the jobs on a single machine, such that the total weight is maximized, and the cost of the schedule is within a given budget. We refer to this problem as budgeted real-time scheduling (BRS). Indeed, the special case where the budget is unbounded is the well-known real-time scheduling problem. The second problem that we consider is budgeted real-time scheduling with overlaps (BRSO), in which several jobs may be processed simultaneously, and the goal is to maximize the time in which the machine is utilized. Our two variants of the real-time scheduling problem have important applications, in vehicle scheduling, linear combinatorial auctions and QoS management for Internet connections. These problems are the focus of this paper. Both BRS and BRSO are strongly NP-hard, even with unbounded budget. Our main results are (2 + Ɛ)-approximation algorithms for these problems. This ratio coincides with the best known approximation factor for the (unbudgeted) real-time scheduling problem, and is slightly weaker than the best known approximation factor of e/(e - 1) for the (unbudgeted) real-time scheduling with overlaps, presented in this paper. We show that better ratios (or simpler approximation algorithms) can be derived for some special cases, including instances with unit-costs and the budgeted job interval selection problem (JISP). Budgeted JISP is shown to be APX-hard even when overlaps are allowed and with unbounded budget. Finally, our results can be extended to instances with multiple machines.