Minimizing the number of late jobs in a stochastic setting using a chance constraint (Q835575)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing the number of late jobs in a stochastic setting using a chance constraint |
scientific article; zbMATH DE number 5599839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of late jobs in a stochastic setting using a chance constraint |
scientific article; zbMATH DE number 5599839 |
Statements
Minimizing the number of late jobs in a stochastic setting using a chance constraint (English)
0 references
28 August 2009
0 references
scheduling
0 references
sequencing
0 references
single machine
0 references
number of late jobs
0 references
stochastic processing times
0 references
Minimum success probability
0 references
Chance constraint
0 references
Dynamic programming
0 references
NP-hardness
0 references
0 references
0 references
0.8429390788078308
0 references
0.8324992060661316
0 references
0.8321101665496826
0 references
0.8267945051193237
0 references
0.8243243098258972
0 references
