Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times.
Leah EpsteinIdo YatsivPublished in: J. Sched. (2017)
Keyphrases
- completion times
- flowshop
- scheduling problem
- single machine
- preemptive scheduling
- single machine scheduling problem
- processing times
- absolute deviation
- weighted sum
- release times
- identical machines
- queue length
- setup times
- identical parallel machines
- sum of completion times
- total tardiness
- competitive ratio
- resource consumption
- special case
- np hard
- release dates
- parallel machines
- sequence dependent setup times
- steady state