参考文献/References:
[1] TANG Lixin,HUA Xuan.Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers[J].Journal of the Operational Research Society,2006,57(3):316-324.DOI:10.1057/palgrave.jors.2602033.
[2] TANG Lixin,HUA Xuan,LIU Jiyin.A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time[J].Computers and Operations Research,2006,33(11):3344-3359.DOI:10.1016/j.cor.2005.03.028.
[3] PORTMANN M C,VIGNIER A,DARDILHAC D,et al.Branch and bound crossed with GA to solve hybrid flowshops[J].European Journal of Operational Research,1998,107(2):389-400.DOI:10.1016/S0377-2217(97)00333-0.
[4] FATTAHI P,HOSSEINI S M H,JOLAI F,et al.A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations[J].Applied Mathematical Modelling,2014,38(1):119-134.DOI:10.1016/j.apm.2013.06.005.
[5] WANG Shijin,LIU Ming,CHU Chengbin.A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling[J].International Journal of Production Research,2015,53(4):1143-1167.DOI:10.1080/00207543.2014.949363.
[6] ZHANG Wei,YIN Changyu,LIU Jiyin,et al.Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops[J].International Journal of Production Economics,2005,96(2):189-200.DOI:10.1016/j.ijpe.2004.04.005.
[7] FIGIELSKA E.A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages[J].European Journal of Operational Research,2014,236(2):433-444.DOI:10.1016/j.ejor.2013.12.003.
[8] MARICHELVAM M K,PRABAHARAN T,YANG Xinshe.A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems[J].IEEE Transactions on Evolutionary Computation,2013,18(2):301-305.DOI:10.1109/TEVC.2013.2240304.
[9] NADERI B,YAZDANI M.A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times[J].Journal of Manufacturing Systems,2014,33(4):647-653.DOI:10.1016/j.jmsy.2014.06.002.
[10] SONG Meixian,LI Junqing,HAN Yunqi,et al.Metaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics[J].Applied Soft Computing,2020,95(2):106561.DOI:10.1016/j.asoc.2020.106561.
[11] LI Junqing,PAN Quanke,MAO Kun.A hybrid fruit fly optimization algorithm for the realistic hybrid flowshop rescheduling problem in steelmaking systems[J].IEEE Transactions on Automation Science and Engineering,2015,13(2):932-949.DOI:10.1109/TASE.2015.2425404.
[12] KHARE A,AGRAWAL S.Scheduling hybrid flowshop with sequence-dependent setup times and due windows to minimize total weighted earliness and tardiness[J].Computers and Industrial Engineering,2019,135:780-792.DOI:10.1016/j.cie.2019.06.057.
[13] 李修琳,鲁建厦,柴国钟,等.基于混合遗传算法的混流混合车间协同调度问题[J].中国机械工程,2012,23(8):935-940.DOI:10.3969/j.issn.1004-132X.2012.08.012.
[14] 鲁建厦,胡海芬,董巧英.基于博弈粒子群算法的混流混合车间调度研究[J].浙江工业大学学报,2015,43(4):398-404.DOI:10.3969/j.issn.1006-4303.2015.04.010.
[15] 王猛.基于免疫遗传算法的多级混合车间集成调度研究[D].兰州:兰州理工大学,2020.
[16] LOU Gaoxiang,CAI Zongyan.Improved hybrid immune clonal selection genetic algorithm and its application in hybrid shop scheduling[J].Cluster Computing,2019,22(2):3419-3429.DOI:10.1007/s10586-018-2189-9.
[17] 刘佳耀,王佳斌.Slope One-BI算法的改进及其在大数据平台的并行化[J].华侨大学学报(自然科学版),2019,40(6):786-792.DOI:10.11830/ISSN.1000-5013.201812074.
[18] 蔡春晓,李燕龙,陈晓.基于Hadoop的Java调用Matlab混合编程的车牌识别[J].桂林理工大学学报,2016,36(2):383-387.DOI:10.3969/j.issn.1674-9057.2016.02.033.
[19] 王诚,狄萱.孤立森林算法研究及并行化实现[J].计算机技术与发展,2021,31(6):13-18.DOI:10.3969/j.issn.1673-629X.2021.06.003.
[20] 顾幸生,潘晔,卢胜利.基于改进支持向量机的作物叶水势软测量建模[J].同济大学学报(自然科学版),2010,38(11):1669-1674.DOI:10.3969/j.issn.0253-374x.2010.11.021.