Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905)
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: Local search for multiprocessor scheduling: how many moves does it take to a local optimum? |
scientific article; zbMATH DE number 2005440
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search for multiprocessor scheduling: how many moves does it take to a local optimum? |
scientific article; zbMATH DE number 2005440 |
Statements
Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (English)
0 references
17 November 2003
0 references
job interchange algorithm
0 references
