A note on minimizing the sum of squares of machine completion times on two identical parallel machines.
Rico WalterPublished in: Central Eur. J. Oper. Res. (2017)
Keyphrases
- completion times
- identical parallel machines
- scheduling problem
- processing times
- single machine
- flowshop
- absolute deviation
- weighted sum
- single machine scheduling problem
- scheduling jobs
- competitive ratio
- release dates
- queue length
- sequence dependent setup times
- setup times
- strongly np hard
- objective function
- special case
- combinatorial optimization
- linear combination
- state space
- dynamic programming
- np hard
- optimal solution