Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308): Difference between revisions
From MaRDI portal
Latest revision as of 13:10, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem |
scientific article |
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