Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971)
From MaRDI portal
!
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 7153636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times |
scientific article; zbMATH DE number 7153636 |
Statements
Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (English)
0 references
20 January 2020
0 references
robust optimization
0 references
uncertainty
0 references
scheduling
0 references
mixed integer programming
0 references
0 references
0 references
0 references
0.9346619844436646
0 references
0.9146421551704408
0 references
0.8469860553741455
0 references
0.8456223011016846
0 references
0.8364155292510986
0 references
