Preemptive stochastic online scheduling on two uniform machines

DOI10.1016/J.IPL.2008.12.008MaRDI QIDQ976122zbMATH OpenOpenAlexFDO

Authors Manzhan Gu, Xiwen 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

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

Recommendations

• Approximation in Preemptive Stochastic Online Scheduling
• The expected asymptotical ratio for preemptive stochastic online problem
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
• Online scheduling of two uniform machines to minimize total completion times
• A tight 2-approximation for preemptive stochastic scheduling

Cites work

• A note on time sharing with preferred customers
• A note on time-sharing
• Approximation in Preemptive Stochastic Online Scheduling
• Approximation in stochastic scheduling
• Models and Algorithms for Stochastic Online Scheduling
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling for Minimum Total Loss Using Service Time Distributions
• Scheduling with Random Service Times
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Cited in

(9)

• The expected asymptotical ratio for preemptive stochastic online problem
• scientific article; zbMATH DE number 1305421 (Why is no real title available?)
• Approximation in Preemptive Stochastic Online Scheduling
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
• Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
• Preemptive on-line scheduling for two uniform processors
• A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
• Randomized on-line scheduling on two uniform machines
• Optimal preemptive semi-online scheduling on two uniform processors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976122)