{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:07:11Z","timestamp":1775146031687,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T00:00:00Z","timestamp":1619395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T00:00:00Z","timestamp":1619395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"school-enterprise cooperation project","award":["kh0100020192160"],"award-info":[{"award-number":["kh0100020192160"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10878-021-00748-8","type":"journal-article","created":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T15:43:06Z","timestamp":1619451786000},"page":"42-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A simple two-agent system for multi-objective flexible job-shop scheduling"],"prefix":"10.1007","volume":"43","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":"Zhengwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,26]]},"reference":[{"key":"748_CR1","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9270802","volume-title":"Recent research trends in genetic algorithm based flexible job shop scheduling problems","author":"MK Amjad","year":"2018","unstructured":"Amjad MK, Butt SI, Kousar R et al (2018) Recent research trends in genetic algorithm based flexible job shop scheduling problems. Math Probl, Eng"},{"key":"748_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-019-03196-0","volume":"291","author":"JL Andrade-Pineda","year":"2020","unstructured":"Andrade-Pineda JL, Canca D, Gonzalez-R PL, Calle M (2020) Scheduling a dual-resource flexible job shop with makespan and due date-related criteria. Ann Oper Res 291:5\u201335. https:\/\/doi.org\/10.1007\/s10479-019-03196-0","journal-title":"Ann Oper Res"},{"key":"748_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.04.006","author":"L Asadzadeh","year":"2015","unstructured":"Asadzadeh L (2015) A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2015.04.006","journal-title":"Comput Ind Eng"},{"key":"748_CR4","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. Future Gener Comput Syst. https:\/\/doi.org\/10.1016\/j.future.2009.10.004","journal-title":"Future Gener Comput Syst"},{"key":"748_CR7","unstructured":"Barnes JW, Chambers JB (1996) Flexible job shop scheduling by tabu search. Graduate Program in Operations Research and Industrial Engineering. University of Texas, Austin, Technical Report Series, ORP96-09."},{"key":"748_CR5","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":"748_CR6","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":"748_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106778","author":"R Chen","year":"2020","unstructured":"Chen R, Yang B, Li S, Wang S (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2020.106778","journal-title":"Comput Ind Eng"},{"key":"748_CR9","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":"748_CR10","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.jmsy.2013.01.005","volume":"32","author":"Y-C Chou","year":"2013","unstructured":"Chou Y-C, Cao H, Cheng HH (2013) A bio-inspired mobile agent-based integrated system for flexible autonomic job shop scheduling. J Manuf Syst 32:752\u2013763. https:\/\/doi.org\/10.1016\/j.jmsy.2013.01.005","journal-title":"J Manuf Syst"},{"key":"748_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/5232518","volume":"2017","author":"Q Deng","year":"2017","unstructured":"Deng Q, Gong G, Gong X et al (2017) A bee evolutionary guiding nondominated sorting genetic algorithm II for multiobjective flexible job-shop scheduling. Comput Intell Neurosci 2017:1\u201320. https:\/\/doi.org\/10.1155\/2017\/5232518","journal-title":"Comput Intell Neurosci"},{"key":"748_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104951","author":"H Ding","year":"2020","unstructured":"Ding H, Gu X (2020) Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2020.104951","journal-title":"Comput Oper Res"},{"key":"748_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-008-9031-3","author":"M Ennigrou","year":"2008","unstructured":"Ennigrou M, Gh\u00e9dira K (2008) New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach. Auton Agent Multi Agent Syst. https:\/\/doi.org\/10.1007\/s10458-008-9031-3","journal-title":"Auton Agent Multi Agent Syst"},{"key":"748_CR14","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":"748_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.06.004","author":"KZ Gao","year":"2015","unstructured":"Gao KZ, Suganthan PN, Chua TJ et al (2015) A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2015.06.004","journal-title":"Expert Syst Appl"},{"key":"748_CR16","doi-asserted-by":"publisher","DOI":"10.1504\/IJPMB.2018.088657","author":"S Gothwal","year":"2018","unstructured":"Gothwal S, Raj T (2018) Prioritising the performance measures of FMS using multi-criteria decision making approaches. Int J Process Manag Benchmarking. https:\/\/doi.org\/10.1504\/IJPMB.2018.088657","journal-title":"Int J Process Manag Benchmarking"},{"key":"748_CR17","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10951-017-0546-9","volume":"21","author":"M Gu","year":"2018","unstructured":"Gu M, Gu J, Lu X (2018) An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines. J Sched 21:483\u2013492. https:\/\/doi.org\/10.1007\/s10951-017-0546-9","journal-title":"J Sched"},{"key":"748_CR18","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-3054-z","author":"S Huang","year":"2016","unstructured":"Huang S, Tian N, Wang Y, Ji Z (2016) Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. Springerplus. https:\/\/doi.org\/10.1186\/s40064-016-3054-z","journal-title":"Springerplus"},{"key":"748_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem I, Hammadi S, Borne P (2002a) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60:245\u2013276. https:\/\/doi.org\/10.1016\/S0378-4754(02)00019-8","journal-title":"Math Comput Simul"},{"key":"748_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2002.1009117","author":"I Kacem","year":"2002","unstructured":"Kacem I, Hammadi S, Borne P (2002b) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern Part C Appl Rev. https:\/\/doi.org\/10.1109\/TSMCC.2002.1009117","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"748_CR21","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.539276","author":"A Kouider","year":"2012","unstructured":"Kouider A, Bouzouia B (2012) Multi-agent job shop scheduling system based on co-operative approach of idle time minimisation. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2010.539276","journal-title":"Int J Prod Res"},{"key":"748_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.11.024","author":"D Lei","year":"2015","unstructured":"Lei D (2015) Variable neighborhood search for two-agent flow shop scheduling problem. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2014.11.024","journal-title":"Comput Ind Eng"},{"key":"748_CR23","first-page":"1020","volume":"13","author":"H Li","year":"2017","unstructured":"Li H (2017) A variable neighborhood migrating birds optimization algorithm for flexible job shop scheduling. Int J Perform Eng 13:1020\u20131029","journal-title":"Int J Perform Eng"},{"key":"748_CR24","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"JQ Li","year":"2010","unstructured":"Li JQ, Pan QK, Liang YC (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59:647\u2013662. https:\/\/doi.org\/10.1016\/j.cie.2010.07.014","journal-title":"Comput Ind Eng"},{"key":"748_CR25","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00170-010-3140-2","volume":"55","author":"J-Q Li","year":"2011","unstructured":"Li J-Q, Pan Q-K, Gao K-Z (2011a) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55:1159\u20131169. https:\/\/doi.org\/10.1007\/s00170-010-3140-2","journal-title":"Int J Adv Manuf Technol"},{"key":"748_CR26","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00170-010-2743-y","volume":"52","author":"J-Q Li","year":"2011","unstructured":"Li J-Q, Pan Q-K, Suganthan PN, Chua TJ (2011b) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52:683\u2013697. https:\/\/doi.org\/10.1007\/s00170-010-2743-y","journal-title":"Int J Adv Manuf Technol"},{"key":"748_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.09.005","author":"X Li","year":"2017","unstructured":"Li X, Peng Z, Du B et al (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2017.09.005","journal-title":"Comput Ind Eng"},{"key":"748_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.asoc.2018.05.027","volume":"70","author":"H Li","year":"2018","unstructured":"Li H, Gajpal Y, Bector CR (2018a) Single machine scheduling with two-agent for total weighted completion time objectives. Appl Soft Comput 70:147\u2013156. https:\/\/doi.org\/10.1016\/j.asoc.2018.05.027","journal-title":"Appl Soft Comput"},{"key":"748_CR29","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s13369-017-2900-9","volume":"43","author":"S-S Li","year":"2018","unstructured":"Li S-S, Chen R-X, Li W-J (2018b) Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs. Arab J Sci Eng 43:969\u2013978. https:\/\/doi.org\/10.1007\/s13369-017-2900-9","journal-title":"Arab J Sci Eng"},{"key":"748_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106544","author":"Y Li","year":"2020","unstructured":"Li Y, Huang W, Wu R, Guo K (2020a) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput J. https:\/\/doi.org\/10.1016\/j.asoc.2020.106544","journal-title":"Appl Soft Comput J"},{"key":"748_CR31","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 (2020b) 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":"748_CR32","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":"J Intell Manuf"},{"key":"748_CR33","doi-asserted-by":"publisher","first-page":"e0223182","DOI":"10.1371\/journal.pone.0223182","volume":"14","author":"C Peng","year":"2019","unstructured":"Peng C, Wu G, Liao TW, Wang H (2019) Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem. PLoS ONE 14:e0223182. https:\/\/doi.org\/10.1371\/journal.pone.0223182","journal-title":"PLoS ONE"},{"key":"748_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2986-7","author":"A Rajabinasab","year":"2011","unstructured":"Rajabinasab A, Mansour S (2011) Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach. Int J Adv Manuf Technol. https:\/\/doi.org\/10.1007\/s00170-010-2986-7","journal-title":"Int J Adv Manuf Technol"},{"key":"748_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2013.04.015","author":"N Shahsavari-Pour","year":"2013","unstructured":"Shahsavari-Pour N, Ghasemishabankareh B (2013) A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling. J Manuf Syst. https:\/\/doi.org\/10.1016\/j.jmsy.2013.04.015","journal-title":"J Manuf Syst"},{"key":"748_CR36","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1699671","author":"L Shi","year":"2019","unstructured":"Shi L, Guo G, Song X (2019) Multi-agent based dynamic scheduling optimisation of the sustainable hybrid flow shop in a ubiquitous environment. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2019.1699671","journal-title":"Int J Prod Res"},{"key":"748_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-015-8075-1","author":"MR Singh","year":"2016","unstructured":"Singh MR, Singh M, Mahapatra SS, Jagadev N (2016) Particle swarm optimization algorithm embedded with maximum deviation theory for solving multi-objective flexible job shop scheduling problem. Int J Adv Manuf Technol. https:\/\/doi.org\/10.1007\/s00170-015-8075-1","journal-title":"Int J Adv Manuf Technol"},{"key":"748_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2017.09.022","author":"MBS Sreekara Reddy","year":"2018","unstructured":"Sreekara Reddy MBS, Ratnam C, Rajyalakshmi G, Manupati VK (2018) An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem. Meas J Int Meas Confed. https:\/\/doi.org\/10.1016\/j.measurement.2017.09.022","journal-title":"Meas J Int Meas Confed"},{"key":"748_CR39","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-010-2642-2","volume":"51","author":"X Wang","year":"2010","unstructured":"Wang X, Gao L, Zhang C, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manuf Technol 51:757\u2013767. https:\/\/doi.org\/10.1007\/s00170-010-2642-2","journal-title":"Int J Adv Manuf Technol"},{"key":"748_CR40","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":"748_CR41","doi-asserted-by":"publisher","first-page":"1740072","DOI":"10.1142\/S0217984917400723","volume":"31","author":"C Wang","year":"2017","unstructured":"Wang C, Ji Z, Wang Y (2017) Multi-objective flexible job shop scheduling problem using variable neighborhood evolutionary algorithm. Mod Phys Lett B 31:1740072","journal-title":"Mod Phys Lett B"},{"key":"748_CR42","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/9016303","author":"L Wang","year":"2017","unstructured":"Wang L, Cai J, Li M, Liu Z (2017) Flexible job shop scheduling problem using an improved ant colony optimization. Sci Progr. https:\/\/doi.org\/10.1155\/2017\/9016303","journal-title":"Sci Progr"},{"key":"748_CR43","doi-asserted-by":"publisher","first-page":"6188","DOI":"10.1080\/00207543.2012.720393","volume":"50","author":"TN Wong","year":"2012","unstructured":"Wong TN, Zhang S, Wang G, Zhang L (2012) Integrated process planning and scheduling - Multi-agent system with two-stage ant colony optimisation algorithm. Int J Prod Res 50:6188\u20136201","journal-title":"Int J Prod Res"},{"key":"748_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1060-6","author":"X Wu","year":"2017","unstructured":"Wu X, Wu S (2017) An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-015-1060-6","journal-title":"J Intell Manuf"},{"key":"748_CR45","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48:409\u2013425. https:\/\/doi.org\/10.1016\/j.cie.2005.01.018","journal-title":"Comput Ind Eng"},{"key":"748_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-008-0216-z","author":"LN Xing","year":"2009","unstructured":"Xing LN, Chen YW, Yang KW (2009) An efficient search method for multi-objective flexible job shop scheduling problems. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-008-0216-z","journal-title":"J Intell Manuf"},{"key":"748_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2008.04.013","author":"LN Xing","year":"2009","unstructured":"Xing LN, Chen YW, Yang KW (2009) Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Appl Soft Comput J. https:\/\/doi.org\/10.1016\/j.asoc.2008.04.013","journal-title":"Appl Soft Comput J"},{"key":"748_CR48","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":"748_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1137-2","author":"W Xiong","year":"2018","unstructured":"Xiong W, Fu D (2018) A new immune multi-agent system for the flexible job shop scheduling problem. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-015-1137-2","journal-title":"J Intell Manuf"},{"key":"748_CR50","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11721-019-00167-w","volume":"13","author":"R Zarrouk","year":"2019","unstructured":"Zarrouk R, Bennour IE, Jemai A (2019) A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem. Swarm Intell 13:145\u2013168. https:\/\/doi.org\/10.1007\/s11721-019-00167-w","journal-title":"Swarm Intell"},{"key":"748_CR51","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1267414","author":"S Zhang","year":"2017","unstructured":"Zhang S, Wong TN (2017) Flexible job-shop scheduling\/rescheduling in dynamic environment: a hybrid MAS\/ACO approach. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2016.1267414","journal-title":"Int J Prod Res"},{"key":"748_CR52","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":"748_CR53","doi-asserted-by":"publisher","DOI":"10.1504\/IJCSM.2017.088956","author":"J Zhang","year":"2017","unstructured":"Zhang J, Jie J, Wang W, Xu X (2017) A hybrid particle swarm optimisation for multi-objective flexible job-shop scheduling problem with dual-resources constrained. Int J Comput Sci Math. https:\/\/doi.org\/10.1504\/IJCSM.2017.088956","journal-title":"Int J Comput Sci Math"},{"key":"748_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-5510-z","author":"M Ziaee","year":"2014","unstructured":"Ziaee M (2014) A heuristic algorithm for solving flexible job shop scheduling problem. Int J Adv Manuf Technol. https:\/\/doi.org\/10.1007\/s00170-013-5510-z","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00748-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00748-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00748-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T08:15:14Z","timestamp":1643444114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00748-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,26]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00748-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,26]]},"assertion":[{"value":"16 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest exits in the submission of this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}