Improvements in throughout maximization for real-time scheduling

Piotr Berman, Bhaskar Dasgupta

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

    29 Citations (Scopus)

    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

    Fingerprint

    Scheduling
    Linear programming
    Polynomials
    Integer programming
    Profitability
    Throughput

    All Science Journal Classification (ASJC) codes

    • Software

    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
    Berman, Piotr ; Dasgupta, Bhaskar. / Improvements in throughout maximization for real-time scheduling. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. 2000. pp. 680-687 (Proceedings of the Annual ACM Symposium on Theory of Computing).
    @inproceedings{8596a166940b48ce959b27bf0cf0b367,
    title = "Improvements in throughout maximization for real-time scheduling",
    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.",
    author = "Piotr Berman and Bhaskar Dasgupta",
    year = "2000",
    month = "12",
    day = "1",
    doi = "10.1145/335305.335401",
    language = "English (US)",
    isbn = "1581131844",
    series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
    pages = "680--687",
    booktitle = "Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000",

    }

    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. Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 680-687, 32nd Annual ACM Symposium on Theory of Computing, STOC 2000, Portland, OR, United States, 5/21/00. https://doi.org/10.1145/335305.335401

    Improvements in throughout maximization for real-time scheduling. / Berman, Piotr; Dasgupta, Bhaskar.

    Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. 2000. p. 680-687 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    TY - GEN

    T1 - Improvements in throughout maximization for real-time scheduling

    AU - Berman, Piotr

    AU - Dasgupta, Bhaskar

    PY - 2000/12/1

    Y1 - 2000/12/1

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0033722340&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0033722340&partnerID=8YFLogxK

    U2 - 10.1145/335305.335401

    DO - 10.1145/335305.335401

    M3 - Conference contribution

    AN - SCOPUS:0033722340

    SN - 1581131844

    SN - 9781581131840

    T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

    SP - 680

    EP - 687

    BT - Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000

    ER -

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