Minimizing the weighted sum of completion times under processing time uncertainty.
Zacharie AlèsThi Sang NguyenMichael PossPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- sum of completion times
- scheduling problem
- completion times
- lower bound
- single machine
- processing times
- single machine scheduling problem
- np hard
- weighted sum
- upper bound
- tabu search
- uncertain data
- flowshop
- precedence constraints
- branch and bound
- branch and bound algorithm
- parallel machines
- special case
- objective function