A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835)
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 approach for a single-machine batching problem using an efficient method to calculate a best neighbour |
scientific article; zbMATH DE number 1216801
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour |
scientific article; zbMATH DE number 1216801 |
Statements
A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (English)
0 references
1 November 1998
0 references
batching
0 references
local search
0 references
neighbourhoods
0 references
shortest path problem
0 references
tabu search
0 references
single-machine batching
0 references
