Parallel solutions for preemptive makespan scheduling on two identical machines.
Leah EpsteinPublished in: CoRR (2022)
Keyphrases
- competitive ratio
- identical machines
- processing times
- single machine
- scheduling problem
- scheduling jobs
- job scheduling
- release dates
- identical parallel machines
- single machine scheduling problem
- setup times
- flowshop
- maximum lateness
- completion times
- deteriorating jobs
- precedence constraints
- unrelated parallel machines
- batch processing machines
- optimal solution
- feasible solution
- tabu search
- np hard