Completing Partial Schedules for Open Shop with Unit Processing Times and Routing.
René van BevernArtem V. PyatkinPublished in: CSR (2016)
Keyphrases
- processing times
- open shop
- scheduling problem
- job shop
- flowshop
- completion times
- single machine
- parallel machines
- polynomially solvable
- job shop scheduling
- setup times
- np hard
- tabu search
- single machine scheduling problem
- approximation algorithms
- precedence constraints
- job shop scheduling problem
- scheduling jobs
- routing algorithm
- routing problem
- scheduling decisions
- routing protocol
- resource consumption
- shortest path
- computational complexity