A note on on-line scheduling with partial information (Q1886493): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Guo-Chuan Zhang / rank
Normal rank
 
Property / author
 
Property / author: Guo-Chuan Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank

Latest revision as of 15:23, 7 June 2024

scientific article
Language Label Description Also known as
English
A note on on-line scheduling with partial information
scientific article

    Statements

    A note on on-line scheduling with partial information (English)
    0 references
    0 references
    0 references
    18 November 2004
    0 references
    0 references
    Machine scheduling
    0 references
    Competitive analysis
    0 references
    On-line algorithm
    0 references