Sciweavers

6 search results - page 1 / 2
» Minimizing weighted tardiness of jobs with stochastic interr...
Sort
View
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
13 years 10 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
WAOA
2010
Springer
237views Algorithms» more  WAOA 2010»
13 years 3 months ago
Lower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
AAAI
1998
13 years 6 months ago
Multi Machine Scheduling: An Agent-Based Approach
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
Rama Akkiraju, Pinar Keskinocak, Sesh Murthy, Fred...
COCOA
2008
Springer
13 years 7 months ago
Stochastic Online Scheduling Revisited
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...
Andreas S. Schulz