Developing a lower bound and strong heuristics for a truck scheduling problem in a cross-docking center.
Amir Golshahi-RoudbanehMostafa Hajiaghaei-KeshteliMohammad Mahdi PaydarPublished in: Knowl. Based Syst. (2017)
Keyphrases
- scheduling problem
- lower bound
- dominance rules
- np hard
- upper bound
- greedy heuristics
- branch and bound algorithm
- single machine
- list scheduling
- set of randomly generated instances
- maximum lateness
- branch and bound
- tabu search
- flowshop
- precedence constraints
- strongly np hard
- parallel machines
- heuristic solution
- running times
- objective function
- permutation flowshop
- setup times
- lower and upper bounds
- vehicle routing problem
- randomly generated test problems
- optimal solution
- worst case
- search algorithm
- finding optimal solutions
- job shop scheduling problem
- genetic algorithm
- truck scheduling
- polynomial approximation
- worst case analysis
- release dates
- linear programming relaxation
- heuristic methods
- linear programming
- data structure