Flexible job shop dual resource scheduling problem considering loading and unloading
【Abstract】A flexible job shop dual resource scheduling problem considering fixture’s loading and unloading is proposed to solve the problems of low utilization rate of manufacturing resources, long non-processing time and difficult scheduling in a “research and production mixed line” job shop. Firstly, the mathematical optimization model of the problem is established to minimize the makespan and setup time. Then, a non-dominated sorting genetic algorithm is proposed to solve it. The decoding algorithm to reduce setup time is designed to balance the two objectives. The operator is randomly selected from the crossover operator pool and the variation operator pool, and the next generation is selected according to the non-dominated level and the crowding degree. Finally, the results of numerical experiment show that the proposed algorithm can solve the problem effectively.
【Keywords】 research and production mixed line; flexible job shop scheduling problem; dual resource scheduling; fixture; setup time;
 Tian C, Li L. Research on management and batch production control of aviation enterprises based on bottleneck management [C]. Proceedings of the Academic Exchange Meeting of the Management Science Branch of China Aviation Society in 2012. Beijing: Chinese Society of Aeronautics and Astronautics, 2012: 717–726 (in Chinese).
 Li Z F. Research on job shop scheduling problems with multi-time and its engineering application [D]. Wuhan: School of Mechanical Science and Engineering, Huazhong University of Science and Technology, 2010 (in Chinese).
 Allahverdi A. The third comprehensive survey on scheduling problems with setup times/costs [J]. European Journal of Operational Research, 2015, 246 (2): 345–378.
 Heger J, Jürgen B, Hildebrandt T, et al. Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times [J]. International Journal of Production Research, 2016, 54 (22): 6812–6824.
 Benkalai I, Rebaine D, GagnéC, et al. Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times [J]. International Journal of Production Research, 2017, 55 (20): 6145–6157.
 Nourali S, Imanipour N. A particle swarm optimization-based algorithm for flexible assembly job shop scheduling problem with sequence dependent setup times [J]. Scientia Iranica, 2014, 21 (3): 1021–1033.
 Sahin M, Kellegöz T. Increasing production rate in U-type assembly lines with sequence-dependent set-up times [J]. Engineering Optimization, 2016, 49 (8): 1401–1419.
 Lee K, Lei L, Pinedo M. Production scheduling with history-dependent setup times [J]. Naval Research Logistics, 2012, 59 (1): 58–68.
 Aydilek A, Aydilek H, Allahverdi A. Minimising maximum tardiness in assembly flowshops with setup times [J]. International Journal of Production Research, 2017, 55 (24): 7541–7565.
 Tao S, Hu Z H, Sheng Z H. Time-dependent coordination strategies for key resource prioritized three-stage handling operations [J]. Control and Decision, 2015, 30 (8): 1441–1446 (in Chinese).
 Aldowaisan T, Allahverdi A. Total tardiness performance in M-machine no-wait flowshops with separate setup times [J]. Intelligent Control and Automation, 2015 (6): 38–44.
 Luo Z Q, Wang R X, Lei J, et al. A Study on the assistant mechanical time quota [J], Machine Tool & Hydraulics, 2004, 32 (12): 62–64 (in Chinese).
 Wu X L, Zhang Z Q, LI J Q. A brain storm optimization algorithm integrating diversity and discussion mechanism for solving discrete production scheduling problem [J]. Control and Decision, 2017, 32 (9): 1583–1590 (in Chinese).
 Li J Y, Huang Y, Wang J Q, et al. Branch population genetic algorithm for extension dual resource constrained job shop scheduling problem [J]. Journal of Northwestern Polytechnical University, 2016, 34 (4): 635–641 (in Chinese).
 Guan Y Q, Zhu Y, Xie N M. Dynamic allocation model of manufacturing resources in flexible job shop considering multi-cost constraints [J]. Control and Decision, 2018, 33 (11): 2037–2044 (in Chinese).
 Li J Y, Sun S D, Huang Y, et al. Double-objective inherited genetic algorithm for dual resource constrained job shop [J]. Control and Decision, 2011, 26 (12): 1761–1767 (in Chinese).
 Xu X L, Ying S Y, Wang W L. Fuzzy flexible job-shop scheduling method based on multi-agent immune algorithm [J]. Control and Decision, 2010, 25 (2): 171–178 (in Chinese).
 Deb K, Agrawal S, Pratap A, et al. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II [C]. Proceedings for the International Conference on Parallel Problem Solving From Nature. Berlin, Heidelberg: Springer, 2000.
 Wu X L, Sun Y J. A green scheduling algorithm for flexible job shop with energy-saving measures [J]. Journal of Cleaner Production, 2018, 172: 3249–3264.
 Akay B, Yao X. Automated scheduling and planning [M]. Berlin: Springer, 2013: 191–224.
 Zhou Y W. Research of multi-objective flow shop scheduling based on fast non-dominated sorting genetic algorithm [D]. Guangzhou: School of Mathematics,South China University of Technology, 2015 (in Chinese).
 Wu X L, Cui Q. Multi-objective flexible flow shop scheduling problem with renewable energy [J]. Computer Integrated Manufacturing Systems, 2018, 24 (11): 2792–2807 (in Chinese).
 Brandimarte P. Routing and scheduling in a flexible job shop by tabu search [J]. Annals of Operations Research, 1993, 41 (3): 157–183.
 Ding Q F, Yin X Y. Research survey of differential evolution algorithms [J]. CAAI Transactions on Intelligent Systems, 2017, 12 (4): 431–442 (in Chinese).
 Shi Q. Research on the multi-objective optimization problem based on differential evolution algorithm [D]. Shanghai: School of Information Science and Technology, Donghua University, 2016 (in Chinese).
 Han Y Y, Li J Q, Sang H Y, et al. Discrete NSGAfor multi-objective lot-streaming flow shop scheduling problem with limited buffers [J]. Journal of Liaocheng University: Natural Science Edition, 2018, 31 (1): 89–96 (in Chinese).
 He L J, Li W F, Zhang Y. Multi-objective optimization method based on grey synthetic incidence analysis [J]. Control and Decision, 2020, 35 (5): 1134–1142 (in Chinese).
 Zitzler E, Thiele L. Multi-objective evolutionary algorithms: A comparative case study and the strength pareto approach [J]. IEEE Transactions on Evolutionary Computation, 1999, 3 (4): 257–271.
 Gong M, Jiao L, Du H, et al. Multi-objective immune algorithm with nondominated neighbor-based selection [J]. Evolutionary Computation, 2008, 16 (2): 225–255.