Towards Tight Lower Bounds for Scheduling Problems.
Abbas BazziAshkan Norouzi-FardPublished in: ESA (2015)
Keyphrases
- lower bound
- scheduling problem
- np hard
- upper bound
- search algorithm for solving
- single machine
- branch and bound algorithm
- worst case
- flowshop
- processing times
- objective function
- branch and bound
- job shop scheduling
- setup times
- optimal solution
- precedence constraints
- job shop
- upper and lower bounds
- job shop scheduling problem
- lower and upper bounds
- approximation algorithms
- np complete
- linear programming
- sequence dependent setup times
- tabu search
- randomly generated test problems
- lower bounding
- linear programming relaxation
- max sat
- greedy heuristics
- sequencing problems
- quadratic assignment problem
- optimal cost
- randomly generated problems
- list scheduling
- quay crane
- search algorithm
- parallel machines