A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules.
Pasquale LegatoRoberto TrunfioPublished in: 4OR (2014)
Keyphrases
- scheduling problem
- np hard
- dynamic programming
- detection algorithm
- theoretical analysis
- experimental evaluation
- learning algorithm
- optimization algorithm
- segmentation algorithm
- linear programming
- computational cost
- cost function
- preprocessing
- computational complexity
- probabilistic model
- high accuracy
- objective function
- times faster
- recognition algorithm
- worst case
- k means
- neural network
- clustering method
- ant colony optimization
- tree structure