Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893)
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: Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty |
scientific article; zbMATH DE number 6636225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty |
scientific article; zbMATH DE number 6636225 |
Statements
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (English)
0 references
7 October 2016
0 references
scheduling
0 references
uncertainty
0 references
outsourcing
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8908389210700989
0 references
0.8182064294815063
0 references
0.8167974948883057
0 references
0.8097211122512817
0 references
