Improvements in throughout maximization for real-time scheduling

Piotr Berman, Bhaskar Dasgupta

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    29 Scopus citations

    Abstract

    We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the versions of the problem discussed here were already treated by Bar-Noy et al. [3]. Our main contribution is to provide algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in [3], while either having the same quality of approximation or improving it. More precisely, compared to the results of in Bar-Noy et al. [3], our pseudo-polynomial algorithm for multiple unrelated machines and all of our strongly-polynomial algorithms have better performance ratios, all of our algorithms run much faster, are combinatorial in nature and avoid linear programming. Finally, we show that algorithms with better performance ratios than 2 are possible if the stretch factors of the jobs are bounded; a straightforward consequence of this result is an improvement of the ratio of an optimal solution of the integer programming formulation of the JISP2 problem (see [13]) to its linear programming relaxation.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
    Pages680-687
    Number of pages8
    DOIs
    StatePublished - Dec 1 2000
    Event32nd Annual ACM Symposium on Theory of Computing, STOC 2000 - Portland, OR, United States
    Duration: May 21 2000May 23 2000

    Publication series

    NameProceedings of the Annual ACM Symposium on Theory of Computing
    ISSN (Print)0737-8017

    Conference

    Conference32nd Annual ACM Symposium on Theory of Computing, STOC 2000
    CountryUnited States
    CityPortland, OR
    Period5/21/005/23/00

    All Science Journal Classification (ASJC) codes

    • Software

    Fingerprint Dive into the research topics of 'Improvements in throughout maximization for real-time scheduling'. Together they form a unique fingerprint.

  • Cite this

    Berman, P., & Dasgupta, B. (2000). Improvements in throughout maximization for real-time scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000 (pp. 680-687). (Proceedings of the Annual ACM Symposium on Theory of Computing). https://doi.org/10.1145/335305.335401