Some complexity results and an efficient algorithm for quay crane scheduling problem.
Ming LiuShijin WangFeng ChuYinfeng XuPublished in: Discret. Math. Algorithms Appl. (2016)
Keyphrases
- np hard
- scheduling problem
- computational complexity
- worst case
- computationally efficient
- learning algorithm
- improved algorithm
- preprocessing
- computational cost
- optimal solution
- matching algorithm
- theoretical analysis
- linear complexity
- high computational complexity
- expectation maximization
- dynamic programming
- cost function
- experimental evaluation
- objective function
- complexity analysis
- search space
- segmentation algorithm
- high accuracy
- significant improvement
- linear programming
- optimization algorithm
- clustering method
- k means
- simulated annealing
- job shop scheduling problem
- mobile robot
- bayesian networks