Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399)
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: Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion |
scientific article; zbMATH DE number 5720369
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion |
scientific article; zbMATH DE number 5720369 |
Statements
Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (English)
0 references
11 June 2010
0 references
scheduling
0 references
no-wait flowshop
0 references
maximum lateness
0 references
tabu search
0 references
neighborhood
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9185282
0 references
0.9121398
0 references
0.8987665
0 references
0.88288134
0 references
0.87186897
0 references
0.87154543
0 references
0.8714716
0 references
0.87088525
0 references
0.86878043
0 references
