Two-Machine Routing Open Shop: How Long Is the Optimal Makespan?
Ilya ChernykhPublished in: MOTOR (2021)
Keyphrases
- open shop
- flowshop
- job shop
- unrelated parallel machines
- approximation algorithms
- scheduling problem
- parallel machines
- strongly np hard
- completion times
- worst case
- batch processing
- job shop scheduling
- multistage
- processing times
- optimal solution
- setup times
- tabu search
- job shop scheduling problem
- single machine
- np hard
- production scheduling
- weighted sum
- routing problem
- minimum cost
- shortest path
- optimization problems
- dynamic programming
- special case