Two-machine open shop problem with controllable processing times.
T. C. Edwin ChengNatalia V. ShakhlevichPublished in: Discret. Optim. (2007)
Keyphrases
- open shop
- flowshop
- single machine
- completion times
- scheduling problem
- parallel machines
- job shop
- unrelated parallel machines
- approximation algorithms
- processing times
- np hard
- tabu search
- job shop scheduling problem
- special case
- single machine scheduling problem
- multistage
- shared memory
- low cost
- precedence constraints
- dynamic programming
- evolutionary algorithm