A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing.
Antonina P. KhramovaIlya ChernykhPublished in: J. Sched. (2021)
Keyphrases
- scheduling problem
- cost function
- open shop
- flowshop
- optimal solution
- np hard
- search space
- dynamic programming
- job shop
- computational complexity
- worst case
- simulated annealing
- linear programming
- tabu search
- mathematical model
- benchmark problems
- approximation algorithms
- search algorithm
- graph model
- parallel machines
- single machine scheduling problem
- objective function