Exact methods for the Oven Scheduling Problem.
Marie-Louise LacknerChristoph MrkvickaNysret MusliuDaniel WalkiewiczFelix WinterPublished in: Constraints An Int. J. (2023)
Keyphrases
- scheduling problem
- exact methods
- np hard
- integer programming
- lower bound
- optimal solution
- flowshop
- single machine
- branch and bound algorithm
- tabu search
- approximation algorithms
- np complete
- heuristic methods
- exact algorithms
- special case
- knapsack problem
- parallel machines
- decision problems
- minimizing makespan
- worst case
- linear program
- computational complexity
- vehicle routing problem
- times faster
- upper bound
- constraint satisfaction problems
- exact solution
- approximate solutions
- partially observable markov decision processes
- search algorithm