Preemptive and non-preemptive scheduling on two unrelated parallel machines.
Alan J. SoperVitaly A. StrusevichPublished in: J. Sched. (2022)
Keyphrases
- unrelated parallel machines
- preemptive scheduling
- scheduling problem
- single machine
- parallel machines
- setup times
- flowshop
- processing times
- np hard
- precedence constraints
- scheduling jobs
- total tardiness
- tabu search
- job shop scheduling
- job shop
- sequence dependent setup times
- competitive ratio
- job shop scheduling problem
- distributed systems