1. A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints. (1st September 2022) Authors: Qin, Hao-Xiang; Han, Yu-Yan; Liu, Yi-Ping; Li, Jun-Qing; Pan, Quan-Ke; Xue-Han, Journal: Expert systems with applications Issue: Volume 201(2022) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Issue 13 (3rd July 2021) Authors: Li, Yingli; Li, Xinyu; Gao, Liang; Zhang, Biao; Pan, Quan-Ke; Tasgetiren, M. Fatih; Meng, Leilei Journal: International journal of production research Issue: Volume 59:Issue 13(2021) Page Start: 3880 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations. Issue 16 (18th August 2018) Authors: Meng, Tao; Pan, Quan-Ke; Sang, Hong-Yan Journal: International journal of production research Issue: Volume 56:Issue 16(2018) Page Start: 5278 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. (27th March 2008) Authors: Pan, Quan-Ke; Wang, Ling Journal: European journal of industrial engineering Issue: Volume 2:Number 3 (2008) Page Start: 279 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem. (September 2021) Authors: Chen, Shuai; Pan, Quan-Ke; Gao, Liang; Sang, Hong-yan Journal: Engineering applications of artificial intelligence Issue: Volume 104(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop. (15th December 2020) Authors: Zou, Wen-Qiang; Pan, Quan-Ke; Meng, Tao; Gao, Liang; Wang, Yu-Long Journal: Expert systems with applications Issue: Volume 161(2020) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. An effective memetic algorithm for the distributed flowshop scheduling problem with an assemble machine. Issue 6 (19th March 2023) Authors: Huang, Ying-Ying; Pan, Quan-Ke; Gao, Liang Journal: International journal of production research Issue: Volume 61:Issue 6(2023) Page Start: 1755 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem. (July 2022) Authors: Tao, Xin-Rui; Pan, Quan-Ke; Gao, Liang Journal: Computers & industrial engineering Issue: Volume 169(2022) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. An energy-efficient permutation flowshop scheduling problem. (15th July 2020) Authors: Öztop, Hande; Tasgetiren, M. Fatih; Eliiyi, Deniz Türsel; Pan, Quan-Ke; Kandiller, Levent Journal: Expert systems with applications Issue: Volume 150(2020) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. An Improved Artificial Bee Colony algorithm for real-world hybrid flowshop rescheduling in Steelmaking-refining-Continuous Casting process. (August 2018) Authors: Peng, Kunkun; Pan, Quan-Ke; Gao, Liang; Zhang, Biao; Pang, Xinfu Journal: Computers & industrial engineering Issue: Volume 122(2018) Page Start: 235 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗