Minimizing the sum of job completion times on capacitated two-parallel machines.
Ching-Jong LiaoChien-Wen ChaoChien-Hung LinPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- completion times
- parallel machines
- scheduling problem
- unrelated parallel machines
- np hard
- flowshop
- single machine
- absolute deviation
- processing times
- precedence constraints
- single machine scheduling problem
- open shop
- sequence dependent setup times
- lot sizing
- release times
- setup times
- release dates
- weighted sum
- scheduling jobs
- special case
- tabu search
- approximation algorithms
- multi item
- identical parallel machines
- competitive ratio
- single server
- optimal solution
- linear programming
- queue length
- parallel computing
- lower bound