Approximability of total weighted completion time with resource consuming jobs.
Tamás KisPublished in: Oper. Res. Lett. (2015)
Keyphrases
- processing times
- parallel machines
- identical parallel machines
- release times
- single machine
- scheduling problem
- release dates
- parallel machine scheduling problem
- maximum lateness
- identical machines
- single machine scheduling problem
- scheduling jobs
- fixed number
- flowshop
- polynomial time approximation
- precedence constraints
- total weighted tardiness
- approximation algorithms
- sequence dependent setup times
- completion times
- strongly np hard
- setup times
- learning effect
- competitive ratio
- single server
- special case
- np hard