On the complexity of scheduling unrelated parallel machines with limited preemptions.
Jan Karel LenstraNodari VakhaniaPublished in: Oper. Res. Lett. (2023)
Keyphrases
- unrelated parallel machines
- scheduling problem
- parallel machines
- setup times
- release dates
- open shop
- single machine
- flowshop
- scheduling jobs
- scheduling algorithm
- identical parallel machines
- job shop
- processing times
- precedence constraints
- np hard
- multi item
- approximation algorithms
- tabu search
- worst case
- job shop scheduling
- single server
- job shop scheduling problem