Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134)
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 7205747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing maximum cost for a single machine under uncertainty of processing times |
scientific article; zbMATH DE number 7205747 |
Statements
Minimizing maximum cost for a single machine under uncertainty of processing times (English)
0 references
27 May 2020
0 references
scheduling
0 references
min-max cost scheduling problem
0 references
Lawler's algorithm
0 references
uncertainty
0 references
maximum regret
0 references
0 references
0 references
0 references
0 references
0.8801255226135254
0 references
0.8390636444091797
0 references
0.8223371505737305
0 references
0.8182064294815063
0 references
