An exact solution with an improved running time for the routing flow shop problem with two machines.
Ilya ChernykhAlexander V. KononovSergey SevastyanovPublished in: J. Sched. (2024)
Keyphrases
- flowshop
- exact solution
- scheduling problem
- special case
- lower bound
- flowshop scheduling
- processing times
- column generation
- maximum lateness
- exact algorithms
- asymptotic optimality
- sequence dependent setup times
- setup times
- tabu search
- approximate solutions
- minimizing makespan
- parallel machines
- optimal solution
- flowshop scheduling problems
- single machine
- open shop
- routing problem
- job shop
- upper bound
- np hard
- precedence constraints
- linear program
- metaheuristic
- strongly np hard
- shortest path
- linear programming
- optimization problems
- lot streaming