New lower and upper bounds for on-line scheduling (Q1892104): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q170010
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gerhard J. Woeginger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(94)90071-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996869102 / rank
 
Normal rank

Latest revision as of 10:24, 30 July 2024

scientific article
Language Label Description Also known as
English
New lower and upper bounds for on-line scheduling
scientific article

    Statements

    New lower and upper bounds for on-line scheduling (English)
    0 references
    0 references
    0 references
    0 references
    6 July 1995
    0 references
    0 references
    worst-case analysis
    0 references
    on-line scheduling a set of independent jobs
    0 references
    parallel and identical machines
    0 references
    0 references