Towards Tight Lower Bounds for Scheduling Problems.
Abbas BazziAshkan Norouzi-FardPublished in: CoRR (2015)
Keyphrases
- lower bound
- scheduling problem
- np hard
- upper bound
- search algorithm for solving
- single machine
- branch and bound
- branch and bound algorithm
- worst case
- flowshop
- processing times
- lower and upper bounds
- job shop
- setup times
- greedy heuristics
- job shop scheduling problem
- objective function
- approximation algorithms
- np complete
- upper and lower bounds
- optimal solution
- randomly generated test problems
- job shop scheduling
- tabu search
- optimal cost
- lower bounding
- sequencing problems
- randomly generated problems
- precedence constraints
- strongly np hard
- sample complexity
- parallel machines
- learning theory
- linear programming relaxation
- lagrangian relaxation
- maximum lateness
- genetic algorithm
- column generation
- knapsack problem
- linear programming
- set of randomly generated instances