Minimizing makespan subject to minimum total flow-time on identical parallel machines.
Jatinder N. D. GuptaAlex J. Ruiz-TorresPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- minimizing makespan
- scheduling problem
- identical parallel machines
- processing times
- parallel machines
- single machine
- flowshop
- strongly np hard
- np hard
- tabu search
- precedence constraints
- setup times
- fixed number
- release dates
- competitive ratio
- sequence dependent setup times
- reinforcement learning
- special case
- lower bound