A note on the total completion time problem in a permutation flowshop with a learning effect.
Chin-Chia WuWen-Chiung LeePublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- learning effect
- permutation flowshop
- scheduling problem
- single machine
- release times
- learning curve
- processing times
- upper bound
- flowshop
- tabu search
- strongly np hard
- release dates
- np hard
- precedence constraints
- single machine scheduling problem
- learning companion
- setup times
- sequence dependent setup times
- greedy algorithm
- minimizing makespan
- special case
- metaheuristic