The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001): 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: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723565 / 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: A 1. 47-approximation for a preemptive single-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequencing Problem with Release Dates and Clustered Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828982 / rank
 
Normal rank

Revision as of 09:28, 4 June 2024

scientific article
Language Label Description Also known as
English
The power of \(\alpha\)-points in preemptive single machine scheduling.
scientific article

    Statements

    The power of \(\alpha\)-points in preemptive single machine scheduling. (English)
    0 references
    0 references
    0 references
    27 July 2003
    0 references
    scheduling theory
    0 references
    approximation algorithm
    0 references
    on-line algorithm
    0 references
    randomized algorithm
    0 references
    LP relaxation
    0 references
    combinatorial optimization
    0 references

    Identifiers