Stochastically maximizing the number of successes in a sequential assignment problem (Q5752308): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/3214654 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2334336249 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:26, 19 March 2024
scientific article; zbMATH DE number 4187493
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastically maximizing the number of successes in a sequential assignment problem |
scientific article; zbMATH DE number 4187493 |
Statements
Stochastically maximizing the number of successes in a sequential assignment problem (English)
0 references
1990
0 references
stochastic dynamic programming
0 references
sequential stochastic assignment
0 references
multiprocessor scheduling
0 references
independent random deadlines for job completions
0 references
threshold policy
0 references
