1.Discrete Jaya algorithm for solving flexible job shop rescheduling problem
Guo, J, Gao, KZ, Wan More...
2017 29TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC)[1948-9439], Published 2017, Pages 6010-6015
收錄情况： WOS SCOPUS
WOS核心合集引用: 6
2.A Speed-up Method for calculating total flowtime in permutation flow shop scheduling problem
Duan, JH, Yang, J, G More...
2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC)[1948-9439], Published 2013, Pages 2755-2758
收錄情况： WOS SCOPUS
WOS核心合集引用: 1
3.An effective discrete harmony search for solving bi-criteria FJSP
Li, JQ, Pan, QK, Xie More...
2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6[1948-9439], Published 2011, Pages 3625-3629
收錄情况： WOS SCOPUS
WOS核心合集引用: 3
4.A hybrid algorithm for multi-objective job shop scheduling problem
Li, JQ, Pan, QK, Xie More...
2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6[1948-9439], Published 2011, Pages 3630-3634
收錄情况： WOS SCOPUS
WOS核心合集引用: 4
5.Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop
Gao, KZ, Li, H, Pan, More...
2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5[1948-9439], Published 2010, Pages 1184-1188
收錄情况： WOS SCOPUS
WOS核心合集引用: 3
6.A Novel Discrete Harmony Search Algorithm for Scheduling Lot-streaming Flow Shops
Pan, QK, Duan, JH, L More...
2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5[1948-9439], Published 2010, Pages 1531-1536
收錄情况： WOS SCOPUS
WOS核心合集引用: 4
本系統需要使用 Internet Explorer 9.0 以上Firefox || Chrome瀏覽器
Copyright © 2018 澳門科技大學學者庫