Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088)
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 1314774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classical and new heuristics for the open-shop problem: A computational evaluation |
scientific article; zbMATH DE number 1314774 |
Statements
Classical and new heuristics for the open-shop problem: A computational evaluation (English)
0 references
13 September 2000
0 references
local search
0 references
minimum makespan schedules
0 references
open-shop
0 references
heuristics
0 references
matchings
0 references
bipartite graph
0 references
0.876048743724823
0 references
0.8607462644577026
0 references
0.8192604184150696
0 references
0.8138400316238403
0 references
