A scheduling problem with job values given as a power function of their completion times.
Adam JaniakTomasz KrysiakCostas P. PappisTheodore G. VoutsinasPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- completion times
- scheduling problem
- single machine
- flowshop
- processing times
- single machine scheduling problem
- sum of completion times
- weighted sum
- absolute deviation
- release times
- open shop
- setup times
- tabu search
- release dates
- unrelated parallel machines
- np hard
- competitive ratio
- sequence dependent setup times
- job shop
- scheduling jobs
- job shop scheduling problem
- parallel machines
- identical parallel machines
- optimization problems
- asymptotic optimality
- special case
- queue length
- precedence constraints
- genetic algorithm