A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501)
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 local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules |
scientific article; zbMATH DE number 6345815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules |
scientific article; zbMATH DE number 6345815 |
Statements
A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (English)
0 references
18 September 2014
0 references
scheduling
0 references
local branching
0 references
branch\&bound
0 references
unidirectional schedules
0 references
0 references
0 references
0 references
0.9054765
0 references
0.90263706
0 references
0 references
0.8938713
0 references
0.89031124
0 references
0.8850828
0 references
0.8805739
0 references
0.8760428
0 references
