Real time scheduling with a budget: parametric-search is better than binary search

Authors:
Asaf Levin
Affiliations:
Department of Statistics, The Hebrew University, Jerusalem, Israel
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 0

Bicriteria network design problems

Journal of Algorithms
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Real-time scheduling with a budget

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Strongly polynomial-time approximation for a class of bicriteria problems

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a feasible subset S of the jobs on a single machine such that the total weight of S is maximized, and the total cost of S is within a given budget. Using Megiddo's parametric method we improve an earlier algorithm that is based on applying binary search.