Semi-online scheduling with ``end of sequence'' information (Q2460107): 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.1007/s10878-006-9040-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069274628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The on-line multiprocessor scheduling problem with known sum of the tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line bin-stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online algorithms for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for bandwidth allocation on two links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal non-preemptive semi-online scheduling on two related machines / 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: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / 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: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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 problems on two identical machines with combined partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on on-line scheduling with partial information / rank
 
Normal rank

Latest revision as of 12:02, 27 June 2024

scientific article
Language Label Description Also known as
English
Semi-online scheduling with ``end of sequence'' information
scientific article

    Statements

    Semi-online scheduling with ``end of sequence'' information (English)
    0 references
    0 references
    0 references
    14 November 2007
    0 references
    online algorithms
    0 references
    machine scheduling
    0 references
    competitive analysis
    0 references
    uniformly related machines
    0 references

    Identifiers