The following publications are possibly variants of this publication:
- A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problemLing Wang, Quan-ke Pan, Mehmet Fatih Tasgetiren. candie, 61(1):76-83, 2011. [doi]
- Scheduling the blocking flow shop problem using a harmony search algorithmJun-Hua Duan, Quan-ke Pan, Junqing Li, KaiZhuo Gao, Zhenqiang Bao. icnc 2010: 4258-4262 [doi]
- Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithmsLing Wang, Quan-ke Pan, Mehmet Fatih Tasgetiren. eswa, 37(12):7929-7936, 2010. [doi]
- Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithmQuan-ke Pan, Mehmet Fatih Tasgetiren, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang. cec 2010: 1-6 [doi]
- A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problemQuan-ke Pan, Ponnuthurai N. Suganthan, Jing J. Liang, Mehmet Fatih Tasgetiren. eswa, 38(4):3252-3259, 2011. [doi]
- A Multi-objective Hybrid Discrete Harmony Search Algorithm for Lot-Streaming Flow Shop Scheduling ProblemHong-Yan Han. icic 2012: 66-73 [doi]
- A Hybrid Harmony Search Algorithm for the no-Wait Flow-shop Scheduling ProblemsKaizhou Gao, Quan-ke Pan, Junqing Li, YuTing Wang, Jing Liang. apjor, 29(2), 2012. [doi]