The expected asymptotical ratio for preemptive stochastic online problem (Q391147): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059588513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on time-sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions / 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
Property / cites work
 
Property / cites work: On the Expected Relative Performance of List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive stochastic online scheduling on two uniform machines / rank
 
Normal rank
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: Q5501838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic scheduling problems I — General strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Stochastic Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation in Preemptive Stochastic Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on time sharing with preferred customers / 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: On the asymptotic optimality of algorithms for the flow shop problem with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new average case analysis for completion time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling for Minimum Total Loss Using Service Time Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank

Latest revision as of 04:44, 7 July 2024

scientific article
Language Label Description Also known as
English
The expected asymptotical ratio for preemptive stochastic online problem
scientific article

    Statements

    The expected asymptotical ratio for preemptive stochastic online problem (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    scheduling
    0 references
    online algorithm
    0 references
    asymptotical optimality
    0 references
    uniform machines
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers