Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness (Q4300605): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:33, 6 February 2024
scientific article; zbMATH DE number 614187
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness |
scientific article; zbMATH DE number 614187 |
Statements
Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness (English)
0 references
15 August 1994
0 references
stochastic single-machine scheduling
0 references
tree-like GERT precedence constraints
0 references
expected weighted flow time
0 references
maximum expected lateness
0 references
polynomial algorithms
0 references
