Makespan minimization subject to flowtime optimality on identical parallel machines.
Chien-Hung LinChing-Jong LiaoPublished in: Comput. Oper. Res. (2004)
Keyphrases
- scheduling problem
- identical parallel machines
- processing times
- flowshop
- single machine
- parallel machines
- strongly np hard
- release dates
- job shop scheduling problem
- setup times
- np hard
- precedence constraints
- tabu search
- optimal solution
- fixed number
- sequence dependent setup times
- single machine scheduling problem
- search algorithm
- total cost
- approximation algorithms
- evolutionary algorithm