[1] 孙在省, 钱斌, 胡蓉, 等. 基于块结构性质的花粉算法求解可重入作业车间调度问题[J]. 机械工程学报, 2019, 55(16):220-232. SUN Zaixing, QIAN Bin, HU Rong, et al. Flower pollination algorithm based on block structure properties for reentrant Job Shop scheduling problem[J]. Journal of Mechanical Engineering, 2019, 55(16):220-232. [2] 牟健慧, 郭前建, 高亮, 等. 基于混合的多目标遗传算法的多目标流水车间逆调度问题求解方法[J]. 机械工程学报, 2016, 52(22):186-197. MOU Jianhui, GUO Qianjian, GAO Liang, et al. Multi-objective genetic algorithm for solving multi-objective flow-shop inverse scheduling problems[J]. Journal of Mechanical Engineering, 2016, 52(22):186-197. [3] 李明, 雷德明. 考虑准备时间和关键目标的柔性作业车间低碳调度研究[J]. 机械工程学报, 2019, 55(21):139-149. LI Ming, LEI Deming. Research on flexible Job Shop low carbon scheduling with setup times and key objectives[J]. Journal of Mechanical Engineering, 2019, 55(21):139-149. [4] ZHAO Fuqing, LIU Huan, ZHANG Yi, et al. A discrete water wave optimization algorithm for no-wait flow shop scheduling problem[J]. Expert Systems with Applications, 2018, 91:347-363. [5] WANG Lei, GUO Shunsheng, LI Xixing, et al. Distributed manufacturing resource selection strategy in cloud manufacturing[J]. The International Journal of Advanced Manufacturing Technology, 2018, 94(9-12):3375-3388. [6] 王凌, 邓瑾, 王圣尧. 分布式车间调度优化算法研究综述[J]. 控制与决策, 2016(1):1-11. WANG Ling, DENG Jin, WANG Shengyao. Survey on optimization algorithms for distributed shop scheduling[J]. Control and Decision, 2016(1):1-11. [7] LIN Shihwei, YING Kuoching. Minimizing makespan for solving the distributed no-wait flowshop scheduling problem[J]. Computers & Industrial Engineering, 2016, 99:202-209. [8] KOMAKI M, MALAKOOTI B. General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem[J]. Production Engineering, 2017, 11(3):315-329. [9] SHAO Weishi, PI Dechang, SHAO Zhongshi. Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms[J]. Knowledge-Based Systems, 2017, 137:163-181. [10] SHAO Weishi, PI Dechang, SHAO Zhongshi. A pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time[J]. IEEE Transactions on Automation Science and Engineering, 2019, 16(3):1344-1360. [11] 桑红燕, 高亮, 李新宇. 求解批量流水线调度问题的离散蜂群算法[J]. 中国机械工程, 2011, 22(18):2195-2202. SANG Hongyan, GAO Liang, LI Xinyu. A discrete artificial bee colony algorithm for lot-streaming flow shop scheduling problem[J]. China Mechanical Engineering, 2011, 22(18):2195-2202. [12] PENG Kunkun, PAN Quanke, GAO Liang, et al. An improved artificial bee colony algorithm for real-world hybrid flowshop rescheduling in steelmaking-refining-continuous casting process[J]. Computers & Industrial Engineering, 2018, 122:235-250. [13] LI Junqing, BAI Shunchang, DUAN Peiyong, et al. An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system[J]. International Journal of Production Research, 2019, 57(22):6922-6942. [14] QIAN Bin, WANG Ling. A DE-based approach to no-wait flow-shop scheduling[J]. Computers & Industrial Engineering, 2009, 57(3):787-805. [15] NADERI B, RUIZ R. The distributed permutation flowshop scheduling problem[J]. Computers and Operations Research, Elsevier, 2010, 37(4):754-768. [16] NAWAZ M, ENSCORE JR E E, HAM I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem[J]. Omega, 1983, 11(1):91-95. [17] PAN Quanke, WANG Ling, QIAN Bin. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems[J]. Computers & Operations Research, 2009, 36(8):2498-2511. [18] ALLAHVERDI A, AYDILEK H, AYDILEK A. No-wait flowshop scheduling problem with two criteria:Total tardiness and makespan[J]. European Journal of Operational Research, 2018, 269(2):590-601. [19] LU Chao, GAO Liang, PAN Quanke, et al. A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution[J]. Applied Soft Computing, 2019, 75:728-749. |