Exact methods and lower bounds for the Oven Scheduling Problem.
Marie-Louise LacknerChristoph MrkvickaNysret MusliuDaniel WalkiewiczFelix WinterPublished in: CoRR (2022)
Keyphrases
- exact methods
- scheduling problem
- lower bound
- np hard
- branch and bound algorithm
- upper bound
- single machine
- optimal solution
- integer programming
- setup times
- flowshop
- linear programming
- approximation algorithms
- worst case
- branch and bound
- strongly np hard
- np complete
- lagrangian relaxation
- objective function
- tabu search
- special case
- exact solution
- knapsack problem
- linear program
- decision problems
- constraint satisfaction problems
- supply chain
- column generation
- lower and upper bounds
- exact algorithms
- computational complexity