The expected asymptotical ratio for preemptive stochastic online problem

DOI10.1016/j.tcs.2013.05.035zbMath1295.90013OpenAlexW2059588513MaRDI QIDQ391147

Manzhan Gu, Xi-wen Lu

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.035

zbMATH Keywords

schedulingonline algorithmuniform machinesasymptotical optimality

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (2)

An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan ⋮ Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
• Preemptive stochastic online scheduling on two uniform machines
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• Single Machine Scheduling with Release Dates
• Scheduling for Minimum Total Loss Using Service Time Distributions
• Stochastic scheduling problems I — General strategies
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• On the Expected Relative Performance of List Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the asymptotic optimality of algorithms for the flow shop problem with release dates
• STACS 2004
• 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
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• A new average case analysis for completion time scheduling
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates

This page was built for publication: The expected asymptotical ratio for preemptive stochastic online problem