Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty (Q5501010)
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: Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty |
scientific article; zbMATH DE number 6472024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty |
scientific article; zbMATH DE number 6472024 |
Statements
10 August 2015
0 references
task scheduling
0 references
interval uncertainty
0 references
min-max regret
0 references
branch and bound
0 references
0.8778179287910461
0 references
0.7978697419166565
0 references
0.7836490869522095
0 references
0.7812386155128479
0 references
0.7811555862426758
0 references
