Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

COCOA
2008
Springer

favoriteEmaildiscussreport

133views Discrete Geometry» more COCOA 2008»

Stochastic Online Scheduling Revisited

13 years 6 months ago

Stochastic Online Scheduling Revisited

Download web.mit.edu

We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give randomized as well as deterministic online and off-line algorithms that have the best known performance guarantees in either setting, deterministic and offline or randomized and online. Our analysis is based on a novel linear programming relaxation for stochastic scheduling problems, which can be solved online.

Andreas S. Schulz

Real-time Traffic

COCOA 2008 | Discrete Geometry | Identical Parallel Machines | Stochastic Processing Times | Total Weighted Completion |

claim paper

Related Content

» Stochastic Online Scheduling on Parallel Machines

» Gap Reduction Techniques for Online Stochastic Project Scheduling

» Approximation in Preemptive Stochastic Online Scheduling

» Coping with Incomplete Information in Scheduling Stochastic and Online Models

» Models and Algorithms for Stochastic Online Scheduling

» StructureAware Stochastic Control for Transmission Scheduling

» A stochastic programming approach to scheduling in TAC SCM

» A Stochastic Framework for Scheduling in Wireless Packet Access Networks

» Regrets Only Online Stochastic Optimization under Time Constraints

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	COCOA
Authors	Andreas S. Schulz

Comments (0)