A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints.
Noura Al-DhaheriAli H. DiabatPublished in: Ann. Oper. Res. (2017)
Keyphrases
- quay crane
- scheduling problem
- lagrangian relaxation
- np hard
- setup times
- randomly generated test problems
- total weighted tardiness
- mixed integer program
- lower and upper bounds
- feasible solution
- capacity constraints
- tabu search
- parallel genetic algorithm
- single machine
- precedence constraints
- integer programming
- lower bound
- container terminal
- dominance rules
- branch and bound algorithm
- dual variables
- column generation
- dynamic programming
- sequence dependent setup times
- single machine scheduling problem
- flowshop
- parallel machines
- mixed integer programming
- valid inequalities
- linear programming
- upper bound
- np complete
- dual decomposition
- special case
- objective function
- lagrangian heuristic
- constrained optimization
- relaxation algorithm
- job shop scheduling problem
- network design problem
- neural network
- knapsack problem
- simulated annealing
- set covering problem
- multidimensional knapsack problem
- release dates
- branch and bound
- mathematical model
- subgradient method
- shortest path
- genetic algorithm