Preemptive stochastic online scheduling on two uniform machines

DOI10.1016/J.IPL.2008.12.008zbMath1191.68100OpenAlexW1981046127MaRDI QIDQ976122

Manzhan Gu, Xi-wen Lu

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.008

zbMATH Keywords

analysis of algorithmsstochastic schedulinguniform machinepreemptiveonline policy

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

The expected asymptotical ratio for preemptive stochastic online problem ⋮ A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem

Cites Work

• Approximation in stochastic scheduling
• Scheduling for Minimum Total Loss Using Service Time Distributions
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Models and Algorithms for Stochastic Online Scheduling
• Approximation in Preemptive Stochastic Online Scheduling
• A note on time sharing with preferred customers
• A note on time-sharing
• Scheduling with Random Service Times

This page was built for publication: Preemptive stochastic online scheduling on two uniform machines