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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01435461 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014844773 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 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
