AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM (Q3944341)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 3761776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM |
scientific article; zbMATH DE number 3761776 |
Statements
AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM (English)
0 references
1982
0 references
efficient algorithm
0 references
chance-constrained scheduling problem
0 references
n-job one machine scheduling
0 references
random processing times
0 references
NP-completeness
0 references
polynomial algorithm
0 references
