Multi-phase algorithms for throughput maximization for real-time scheduling (Q1587588): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Bhaskar Das Gupta / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Frits C. R. Spieksma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1009822211065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1492069605 / rank
 
Normal rank

Latest revision as of 09:06, 30 July 2024

scientific article
Language Label Description Also known as
English
Multi-phase algorithms for throughput maximization for real-time scheduling
scientific article

    Statements

    Multi-phase algorithms for throughput maximization for real-time scheduling (English)
    0 references
    0 references
    0 references
    23 April 2002
    0 references
    The following scheduling problem is considered: given are \(n\) jobs, and \(m\) machines. To each job \(i\), a profit \(w_i\), a release date \(r_i\), and a deadline \(d_i\) is associated, \(1 \leq i \leq n\). Further, for each job \(i\) and machine \(j\), there is a length \(l_{ij}\), \(1 \leq i \leq n\), \(1 \leq j \leq m\). The problem is to find a maximum-weight feasible schedule, where a schedule is called feasible if no preemption occurs and two jobs on a same machine are not allowed to overlap. The authors provide combinatorial approximation algorithms for this problem and various special cases of it. In particular, a 2-approximation algorithm for the general case is described.
    0 references
    real-time scheduling
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references