345
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

Multi-population genetic algorithm with greedy job insertion inter-factory neighbourhoods for multi-objective distributed hybrid flow-shop scheduling with unrelated-parallel machines considering tardiness

ORCID Icon, ORCID Icon, ORCID Icon &
Pages 4427-4445 | Received 03 Mar 2023, Accepted 17 Sep 2023, Published online: 26 Sep 2023

References

  • Baxendale, M., J. M. Mcgree, A. Bellette, and P. Corry. 2021. “Machine-based Production Scheduling for Rotomoulded Plastics Manufacturing.” International Journal of Production Research 59 (5): 1301–1318. https://doi.org/10.1080/00207543.2020.1727046.
  • Cai, J. C., and D. M. Lei. 2021. “A Cooperated Shuffled Frog-Leaping Algorithm for Distributed Energy-Efficient Hybrid Flow Shop Scheduling with Fuzzy Processing Time.” Complex & Intelligent Systems 7 (5): 2235–2253. https://doi.org/10.1007/s40747-021-00400-2
  • Cai, J. C., D. M. Lei, and M. Li. 2021. “A Shuffled Frog-Leaping Algorithm with Memeplex Quality for Bi-Objective Distributed Scheduling in Hybrid Flow Shop.” International Journal of Production Research 59 (18): 5404–5421. https://doi.org/10.1080/00207543.2020.1780333
  • Cai, J. C., D. M. Lei, J. Wang, and L. Wang. 2023. “A Novel Shuffled Frog-Leaping Algorithm with Reinforcement Learning for Distributed Assembly Hybrid Flow Shop Scheduling.” International Journal of Production Research 61 (4): 1233–1251. https://doi.org/10.1080/00207543.2022.2031331.
  • Cai, J. C., R. Zhou, and D. M. Lei. 2020. “Dynamic Shuffled Frog-Leaping Algorithm for Distributed Hybrid Flow Shop Scheduling with Multiprocessor Tasks.” Engineering Applications of Artificial Intelligence 90: 103540. https://doi.org/10.1016/j.engappai.2020.103540
  • Deb, K., A. Pratap, S. Agarwal, and T. Meyarivan. 2002. “A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197. https://doi.org/10.1109/4235.996017
  • Geng, K. F., L. Liu, and Z. Y. Wu. 2022. “Energy-Efficient Distributed Heterogeneous Re-Entrant Hybrid Flow Shop Scheduling Problem with Sequence Dependent Setup Times Considering Factory Eligibility Constraints.” Scientific Reports 12 (1): 18741. https://doi.org/10.1038/s41598-022-23144-6
  • Geng, K. F., and C. M. Ye. 2021. “A Memetic Algorithm for Energy-Efficient Distributed Re-Entrant Hybrid Flow Shop Scheduling Problem.” Journal of Intelligent & Fuzzy Systems 41 (2): 3951–3971. https://doi.org/10.3233/JIFS-202963.
  • Hao, J. H., J. Q. Li, Y. Du, M. X. Song, P. Duan, and Y. Y. Zhang. 2019. “Solving Distributed Hybrid Flowshop Scheduling Problems by a Hybrid Brain Storm Optimization Algorithm.” IEEE Access 7: 66879–66894. https://doi.org/10.1109/ACCESS.2019.2917273
  • Hong, J., K. Moon, K. Lee, K. Lee, and M. L. Pinedo. 2022. “An Iterated Greedy Matheuristic for Scheduling in Steelmaking-Continuous Casting Process.” International Journal of Production Research 60 (2): 623–643. https://doi.org/10.1080/00207543.2021.1975839
  • Jemmali, M., and L. Hidri. 2023. “Hybrid Flow Shop with Setup Times Scheduling Problem.” Computer Systems Science and Engineering 44 (1): 563–577. https://doi.org/10.32604/csse.2023.022716
  • Lee, T. S., and Y. T. Loong. 2019. “A Review of Scheduling Problem and Resolution Methods in Flexible Flow Shop.” International Journal of Industrial Engineering Computations 10 (1): 67–88. https://doi.org/10.5267/j.ijiec.2018.4.001
  • Li, J. Q., X. L. Chen, P. Y. Duan, and J. H. Mou. 2022. “KMOEA: A Knowledge-Based Multiobjective Algorithm for Distributed Hybrid Flow Shop in a Prefabricated System.” IEEE Transactions on Industrial Informatics 18 (8): 5318–5329. https://doi.org/10.1109/TII.2021.3128405
  • Li, X. X., X. Guo, H. T. Tang, R. Wu, and J. Y. Liu. 2023. “An Improved Cuckoo Search Algorithm for the Hybrid Flow-Shop Scheduling Problem in Sand Casting Enterprises Considering Batch Processing.” Computers & Industrial Engineering 176: 108921. https://doi.org/10.1016/j.cie.2022.108921
  • Li, Y. L., X. Y. Li, L. Gao, and L. L. Meng. 2020a. “An Improved Artificial Bee Colony Algorithm for Distributed Heterogeneous Hybrid Flowshop Scheduling Problem with Sequence-Dependent Setup Times.” Computers & Industrial Engineering 147: 106638. https://doi.org/10.1016/j.cie.2020.106638
  • Li, Y. L., X. Y. Li, L. Gao, B. Zhang, Q. K. Pan, M. F. Tasgetiren, and L. L. Meng. 2020b. “A Discrete Artificial Bee Colony Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Sequence-Dependent Setup Times.” International Journal of Production Research 59 (13): 3880–3899. https://doi.org/10.1080/00207543.2020.1753897
  • Lu, C., Q. Liu, B. Zhang, and L. J. Yin. 2022. “A Pareto-Based Hybrid Iterated Greedy Algorithm for Energy-Efficient Scheduling of Distributed Hybrid Flowshop.” Expert Systems with Applications 204: 117555. https://doi.org/10.1016/j.eswa.2022.117555
  • Mastrolilli, M., and L. M. Gambardella. 2000. “Effective Neighbourhood Functions for the Flexible Job Shop Problem” Journal of Scheduling 3: 3–20.
  • Meng, L. L., K. Z. Gao, Y. P. Ren, B. Zhang, H. Y. Sang, and C. Y. Zhang. 2022. “Novel MILP and CP Models for Distributed Hybrid Flowshop Scheduling Problem with Sequence-Dependent Setup Times.” Swarm and Evolutionary Computation 71: 101058. https://doi.org/10.1016/j.swevo.2022.101058
  • Okwudire, C. E., and H. V. Madhyastha. 2021. “Distributed Manufacturing for and by the Masses.” Science 372 (6540): 341–342. https://doi.org/10.1126/science.abg4924
  • Qin, H. X., Y. Y. Han, Y. T. Wang, Y. P. Liu, J. Q. Li, and Q. K. Pan. 2022. “Intelligent Optimization Under Blocking Constraints: A Novel Iterated Greedy Algorithm for the Hybrid Flow Shop Group Scheduling Problem.” Knowledge-Based Systems 258: 109962. https://doi.org/10.1016/j.knosys.2022.109962
  • Shao, W. S., Z. S. Shao, and D. C. Pi. 2020. “Modeling and Multi-Neighborhood Iterated Greedy Algorithm for Distributed Hybrid Flow Shop Scheduling Problem.” Knowledge-Based Systems 194: 105527. https://doi.org/10.1016/j.knosys.2020.105527
  • Shao, W. S., Z. S. Shao, and D. C. Pi. 2021a. “An Ant Colony Optimization Behavior-Based MOEA/D for Distributed Heterogeneous Hybrid Flow Shop Scheduling Problem Under Nonidentical Time-of-Use Electricity Tariffs.” IEEE Transactions on Automation Science and Engineering 19 (4): 3379–3394. https://doi.org/10.1109/TASE.2021.3119353
  • Shao, W. S., Z. S. Shao, and D. C. Pi. 2021b. “Multi-Objective Evolutionary Algorithm Based on Multiple Neighborhoods Local Search for Multi-Objective Distributed Hybrid Flow Shop Scheduling Problem.” Expert Systems with Applications 183: 115453. https://doi.org/10.1016/j.eswa.2021.115453
  • Shao, W. S., Z. S. Shao, and D. C. Pi. 2022. “A Network Memetic Algorithm for Energy and Labor-Aware Distributed Heterogeneous Hybrid Flow Shop Scheduling Problem.” Swarm and Evolutionary Computation 75: 101190. https://doi.org/10.1016/j.swevo.2022.101190
  • Shao, W. S., Z. S. Shao, and D. C. Pi. 2023. “LS-HH: A Learning-Based Selection Hyper-Heuristic for Distributed Heterogeneous Hybrid Blocking Flow-Shop Scheduling.” IEEE Transactions on Emerging Topics in Computational Intelligence 7 (1): 111–127. https://doi.org/10.1109/TETCI.2022.3174915
  • Sun, X. Y., W. M. Shen, and B. Y. Sun. 2021. “A Modified Genetic Algorithm for Distributed Hybrid Flowshop Scheduling Problem.” 24th IEEE International Conference on Computer Supported Cooperative Work in Design, Dalian, May 5-7.
  • Tao, X. R., Q. K. Pan, and L. Gao. 2022. “An Efficient Self-Adaptive Artificial Bee Colony Algorithm for the Distributed Resource-Constrained Hybrid Flowshop Problem.” Computers & Industrial Engineering 169: 108200. https://doi.org/10.1016/j.cie.2022.108200
  • Wang, Y., Z. H. Jia, and X. Y. Zhang. 2022. “A Hybrid Meta-Heuristic for the Flexible Flow Shop Scheduling with Blocking.” Swarm and Evolutionary Computation 75: 101195. https://doi.org/10.1016/j.swevo.2022.101195
  • Wang, S. S., M. Kurz, S. J. Mason, and E. Rashidi. 2019. “Two-Stage Hybrid Flow Shop Batching and Lot Streaming with Variable Sublots and Sequence-Dependent Setups.” International Journal of Production Research 57 (22): 6893–6907. https://doi.org/10.1080/00207543.2019.1571251
  • Wang, J. J., and L. Wang. 2019. “An Iterated Greedy Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Total Tardiness Minimization.” 15th IEEE International Conference on Automation Science and Engineering, Vancouver, August 22-26.
  • Wang, J. J., and L. Wang. 2021. “A Bi-Population Cooperative Memetic Algorithm for Distributed Hybrid Flow-Shop Scheduling.” IEEE Transactions on Emerging Topics in Computational Intelligence 5 (6): 947–961. https://doi.org/10.1109/TETCI.2020.3022372.
  • Wang, S. J., X. D. Wang, F. Chu, and J. B. Yu. 2020. “An Energy-Efficient Two-Stage Hybrid Flow Shop Scheduling Problem in a Glass Production.” International Journal of Production Research 58 (8): 2283–2314. https://doi.org/10.1080/00207543.2019.1624857.
  • Ying, K. C., and S. W. Lin. 2018. “Minimizing Makespan for the Distributed Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks.” Expert Systems with Applications 92: 132–141. https://doi.org/10.1016/j.eswa.2017.09.032
  • Yu, C. L., Q. Semeraro, and A. Matta. 2018. “A Genetic Algorithm for the Hybrid Flow Shop Scheduling with Unrelated Machines and Machine Eligibility.” Computers & Operations Research 100: 211–229. https://doi.org/10.1016/j.cor.2018.07.025
  • Zhang, C. Y., P. G. Li, Z. L. Guan, and Y. Q. Rao. 2007. “A Tabu Search Algorithm with a New Neighborhood Structure for the Job Shop Scheduling Problem.” Computers & Operations Research 34: 3229–3242. https://doi.org/10.1016/j.cor.2005.12.002.

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.