Minimizing makespan subject to minimum flowtime on two identical parallel machines.
Jatinder N. D. GuptaJohnny C. HoPublished in: Comput. Oper. Res. (2001)
Keyphrases
- scheduling problem
- minimizing makespan
- identical parallel machines
- flowshop
- processing times
- single machine
- strongly np hard
- np hard
- parallel machines
- setup times
- precedence constraints
- release dates
- tabu search
- permutation flowshop
- competitive ratio
- flowshop scheduling
- completion times
- knapsack problem
- dynamic programming
- lower bound