Reducing mean flow time in permutation flow shop.
Marcelo Seido NaganoJ. V. MoccellinPublished in: J. Oper. Res. Soc. (2008)
Keyphrases
- flowshop
- scheduling problem
- flowshop scheduling problems
- flowshop scheduling
- lot streaming
- special case
- asymptotic optimality
- tabu search
- processing times
- maximum lateness
- open shop
- setup times
- single machine
- sequence dependent setup times
- job shop
- minimizing makespan
- np hard
- unrelated parallel machines
- permutation flowshop
- harmony search algorithm
- completion times
- asymptotically optimal