Abstract
Multi-objective fuzzy flexible job-shop scheduling problem (MFFJSSP) is a combination of multi-objective fuzzy scheduling and flexible job shop scheduling, which has higher complexity and is an NP-hard problem. For incompletely automated job shop, MFFJSSP is more important and conforms to the actual production. To solve the MFFJSSP, an effective multi-objective fuzzy scheduling method was proposed. First, a fuzzy number processing method based on fuzzy clustering that is more in line with the actual production was designed to replace the classic triangular fuzzy number. Second, based on the critical path theory, a more efficient method of critical operation block selection and critical operation movement were designed and applied them to the chemotaxis stage of bacterial foraging optimization algorithm to improve the accuracy of optimization and reduce invalid movement. Third, a novel decision tree-based bacterial reproduction method was designed to prevent the algorithm from falling into a local optimal solution. Finally, some cases were generated to verify the feasibility and effectiveness of the proposed algorithm from multiple dimensions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
The data that support the findings of this study are available from the corresponding author upon reasonable request.
References
An Y, Chen X, Li Y et al (2021) An improved non-dominated sorting biogeography-based optimization algorithm for the (hybrid) multi-objective flexible job-shop scheduling problem. Appl Soft Comput 99:106869. https://doi.org/10.1016/j.asoc.2020.106869
Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Futur Gener Comput Syst. https://doi.org/10.1016/j.future.2009.10.004
Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157–183. https://doi.org/10.1007/BF02023073
Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369–375. https://doi.org/10.1007/BF02238804
Caldeira RH, Gnanavelbabu A (2021) A Pareto based discrete Jaya algorithm for multi-objective flexible job shop scheduling problem. Expert Syst Appl 170:114567. https://doi.org/10.1016/j.eswa.2021.114567
Chiang TC, Lin HJ (2013) A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. Int J Prod Econ. https://doi.org/10.1016/j.ijpe.2012.03.034
Defersha FM, Chen M (2010) A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups. Int J Adv Manuf Technol. https://doi.org/10.1007/s00170-009-2388-x
Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res. https://doi.org/10.1016/j.cor.2007.01.001
Gao KZ, Suganthan PN, Pan QK et al (2014) Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf Sci (Ny) 289:76–90. https://doi.org/10.1016/j.ins.2014.07.039
Gao KZ, Suganthan PN, Pan QK et al (2016) An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst Appl. https://doi.org/10.1016/j.eswa.2016.07.046
Lei D, Guo X (2012) Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling. Int J Prod Res 50:1639–1649. https://doi.org/10.1080/00207543.2011.575412
Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93–110. https://doi.org/10.1016/j.ijpe.2016.01.016
Kato ERR, de Aguiar Aranha GD, Tsunaki RH (2018) A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and random-restart hill climbing. Comput Ind Eng 125:178–189. https://doi.org/10.1016/j.cie.2018.08.022
Li Y, Wang J, Liu Z (2021) A simple two-agent system for multi-objective flexible job-shop scheduling. J Comb Optim. https://doi.org/10.1007/s10878-021-00748-8
Li Y, Wang J, Liu Z (2020) An adaptive multi-objective evolutionary algorithm with two-stage local search for flexible job-shop scheduling. Int J Comput Intell Syst 14:54. https://doi.org/10.2991/ijcis.d.201104.001
Lin J, Zhu L, Wang ZJ (2019) A hybrid multi-verse optimization for the fuzzy flexible job-shop scheduling problem. Comput Ind Eng. https://doi.org/10.1016/j.cie.2018.11.046
Nouiri M, Bekrar A, Jemai A et al (2018) An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem J. Intell Manuf 29:603–615. https://doi.org/10.1007/s10845-015-1039-3
Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the Flexible Job-shop scheduling problem. Comput Oper Res. https://doi.org/10.1016/j.cor.2007.02.014
Sakawa M, Kubota R (2000) Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms. Eur J Oper Res 120:393–407. https://doi.org/10.1016/S0377-2217(99)00094-6
Wang C, Tian N, Ji Z, Wang Y (2017) Multi-objective fuzzy flexible job shop scheduling using memetic algorithm J. Stat Comput Simul. https://doi.org/10.1080/00949655.2017.1344846
Wang J, Liu Y, Ren S et al (2021) Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop. J Clean Prod 293:126093. https://doi.org/10.1016/j.jclepro.2021.126093
Wang L, Zhou G, Xu Y, Liu M (2012) An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. Int J Adv Manuf Technol 60:1111–1123. https://doi.org/10.1007/s00170-011-3665-z
Xing LN, Chen YW, Wang P et al (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput J. https://doi.org/10.1016/j.asoc.2009.10.006
Xu W, Hu Y, Luo W et al (2021) A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission. Comput Ind Eng 157:107318. https://doi.org/10.1016/j.cie.2021.107318
Yuan Y, Xu H (2015) Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans Autom Sci Eng 12:336–353. https://doi.org/10.1109/TASE.2013.2274517
Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng. https://doi.org/10.1016/j.cie.2008.07.021
Zhu Z, Zhou X (2020) An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints. Comput Ind Eng 140:106280. https://doi.org/10.1016/j.cie.2020.106280
Acknowledgment
This research is supported by the National Key R&D Program of China—Construction, Reference Implementation and Verification Platform of Reconfigurable Intelligent Production System (Grant No.2017YFE0101400).
Funding
This research was funded by the National Key R&D Program of China—Construction, Reference Implementation and Verification Platform of Reconfigurable Intelligent Production System (Grant No.2017YFE0101400).
Author information
Authors and Affiliations
Contributions
All authors contributed to the study conception and design. Material preparation, data collection and analysis were performed by YL, JG and JW. The first draft of the manuscript was written by YL and ZL. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Li, Y., Wang, J., Gao, J. et al. Solving fuzzy scheduling using clustering method and bacterial foraging algorithm. Soft Comput 27, 7285–7297 (2023). https://doi.org/10.1007/s00500-023-07931-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-023-07931-5