A note on minimizing the sum of quadratic completion times on two identical parallel machines.
Federico Della CroceChristos KoulamasPublished in: Inf. Process. Lett. (2012)
Keyphrases
- completion times
- identical parallel machines
- scheduling problem
- processing times
- single machine
- weighted sum
- absolute deviation
- single machine scheduling problem
- competitive ratio
- scheduling jobs
- flowshop
- objective function
- release dates
- np hard
- strongly np hard
- setup times
- queue length
- computational complexity
- resource consumption
- tabu search
- response time