A tabu search heuristic for the quay crane scheduling problem (Q835567)
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 5599835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search heuristic for the quay crane scheduling problem |
scientific article; zbMATH DE number 5599835 |
Statements
A tabu search heuristic for the quay crane scheduling problem (English)
0 references
28 August 2009
0 references
container terminal
0 references
crane scheduling
0 references
disjunctive graph
0 references
tabu search
0 references
0 references
0 references
0.8671872615814209
0 references
0.8607858419418335
0 references
0.8532833456993103
0 references
0.8506342768669128
0 references
0.839901864528656
0 references
