New exact methods for the time-invariant berth allocation and quay crane assignment problem.
Juan Francisco CorrecherRamón Alvarez-ValdésJosé Manuel TamaritPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- quay crane
- np hard
- scheduling problem
- exact methods
- container terminal
- parallel genetic algorithm
- integer programming
- lower bound
- quay cranes
- np complete
- approximation algorithms
- branch and bound algorithm
- special case
- optimal solution
- tabu search
- computational complexity
- constraint satisfaction problems
- linear programming
- decision problems
- knapsack problem
- worst case
- linear program
- vehicle routing problem
- randomly generated
- approximate solutions
- exact algorithms
- machine learning
- objective function