Preemptive stochastic online scheduling on two uniform machines (Q976122): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling with Random Service Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors / 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: Approximation in stochastic scheduling / 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: A note on time-sharing / 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: Scheduling for Minimum Total Loss Using Service Time Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation in Preemptive Stochastic Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank

Revision as of 21:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Preemptive stochastic online scheduling on two uniform machines
scientific article

    Statements

    Identifiers