[1] ZHANG Jitao. Personalized product recommendation model based on user interest[J]. International Journal of Computer Systems Science&Engineering,2019,34(4):231-236. [2] 崔峻华,陈进,邓玉锋,等.机械制造企业新产品试制生产任务调度方法[J].江南大学学报,2015,14(3):326-332.CUI Junhua,CHEN Jin,DENG Yufeng,et al. Research for new product trial production task scheduling method in machinery manufacturing enterprises[J]. Journal of Jiangnan University Natural Science Edition,2015,14(3):326-332. [3] LIU Qiang,ZHANG Hao,LENG Jiewu,et al. Digital twin-driven rapid individualised designing of automated flow-shop manufacturing system[J]. International Journal of Production Research,2019,57(12):3903-3919. [4] LI Junqing,SONG Meixian,WANG Ling,et al. Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs[J].IEEE Transactions on Cybernetics, 2019, 50(6):2425-2439. [5] GAO Kaizhou,YANG Fajun,ZHOU Mengchu,et al.Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm[J]. IEEE Transactions on Cybernetics,2018,49(5):1944-1955. [6] SHEN Liji, DAUZÈRE-PÉRÈS S, NEUFELD J S.Solving the flexible job shop scheduling problem with sequence-dependent setup times[J]. European Journal of Operational Research,2018,265(2):503-516. [7] 郭伟飞,雷琦,宋豫川,等.基于虚拟零部件的零等待约束复杂产品综合调度算法[J].机械工程学报,2020,56(4):262-273.GUO Weifei,LEI Qi,SONG Yuchuan,et al. Integrated scheduling algorithm of complex product with no-wait constraint based on virtual component[J]. Journal of Mechanical Engineering,2020,56(4):262-273. [8] SOONCHAROEN S,PONGCHAROEN P,HICKS C.Grey wolf production scheduling for the capital goods industry[J]. Applied Soft Computing,2020,94(2020):1-19. [9] 冯毅雄,娄山河,王绪鹏,等.面向性能的定制产品感性意象评价方法研究[J].机械工程学报,2020,56(9):195-204.FENG Yixiong,LOU Shanhe,WANG Xupeng,et al.Research on performance-oriented perceptual image evaluation method for customized products[J]. Journal of Mechanical Engineering,2020,56(9):195-204. [10] LEI Qi, GUO Weifei, SONG Yuchuan. Integrated scheduling algorithm based on an operation relationship matrix table for tree-structured products[J]. International Journal of Production Research,2018,56(16):5437-5456. [11] GAO Yilong,XIE Zhiqiang,YU Xu. A hybrid algorithm for integrated scheduling problem of complex products with tree structure[J]. Multimedia Tools and Applications,2020,79(43):1-20. [12] IVENS P, LAMBRECHT M. Extending the shifting bottleneck procedure to real-life applications[J]. European Journal of Operational Research,1996,90(2):252-268. [13] SHI Fei,ZHAO Shikui,MENG Yue. Hybrid algorithm based on improved extended shifting bottleneck procedure and GA for assembly job shop scheduling problem[J].International Journal of Production Research,2020,58(9):2604-2625. [14] 廖不凡,雷琦,吴文烈,等.基于混合教学优化算法的多车间协作综合调度[J].中国机械工程,2020,31(16):1940-1949.LIAO Bufan, LEI Qi, WU Wenlie, et al. Hybrid teaching-learning-based optimization algorithms for integrated scheduling of multi-workshop collaborations[J].China Mechanical Engineering,2020,31(16):1940-1949. [15] XIE Zhiqiang,PEI Lirong,JIA Qing,et al. A process migration oriented multi-shop integrated scheduling algorithm for double objectives[J]. International Journal of Cooperative Information Systems,2020,29(1-2):1-18. [16] MOHAN J,LANKA K,RAO A N. A review of dynamic job shop scheduling techniques[J]. Procedia Manufacturing,2019,30:34-39. [17] LIU Weibo,JIN Yan,PRICE M. New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival[J]. The International Journal of Advanced Manufacturing Technology,2018,98(5):1817-1830. [18] KRUK S. Practical python AI projects:mathematical models of optimization problems with Google OR-Tools[M]. Berkeley:Apress,2018. [19] NAOUM S J,ELHEDHLI S. An interior point cutting plane heuristic for mixed integer programming[J].Computers&Operations Research, 2011, 38(9):1335-1341. [20] KU Wenyang,BECK J C. Mixed integer programming models for job shop scheduling:A computational analysis[J]. Computers and Operations Research,2016,73:165-173. [21] HELD M,KARP R M. The traveling-salesman problem and minimum spanning trees[J]. Operations Research,1970,18(6):1138-1162. [22] FUJITA S. A branch-and-bound algorithm for solving the multiprocessor scheduling problem with improved lower bounding techniques[J]. Computers,IEEE Transactions on,2011,60(7):1006-1016. [23] FERNANDEZ E B,BUSSELL B. Bounds on the number of processors and time for multiprocessor optimal schedules[J]. IEEE Transactions on Computers,1973,100(8):745-751. [24] WANG Linping,JIA Zhenyuan,WANG Fuji. Solving complete job shop scheduling problem using genetic algorithm[C]//IEEE, 20087th World Congress on Intelligent Control and Automation,June 25-27,2008,Chongqing,China. Piscataway,NJ:IEEE Xplore,2008:8307-8310. |