Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms.
Ling WangQuan-Ke PanMehmet Fatih TasgetirenPublished in: Expert Syst. Appl. (2010)
Keyphrases
- completion times
- flowshop
- search algorithm
- scheduling problem
- tabu search
- single machine
- processing times
- special case
- open shop
- weighted sum
- job processing times
- flowshop scheduling problems
- single machine scheduling problem
- flowshop scheduling
- setup times
- lot streaming
- sequence dependent setup times
- minimizing makespan
- maximum lateness
- job shop
- asymptotic optimality
- queue length
- branch and bound
- parallel machines
- record linkage
- manufacturing cell
- makespan minimization
- unrelated parallel machines