WAOA
2010
Springer
13 years 10 months ago
2010
Springer
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 ...
WAOA
2004
Springer
14 years 5 months ago
2004
Springer
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 ...