Models and Algorithms for Stochastic Online Scheduling
From MaRDI portal
Publication:5387994
DOI10.1287/moor.1060.0201zbMath1278.90182OpenAlexW2118328307WikidataQ57399776 ScholiaQ57399776MaRDI QIDQ5387994
Marc Uetz, Nicole Megow, Tjark Vredeveld
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2005/110/
schedulingapproximationonline optimizationtotal weighted completion timestochastic dynamic optimization
Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)
Related Items (33)
Online Appointment Scheduling in the Random Order Model ⋮ Unnamed Item ⋮ Dynamic resource allocation to improve emergency department efficiency in real time ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ Scheduling with compressible and stochastic release dates ⋮ Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ Real time stochastic scheduling in broadcast systems with decentralized data storage ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ Dynamic fleet scheduling with uncertain demand and customer flexibility ⋮ Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems ⋮ Improved bounds for stochastic extensible bin packing under distributional assumptions ⋮ Dynamic surgery management under uncertainty ⋮ Average-case competitive analyses for one-way trading ⋮ Dynamic scheduling with uncertain job types ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ An adversarial model for scheduling with testing ⋮ Randomized mechanism design for decentralized network scheduling ⋮ Coping with Incomplete Information in Scheduling — Stochastic and Online Models ⋮ Online scheduling for outpatient services with heterogeneous patients and physicians ⋮ On robust online scheduling algorithms ⋮ Analysis of computer job control under uncertainty ⋮ Preemptive stochastic online scheduling on two uniform machines ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ On index policies for stochastic minsum scheduling ⋮ Multi-Priority Online Scheduling with Cancellations ⋮ A novel parallel quantum genetic algorithm for stochastic job shop scheduling ⋮ Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines ⋮ Stochastic Load Balancing on Unrelated Machines ⋮ Randomized selection algorithm for online stochastic unrelated machines scheduling ⋮ A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ Stochastic Online Scheduling Revisited
This page was built for publication: Models and Algorithms for Stochastic Online Scheduling
