An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing average completion time in the presence of release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling jobs with tightly-grouped processing times on three identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates / rank
 
Normal rank

Latest revision as of 04:41, 3 July 2024

scientific article
Language Label Description Also known as
English
An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
scientific article

    Statements

    An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    analysis of algorithms
    0 references
    semi-online algorithms
    0 references
    single machine scheduling
    0 references
    total weighted completion time
    0 references
    competitive ratio
    0 references
    0 references