A branch and cut heuristic for a runway scheduling problem.
Igor L. VasilyevPasquale AvellaMaurizio BocciaPublished in: Autom. Remote. Control. (2016)
Keyphrases
- scheduling problem
- tabu search
- list scheduling
- single machine
- job shop scheduling problem
- unrelated parallel machines
- multi depot
- quay crane
- flowshop
- randomly generated test problems
- parallel machine scheduling problem
- np hard
- strongly np hard
- setup times
- processing times
- optimal solution
- parallel machines
- heuristic methods
- precedence constraints
- sequence dependent setup times
- minimizing makespan
- scheduling jobs
- search algorithm
- simulated annealing
- earliness tardiness
- permutation flowshop
- dynamic programming
- vehicle routing problem
- neural network
- constraint satisfaction
- total tardiness
- greedy algorithm
- search strategies
- container terminal
- beam search
- lagrangian relaxation
- search procedure