Robust absolute single machine makespan scheduling-location problem on trees (Q2294524)
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 7165979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust absolute single machine makespan scheduling-location problem on trees |
scientific article; zbMATH DE number 7165979 |
Statements
Robust absolute single machine makespan scheduling-location problem on trees (English)
0 references
11 February 2020
0 references
scheduling problem
0 references
location problem
0 references
center problem
0 references
robustness
0 references
tree
0 references
uncertainty
0 references
0 references
0.8454485535621643
0 references
0.8385995626449585
0 references
0.8185611367225647
0 references
0.80489581823349
0 references
0.7963843941688538
0 references
