A new LP-based lower bound for the cumulative scheduling problem.
Jacques CarlierEmmanuel NéronPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- lower bound
- scheduling problem
- np hard
- linear programming
- upper bound
- optimal solution
- linear program
- branch and bound algorithm
- single machine
- flowshop
- linear programming relaxation
- objective function
- branch and bound
- approximation algorithms
- tabu search
- randomly generated test problems
- integer programming
- setup times
- worst case
- processing times
- lower and upper bounds
- minimum cost
- total tardiness
- permutation flowshop
- integrality gap
- strongly np hard
- precedence constraints
- special case
- lagrangian relaxation
- column generation
- primal dual
- minimizing makespan
- constraint satisfaction problems
- mixed integer
- lower bounding
- constant factor
- sample complexity
- polynomial approximation
- knapsack problem