Nonpreemptive open shop with restricted processing times.
Ondrej CepekMilan VlachDominique de WerraPublished in: Math. Methods Oper. Res. (1994)
Keyphrases
- completion times
- open shop
- processing times
- single machine
- scheduling problem
- single machine scheduling problem
- unrelated parallel machines
- flowshop
- job shop
- polynomially solvable
- scheduling jobs
- weighted sum
- setup times
- dynamic programming
- np hard
- job shop scheduling problem
- special case
- precedence constraints
- neural network
- objective function
- evolutionary algorithm
- upper bound
- parallel machines
- approximation algorithms
- quality of service