Minimizing the number of tardy jobs with stochastically-ordered processing times (Q835573)
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 tardy jobs with stochastically-ordered processing times |
scientific article; zbMATH DE number 5599838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of tardy jobs with stochastically-ordered processing times |
scientific article; zbMATH DE number 5599838 |
Statements
Minimizing the number of tardy jobs with stochastically-ordered processing times (English)
0 references
28 August 2009
0 references
sequencing
0 references
stochastic scheduling
0 references
polynomial algorithm
0 references
0 references
0 references
0 references
0.8967242240905762
0 references
0.857768177986145
0 references
0.8387049436569214
0 references
0.8338358402252197
0 references
0.8324992060661316
0 references
