A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection.
Baruch MorGur MosheiovPublished in: Ann. Oper. Res. (2018)
Keyphrases
- completion times
- absolute deviation
- processing times
- flowshop
- scheduling problem
- single machine
- polynomially solvable
- single machine scheduling problem
- identical machines
- special case
- release times
- identical parallel machines
- weighted sum
- setup times
- scheduling jobs
- release dates
- competitive ratio
- parallel machines
- np hard
- worst case performance ratio
- queue length
- precedence constraints
- tabu search
- combinatorial optimization
- scheduling decisions
- dynamic programming
- evolutionary algorithm