Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308)
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 5023555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem |
scientific article; zbMATH DE number 5023555 |
Statements
Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (English)
0 references
16 May 2006
0 references
Tabu search
0 references
Metaheuristics
0 references
Job-shop scheduling
0 references
Empirical analysis
0 references
0 references
0 references
0.8162100911140442
0 references
0.8127006888389587
0 references
