Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling

Piotr Berman, Bhaskar Dasgupta

    Research output: Contribution to journalArticle

    51 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. (Proc. 31st ACM STOC, 1999, pp. 622-631; http://www.eng.tau.ac. il/∼amotz/). Our main contribution is to provide algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in Bar-Noy et al. (ibid., 1999), while either having the same quality of approximation or improving it. More precisely, compared to the results of in Bar-Noy et al. (ibid., 1999), 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 Spieksma, Journal of Scheduling, vol. 2, pp. 215-227, 1999) to its linear programming relaxation.

    Original languageEnglish (US)
    Pages (from-to)307-323
    Number of pages17
    JournalJournal of Combinatorial Optimization
    Volume4
    Issue number3
    DOIs
    StatePublished - Jan 1 2000

    Fingerprint

    Throughput
    Scheduling
    Real-time
    Linear programming
    Stretch Factor
    Strongly Polynomial Algorithm
    Release Time
    Linear Programming Relaxation
    Job Scheduling
    Polynomial Algorithm
    Deadline
    Integer Programming
    Profit
    Polynomials
    Optimal Solution
    Integer programming
    Formulation
    Line
    Approximation
    Profitability

    All Science Journal Classification (ASJC) codes

    • Computer Science Applications
    • Discrete Mathematics and Combinatorics
    • Control and Optimization
    • Computational Theory and Mathematics
    • Applied Mathematics

    Cite this

    Berman, Piotr ; Dasgupta, Bhaskar. / Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. In: Journal of Combinatorial Optimization. 2000 ; Vol. 4, No. 3. pp. 307-323.
    @article{1921221967e1485cb0d34419eae59cb7,
    title = "Multi-phase Algorithms for Throughput 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. (Proc. 31st ACM STOC, 1999, pp. 622-631; http://www.eng.tau.ac. il/∼amotz/). Our main contribution is to provide algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in Bar-Noy et al. (ibid., 1999), while either having the same quality of approximation or improving it. More precisely, compared to the results of in Bar-Noy et al. (ibid., 1999), 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 Spieksma, Journal of Scheduling, vol. 2, pp. 215-227, 1999) to its linear programming relaxation.",
    author = "Piotr Berman and Bhaskar Dasgupta",
    year = "2000",
    month = "1",
    day = "1",
    doi = "10.1023/A:1009822211065",
    language = "English (US)",
    volume = "4",
    pages = "307--323",
    journal = "Journal of Combinatorial Optimization",
    issn = "1382-6905",
    publisher = "Springer Netherlands",
    number = "3",

    }

    Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. / Berman, Piotr; Dasgupta, Bhaskar.

    In: Journal of Combinatorial Optimization, Vol. 4, No. 3, 01.01.2000, p. 307-323.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling

    AU - Berman, Piotr

    AU - Dasgupta, Bhaskar

    PY - 2000/1/1

    Y1 - 2000/1/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. (Proc. 31st ACM STOC, 1999, pp. 622-631; http://www.eng.tau.ac. il/∼amotz/). Our main contribution is to provide algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in Bar-Noy et al. (ibid., 1999), while either having the same quality of approximation or improving it. More precisely, compared to the results of in Bar-Noy et al. (ibid., 1999), 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 Spieksma, Journal of Scheduling, vol. 2, pp. 215-227, 1999) 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. (Proc. 31st ACM STOC, 1999, pp. 622-631; http://www.eng.tau.ac. il/∼amotz/). Our main contribution is to provide algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in Bar-Noy et al. (ibid., 1999), while either having the same quality of approximation or improving it. More precisely, compared to the results of in Bar-Noy et al. (ibid., 1999), 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 Spieksma, Journal of Scheduling, vol. 2, pp. 215-227, 1999) to its linear programming relaxation.

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

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

    U2 - 10.1023/A:1009822211065

    DO - 10.1023/A:1009822211065

    M3 - Article

    AN - SCOPUS:0000332042

    VL - 4

    SP - 307

    EP - 323

    JO - Journal of Combinatorial Optimization

    JF - Journal of Combinatorial Optimization

    SN - 1382-6905

    IS - 3

    ER -