Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2004.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051819308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized online scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line machine covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line bin-stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal on-line parallel machine scheduling / 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 scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / 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: Ordinal algorithms for parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with decreasing job sizes / 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 with ordinal data on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line problems on two identical machines with combined partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times / rank
 
Normal rank

Latest revision as of 15:52, 10 June 2024

scientific article
Language Label Description Also known as
English
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
scientific article

    Statements

    Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (English)
    0 references
    0 references
    0 references
    28 September 2005
    0 references
    Analysis of algorithm
    0 references
    Scheduling
    0 references
    Semi-online
    0 references
    Competitive ratio
    0 references

    Identifiers