Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines

DOI10.1007/s10479-011-0985-1zbMath1233.90182OpenAlexW1996008776MaRDI QIDQ763104

Manzhan Gu, Xi-wen Lu

Publication date: 9 March 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0985-1

zbMATH Keywords

schedulingonline algorithmuniform machinesasymptotical optimality

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (6)

Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine ⋮ Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ 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 ⋮ Randomized selection algorithm for online stochastic unrelated machines scheduling

Cites Work

• Unnamed Item
• LP-based online scheduling: From single to parallel machines
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• Single Machine Scheduling with Release Dates
• Approximation in stochastic scheduling
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• On the asymptotic optimality of algorithms for the flow shop problem with release dates
• Stochastic Machine Scheduling with Precedence Constraints
• Models and Algorithms for Stochastic Online Scheduling

This page was built for publication: Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines