Single machine scheduling to minimize the number of late jobs under uncertainty. (Q1413868)
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: Single machine scheduling to minimize the number of late jobs under uncertainty. |
scientific article; zbMATH DE number 2005409
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling to minimize the number of late jobs under uncertainty. |
scientific article; zbMATH DE number 2005409 |
Statements
Single machine scheduling to minimize the number of late jobs under uncertainty. (English)
0 references
17 November 2003
0 references
Combinatorial problems
0 references
Scheduling
0 references
Single machine
0 references
Number of late jobs
0 references
0.9419138
0 references
0.93190974
0 references
0.92832786
0 references
0.91814625
0 references
0.9157271
0 references
0.9151133
0 references
