97
Views
0
CrossRef citations to date
0
Altmetric
Research Article

A hybrid genetic programming algorithm for the distributed assembly scheduling problems with transportation and sequence-dependent setup times

, &
Received 14 May 2023, Accepted 21 Mar 2024, Published online: 23 Apr 2024

References

  • Allahverdi, A., and H. M. Soroush. 2008. “The Significance of Reducing Setup Times/Setup Costs.” European Journal of Operational Research 187 (3): 978–984. https://doi.org/10.1016/j.ejor.2006.09.010.
  • Bhamra, R., C. Hicks, A. Small, and E. García-Villarreal. 2022. “Value, Product Delivery Strategies and Operational Performance in the Medical Technology Industry.” International Journal of Production Economics 245: 108399. https://doi.org/10.1016/j.ijpe.2021.108399.
  • Chu, H., K. Dong, R. Li, Q. Cheng, C. Zhang, K. Huang, C. Yang, and Y. Zheng. 2022. “Integrated Modeling and Optimization of Production Planning and Scheduling in Hybrid Flow Shop for Order Production Mode.” Computers & Industrial Engineering 174: 108741. https://doi.org/10.1016/j.cie.2022.108741.
  • Du, S., W. Zhou, D. Wu, and M. Fei. 2023. “An Effective Discrete Monarch Butterfly Optimization Algorithm for Distributed Blocking Flow Shop Scheduling with an Assembly Machine.” Expert Systems with Applications 225: 120113. https://doi.org/10.1016/j.eswa.2023.120113.
  • Fu, Y., Y. Hou, Z. Wang, X. Wu, K. Gao, and L. Wang. 2021. “Distributed Scheduling Problems in Intelligent Manufacturing Systems.” Tsinghua Science and Technology 26 (5): 625–645. https://doi.org/10.26599/TST.2021.9010009.
  • Hamzadayı, A., M. A. Arvas, and A. Elmi. 2021. “Distributed Assembly Permutation Flow Shop Problem; Single Seekers Society Algorithm.” Journal of Manufacturing Systems 61: 613–631. https://doi.org/10.1016/j.jmsy.2021.10.012.
  • Hatami, S., R. Ruiz, and C. Andrés-Romano. 2015. “Heuristics and Metaheuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem with Sequence Dependent Setup Times.” International Journal of Production Economics 169: 76–88. https://doi.org/10.1016/j.ijpe.2015.07.027.
  • Huang, J., and X. Gu. 2022. “Distributed Assembly Permutation Flow-Shop Scheduling Problem with Sequence-Dependent Set-Up Times Using a Novel Biogeography-Based Optimization Algorithm.” Engineering Optimization 54 (4): 593–613. https://doi.org/10.1080/0305215X.2021.1886289.
  • Huang, Z., Y. Mei, F. Zhang, and M. Zhang. 2023. “Multitask Linear Genetic Programming with Shared Individuals and Its Application to Dynamic Job Shop Scheduling.” IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/TEVC.2023.3263871.
  • Huang, Y., Q. Pan, and L. Gao. 2023. “An Effective Memetic Algorithm for the Distributed Flowshop Scheduling Problem with an Assemble Machine.” International Journal of Production Research 61 (6): 1755–1770. https://doi.org/10.1080/00207543.2022.2047238.
  • Huang, Y., Q. Pan, L. Gao, Z. Miao, and C. Peng. 2022. “A Two-Phase Evolutionary Algorithm for Multi-objective Distributed Assembly Permutation Flowshop Scheduling Problem.” Swarm and Evolutionary Computation 74: 101128. https://doi.org/10.1016/j.swevo.2022.101128.
  • Jiao, Y., Y. Wang, X. Deng, X. Su, and L. Huang. 2024. “Improved Ant Colony Algorithm for the Mixed-Model Parallel Two-Sided Assembly Lines Balancing Problem.” Engineering Optimization, 1–15. https://doi.org/10.1080/0305215X.2023.2284230.
  • Karimi, S., Z. Ardalan, B. Naderi, and M. Mohammadi. 2017. “Scheduling Flexible Job-Shops with Transportation Times: Mathematical Models and a Hybrid Imperialist Competitive Algorithm.” Applied mathematical modellíng 41: 667–682. https://doi.org/10.1016/j.apm.2016.09.022.
  • Koza, J. R. 1994. “Genetic Programming as a Means for Programming Computers by Natural Selection.” Statistics and Computing 4 (2): 87–112. https://doi.org/10.1007/BF00175355.
  • Li, W., X. Chen, J. Li, H. Sang, Y. Han, and S. Du. 2022. “An Improved Iterated Greedy Algorithm for Distributed Robotic Flowshop Scheduling with Order Constraints.” Computers & Industrial Engineering 164: 107907. https://doi.org/10.1016/j.cie.2021.107907.
  • Li, J., J. Deng, C. Li, Y. Han, J. Tian, B. Zhang, and C. Wang. 2020. “An Improved Jaya Algorithm for Solving the Flexible Job Shop Scheduling Problem with Transportation and Setup Times.” Knowledge-Based Systems 200: 106032. https://doi.org/10.1016/j.knosys.2020.106032.
  • Li, J., Y. Du, K. Gao, P. Duan, D. Gong, Q. Pan, and P. N. Suganthan. 2022. “A Hybrid Iterated Greedy Algorithm for a Crane Transportation Flexible Job Shop Problem.” IEEE Transactions on Automation Science and Engineering 19 (3): 2153–2170. https://doi.org/10.1109/TASE.2021.3062979.
  • Li, H., K. Gao, P. Duan, J. Li, and L. Zhang. 2022. “An Improved Artificial bee Colony Algorithm with Q-Learning for Solving Permutation Flow-Shop Scheduling Problems.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 53 (5): 2684–2693. https://doi.org/10.1109/TSMC.2022.3219380.
  • Li, Y., Q. Pan, R. Ruiz, and H. Sang. 2022. “A Referenced Iterated Greedy Algorithm for the Distributed Assembly Mixed No-Idle Permutation Flowshop Scheduling Problem with the Total Tardiness Criterion.” Knowledge-Based Systems 239: 108036. https://doi.org/10.1016/j.knosys.2021.108036.
  • Luo, C., W. Gong, F. Ming, and C. Lu. 2024. “A Q-Learning Memetic Algorithm for Energy-Efficient Heterogeneous Distributed Assembly Permutation Flowshop Scheduling Considering Priorities.” Swarm and Evolutionary Computation 85: 101497. https://doi.org/10.1016/j.swevo.2024.101497.
  • Marichelvam, M. K., M. Geetha, and Ö Tosun. 2020. “An Improved Particle Swarm Optimization Algorithm to Solve Hybrid Flowshop Scheduling Problems with the Effect of Human Factors–A Case Study.” Computers & Operations Research 114: 104812. https://doi.org/10.1016/j.cor.2019.104812.
  • Montgomery, D. C. 2005. Design and Analysis of Experiments. Arizona: John Wiley & Sons.
  • Naderi, B., and R. Ruiz. 2010. “The Distributed Permutation Flowshop Scheduling Problem.” Computers & Operations Research 37 (4): 754–768. https://doi.org/10.1016/j.cor.2009.06.019.
  • Nawaz, M., E. E. Enscore Jr, and I. Ham. 1983. “A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem.” Omega 11 (1): 91–95. https://doi.org/10.1016/0305-0483(83)90088-9.
  • Nguyen, S., M. Zhang, and M. Johnston. 2011. “A Genetic Programming Based Hyper-heuristic Approach for Combinatorial Optimisation.” Proceedings of the 13th annual conference on Genetic and evolutionary computation, 1299–1306. https://doi.org/10.1145/2001576.2001752.
  • Osman, I. H., and C. N. Potts. 1989. “Simulated Annealing for Permutation Flow-Shop Scheduling.” Omega 17 (6): 551–557. https://doi.org/10.1016/0305-0483(89)90059-5.
  • Pal, M., M. L. Mittal, G. Soni, S. S. Chouhan, and M. Kumar. 2023. “A Multi-agent System for FJSP with Setup and Transportation Times.” Expert Systems with Applications 216: 119474. https://doi.org/10.1016/j.eswa.2022.119474.
  • Pan, Y., K. Gao, Z. Li, and N. Wu. 2022. “Solving Biobjective Distributed Flow-Shop Scheduling Problems with Lot-Streaming Using an Improved Jaya Algorithm.” IEEE Transactions on Cybernetics 53 (6): 3818–3828. https://doi.org/10.1109/TCYB.2022.3164165.
  • Pereira, D. F., J. F. Oliveira, and M. A. Carravilla. 2022. “Merging Make-to-Stock/Make-to-Order Decisions Into Sales and Operations Planning: A Multi-objective Approach.” Omega 107: 102561. https://doi.org/10.1016/j.omega.2021.102561.
  • Prabhakar, S. K., and D. O. Won. 2023. “Phonocardiogram Signal Classification for the Detection of Heart Valve Diseases Using Robust Conglomerated Models.” Expert Systems with Applications 221: 119720. https://doi.org/10.1016/j.eswa.2023.119720.
  • Qin, M., R. Wang, Z. Shi, L. Liu, and L. Shi. 2019. “A Genetic Programming-Based Scheduling Approach for Hybrid Flow Shop with a Batch Processor and Waiting Time Constraint.” IEEE Transactions on Automation Science and Engineering 18 (1): 94–105. https://doi.org/10.1109/TASE.2019.2947398.
  • Shao, Z., W. Shao, J. Chen, and D. Pi. 2024. “A Feedback Learning-Based Selection Hyper-heuristic for Distributed Heterogeneous Hybrid Blocking Flow-Shop Scheduling Problem with Flexible Assembly and Setup Time.” Engineering Applications of Artificial Intelligence 131: 107818. https://doi.org/10.1016/j.engappai.2023.107818.
  • Shao, Z., W. Shao, and D. Pi. 2020. “Effective Heuristics and Metaheuristics for the Distributed Fuzzy Blocking Flow-Shop Scheduling Problem.” Swarm and Evolutionary Computation 59: 100747. https://doi.org/10.1016/j.swevo.2020.100747.
  • Song, H., and J. Lin. 2021. “A Genetic Programming Hyper-heuristic for the Distributed Assembly Permutation Flow-Shop Scheduling Problem with Sequence Dependent Setup Times.” Swarm and Evolutionary Computation 60: 100807. https://doi.org/10.1016/j.swevo.2020.100807.
  • Song, H., Y. Yang, J. Lin, and J. Ye. 2023. “An Effective Hyper Heuristic-Based Memetic Algorithm for the Distributed Assembly Permutation Flow-Shop Scheduling Problem.” Applied Soft Computing 135: 110022. https://doi.org/10.1016/j.asoc.2023.110022.
  • Sun, J., G. Zhang, J. Lu, and W. Zhang. 2021. “A Hybrid Many-Objective Evolutionary Algorithm for Flexible Job-Shop Scheduling Problem with Transportation and Setup Times.” Computers & Operations Research 132: 105263. https://doi.org/10.1016/j.cor.2021.105263.
  • Yu, H., K. Gao, Z. Ma, and Y. Pan. 2023. “Improved Meta-heuristics with Q-Learning for Solving Distributed Assembly Permutation Flowshop Scheduling Problems.” Swarm and Evolutionary Computation 80: 101335. https://doi.org/10.1016/j.swevo.2023.101335.
  • Zeiträg, Y., J. R. Figueira, N. Horta, and R. Neves. 2022. “Surrogate-Assisted Automatic Evolving of Dispatching Rules for Multi-objective Dynamic Job Shop Scheduling Using Genetic Programming.” Expert Systems with Applications 209: 118194. https://doi.org/10.1016/j.eswa.2022.118194.
  • Zeng, C., J. Liu, C. Peng, and Q. Chen. 2024. “Evolving Many-Objective Dispatching Rule Pairs for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times.” Engineering Optimization, 1–22. https://doi.org/10.1080/0305215X.2024.2305246.
  • Zhang, F., Y. Mei, S. Nguyen, and M. Zhang. 2023. “Survey on Genetic Programming and Machine Learning Techniques for Heuristic Design in Job Shop Scheduling.” IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/TEVC.2023.3255246.
  • Zhang, F., S. Nguyen, Y. Mei, and M. Zhang. 2021. Genetic Programming for Production Scheduling. Singapore: Springer.
  • Zhang, S., F. Tang, X. Li, J. Liu, and B. Zhang. 2021. “A Hybrid Multi-objective Approach for Real-Time Flexible Production Scheduling and Rescheduling Under Dynamic Environment in Industry 4.0 Context.” Computers & Operations Research 132: 105267. https://doi.org/10.1016/j.cor.2021.105267.
  • Zhang, H., G. Xu, R. Pan, and H. Ge. 2022. “A Novel Heuristic Method for the Energy-Efficient Flexible Job-Shop Scheduling Problem with Sequence-Dependent Set-Up and Transportation Time.” Engineering Optimization 54 (10): 1646–1667. https://doi.org/10.1080/0305215X.2021.1949007.
  • Zhao, F., S. Di, L. Wang, T. Xu, and N. Zhu. 2022. “A Self-Learning Hyper-heuristic for the Distributed Assembly Blocking Flow Shop Scheduling Problem with Total Flowtime Criterion.” Engineering Applications of Artificial Intelligence 116: 105418. https://doi.org/10.1016/j.engappai.2022.105418.
  • Zhao, F., L. Zhang, J. Cao, and J. Tang. 2021. “A Cooperative Water Wave Optimization Algorithm with Reinforcement Learning for the Distributed Assembly No-Idle Flowshop Scheduling Problem.” Computers & Industrial Engineering 153: 107082. https://doi.org/10.1016/j.cie.2020.107082.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.