Optimal on-line algorithms for single-machine scheduling (Q4645938): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/3-540-61310-2_30 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1585522101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower and upper bounds for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4835595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs that arrive over time / rank
 
Normal rank

Latest revision as of 19:57, 17 July 2024

scientific article; zbMATH DE number 7000364
Language Label Description Also known as
English
Optimal on-line algorithms for single-machine scheduling
scientific article; zbMATH DE number 7000364

    Statements

    Optimal on-line algorithms for single-machine scheduling (English)
    0 references
    11 January 2019
    0 references
    online algorithms
    0 references
    single-machine scheduling
    0 references
    worst-case analysis
    0 references

    Identifiers