A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284)
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 tabu search algorithm with a new neighborhood structure for the job shop scheduling problem |
scientific article; zbMATH DE number 5161103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem |
scientific article; zbMATH DE number 5161103 |
Statements
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (English)
0 references
4 June 2007
0 references
job shop scheduling problem
0 references
makespan
0 references
heuristic
0 references
tabu search
0 references
0.8791945576667786
0 references
0.8423285484313965
0 references
0.842220664024353
0 references
0.8418095707893372
0 references
0.8351227641105652
0 references
