Performance guarantees of local search for minsum scheduling problems (Q2118098)
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: Performance guarantees of local search for minsum scheduling problems |
scientific article; zbMATH DE number 7495403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance guarantees of local search for minsum scheduling problems |
scientific article; zbMATH DE number 7495403 |
Statements
Performance guarantees of local search for minsum scheduling problems (English)
0 references
22 March 2022
0 references
local search
0 references
performance guarantee
0 references
parallel machines
0 references
total weighted completion time
0 references
0 references
0 references
0 references
0 references
0.8921685218811035
0 references
0.8756958842277527
0 references
0.8665943741798401
0 references
0.8389790058135986
0 references
