Completing partial schedules for Open Shop with unit processing times and routing.
René van BevernArtem V. PyatkinPublished in: CoRR (2016)
Keyphrases
- processing times
- scheduling problem
- open shop
- job shop
- flowshop
- completion times
- single machine
- parallel machines
- polynomially solvable
- setup times
- job shop scheduling
- tabu search
- scheduling decisions
- scheduling jobs
- np hard
- approximation algorithms
- single machine scheduling problem
- job shop scheduling problem
- resource consumption
- precedence constraints
- routing protocol
- routing problem
- response time
- routing algorithm
- linear programming
- shortest path