{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T23:05:13Z","timestamp":1772838313461,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T00:00:00Z","timestamp":1677542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T00:00:00Z","timestamp":1677542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National Key R&D Program of China","award":["2017YFE0101400"],"award-info":[{"award-number":["2017YFE0101400"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00500-023-07931-5","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T11:27:09Z","timestamp":1677756429000},"page":"7285-7297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving fuzzy scheduling using clustering method and bacterial foraging algorithm"],"prefix":"10.1007","volume":"27","author":[{"given":"Yingli","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4129-512X","authenticated-orcid":false,"given":"Jiahai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxiang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,28]]},"reference":[{"key":"7931_CR1","doi-asserted-by":"publisher","first-page":"106869","DOI":"10.1016\/j.asoc.2020.106869","volume":"99","author":"Y An","year":"2021","unstructured":"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","journal-title":"Appl Soft Comput"},{"key":"7931_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2009.10.004","author":"A Bagheri","year":"2010","unstructured":"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","journal-title":"Futur Gener Comput Syst"},{"key":"7931_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157\u2013183. https:\/\/doi.org\/10.1007\/BF02023073","journal-title":"Ann Oper Res"},{"key":"7931_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369\u2013375. https:\/\/doi.org\/10.1007\/BF02238804","journal-title":"Computing"},{"key":"7931_CR5","doi-asserted-by":"publisher","first-page":"114567","DOI":"10.1016\/j.eswa.2021.114567","volume":"170","author":"RH Caldeira","year":"2021","unstructured":"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","journal-title":"Expert Syst Appl"},{"key":"7931_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2012.03.034","author":"TC Chiang","year":"2013","unstructured":"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","journal-title":"Int J Prod Econ"},{"key":"7931_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-009-2388-x","author":"FM Defersha","year":"2010","unstructured":"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","journal-title":"Int J Adv Manuf Technol"},{"key":"7931_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.01.001","author":"J Gao","year":"2008","unstructured":"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","journal-title":"Comput Oper Res"},{"key":"7931_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ins.2014.07.039","volume":"289","author":"KZ Gao","year":"2014","unstructured":"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\u201390. https:\/\/doi.org\/10.1016\/j.ins.2014.07.039","journal-title":"Inf Sci (Ny)"},{"key":"7931_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.07.046","author":"KZ Gao","year":"2016","unstructured":"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","journal-title":"Expert Syst Appl"},{"key":"7931_CR11","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1080\/00207543.2011.575412","volume":"50","author":"D Lei","year":"2012","unstructured":"Lei D, Guo X (2012) Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling. Int J Prod Res 50:1639\u20131649. https:\/\/doi.org\/10.1080\/00207543.2011.575412","journal-title":"Int J Prod Res"},{"key":"7931_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"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\u2013110. https:\/\/doi.org\/10.1016\/j.ijpe.2016.01.016","journal-title":"Int J Prod Econ"},{"key":"7931_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.cie.2018.08.022","volume":"125","author":"ERR Kato","year":"2018","unstructured":"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\u2013189. https:\/\/doi.org\/10.1016\/j.cie.2018.08.022","journal-title":"Comput Ind Eng"},{"key":"7931_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-021-00748-8","author":"Y Li","year":"2021","unstructured":"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","journal-title":"J Comb Optim"},{"key":"7931_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.2991\/ijcis.d.201104.001","volume":"14","author":"Y Li","year":"2020","unstructured":"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","journal-title":"Int J Comput Intell Syst"},{"key":"7931_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.11.046","author":"J Lin","year":"2019","unstructured":"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","journal-title":"Comput Ind Eng"},{"key":"7931_CR17","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","volume":"29","author":"M Nouiri","year":"2018","unstructured":"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\u2013615. https:\/\/doi.org\/10.1007\/s10845-015-1039-3","journal-title":"Intell Manuf"},{"key":"7931_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.02.014","author":"F Pezzella","year":"2008","unstructured":"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","journal-title":"Comput Oper Res"},{"key":"7931_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(99)00094-6","volume":"120","author":"M Sakawa","year":"2000","unstructured":"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\u2013407. https:\/\/doi.org\/10.1016\/S0377-2217(99)00094-6","journal-title":"Eur J Oper Res"},{"key":"7931_CR20","doi-asserted-by":"publisher","DOI":"10.1080\/00949655.2017.1344846","author":"C Wang","year":"2017","unstructured":"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","journal-title":"Stat Comput Simul"},{"key":"7931_CR21","doi-asserted-by":"publisher","first-page":"126093","DOI":"10.1016\/j.jclepro.2021.126093","volume":"293","author":"J Wang","year":"2021","unstructured":"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","journal-title":"J Clean Prod"},{"key":"7931_CR22","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s00170-011-3665-z","volume":"60","author":"L Wang","year":"2012","unstructured":"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\u20131123. https:\/\/doi.org\/10.1007\/s00170-011-3665-z","journal-title":"Int J Adv Manuf Technol"},{"key":"7931_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.10.006","author":"LN Xing","year":"2010","unstructured":"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","journal-title":"Appl Soft Comput J"},{"key":"7931_CR24","doi-asserted-by":"publisher","first-page":"107318","DOI":"10.1016\/j.cie.2021.107318","volume":"157","author":"W Xu","year":"2021","unstructured":"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","journal-title":"Comput Ind Eng"},{"key":"7931_CR25","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Xu H (2015) Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans Autom Sci Eng 12:336\u2013353. https:\/\/doi.org\/10.1109\/TASE.2013.2274517","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"7931_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.07.021","author":"G Zhang","year":"2009","unstructured":"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","journal-title":"Comput Ind Eng"},{"key":"7931_CR27","doi-asserted-by":"publisher","first-page":"106280","DOI":"10.1016\/j.cie.2020.106280","volume":"140","author":"Z Zhu","year":"2020","unstructured":"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","journal-title":"Comput Ind Eng"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07931-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-07931-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07931-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:50:09Z","timestamp":1683827409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-07931-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,28]]},"references-count":27,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["7931"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-07931-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,28]]},"assertion":[{"value":"12 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}