Solving the two-machine open shop problem with a single server with respect to the makespan.
Nadia BabouDjamal RebaineMourad BoudharPublished in: Ann. Oper. Res. (2024)
Keyphrases
- open shop
- parallel machines
- single server
- unrelated parallel machines
- scheduling problem
- flowshop
- strongly np hard
- setup times
- retrial queue
- approximation algorithms
- identical parallel machines
- sequence dependent setup times
- scheduling jobs
- job shop
- release dates
- precedence constraints
- special case
- parallel computing
- completion times
- queue length
- shared memory
- priority scheduling
- processing times
- multistage
- tabu search
- single machine
- job shop scheduling
- combinatorial optimization
- lot sizing