A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611)
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: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems |
scientific article; zbMATH DE number 2146086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems |
scientific article; zbMATH DE number 2146086 |
Statements
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (English)
0 references
15 March 2005
0 references
production/scheduling
0 references
approximations/heuristic: multi-exchange neighborhood
0 references
networks/graphs
0 references
flow algorithms: disjoint cycle computation
0 references
0.9184928
0 references
0.89726025
0 references
0.8928118
0 references
0.8920575
0 references
0.8911254
0 references
0.88571966
0 references
0.87902445
0 references
0.8785214
0 references
0.8779529
0 references
