Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness |
| |
| Authors: | Matthias Bücker Klaus Neumann Thomas Rubach |
| |
| Institution: | (1) Grißheimer Str. 13, 79426 Buggingen, Germany;(2) Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, Kaiserstr. 12, 76128 Karlsruhe, Germany;(3) Kurfürstenstr. 36, 82110 Germering, Germany |
| |
| Abstract: | Stochastic single-machine scheduling problems with special tree-like GERT precedence constraints and expected weighted flow time or maximum expected lateness as objective functions are considered. To obtain polynomial algorithms for these problems, Smith's ratio rule and Lawler's rule for the deterministic problems 1¦outtree¦ w
v
C
v
and 1¦prec¦f
max
, respectively, are generalized. |
| |
| Keywords: | Stochastic single-machine scheduling GERT networks |
| 本文献已被 SpringerLink 等数据库收录！ |
|
