Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ancient and new algorithms for load balancing in the \(\ell_p\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line machine covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact LPT-bound for maximizing the minimum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive semi-online scheduling to minimize makespan on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Greedy Solutions for a Replacement Part Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line scheduling problems for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal on-line scheduling for maximizing the minimum machine completion time / 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: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal algorithms for packing with target center of gravity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing using semi-ordinal data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal algorithms for parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line scheduling with ordinal data on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank

Latest revision as of 19:43, 7 June 2024

scientific article
Language Label Description Also known as
English
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
scientific article

    Statements

    Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (English)
    0 references
    0 references
    0 references
    0 references
    8 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Analysis of algorithm
    0 references
    Scheduling
    0 references
    Semi-online
    0 references
    Competitive ratio
    0 references
    0 references