A better lower bound for on-line scheduling (Q1327292): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858002 / rank
 
Normal rank

Latest revision as of 16:31, 22 May 2024

scientific article
Language Label Description Also known as
English
A better lower bound for on-line scheduling
scientific article

    Statements

    A better lower bound for on-line scheduling (English)
    0 references
    0 references
    0 references
    0 references
    15 June 1994
    0 references
    0 references
    \(m\)-machine scheduling problem
    0 references
    0 references