{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:24:18Z","timestamp":1784301858372,"version":"3.55.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030787424","type":"print"},{"value":"9783030787431","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78743-1_13","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"140-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Sparrow Search Algorithm for Solving Flexible Jobshop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Mingliang","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongsheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhile","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuanjun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"issue":"10","key":"13_CR1","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202\u20133212 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3\u20135","key":"13_CR2","first-page":"245","volume":"60","author":"I Kacem","year":"2014","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3\u20135), 245\u2013276 (2014)","journal-title":"Math. Comput. Simul."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1007\/s00170-014-5753-3","volume":"575","author":"S Karthikeyan","year":"2014","unstructured":"Karthikeyan, S., Asokan, P., Chandrasekaran, M.: A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problems with maintenance activity. Appl. Mech. Mater. 575, 922\u2013925 (2014). https:\/\/doi.org\/10.1007\/s00170-014-5753-3","journal-title":"Appl. Mech. Mater."},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888\u2013896 (2010)","journal-title":"Appl. Soft Comput."},{"issue":"9\u201310","key":"13_CR5","doi-asserted-by":"publisher","first-page":"3326","DOI":"10.1080\/00207543.2017.1420262","volume":"56","author":"J Vallikavungal Devassia","year":"2018","unstructured":"Vallikavungal Devassia, J., Salazar-Aguilar, M.A., Boyer, V.: Flexible job-shop scheduling problem with resource recovery constraints. Int. J. Prod. Res. 56(9\u201310), 3326\u20133343 (2018)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"13_CR6","first-page":"1","volume":"5","author":"Z Beheshti","year":"2013","unstructured":"Beheshti, Z., Shamsuddin, S.M.H.: A review of population-based meta-heuristic algorithm. Int. J. Adv. Soft Comput. Appl. 5(1), 1\u201335 (2013)","journal-title":"Int. J. Adv. Soft Comput. Appl."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0260-8774(00)00187-4","volume":"50","author":"C Tarantilis","year":"2001","unstructured":"Tarantilis, C., Kiranoudis, C.: A meta-heuristic algorithm for the efficient distribution of perishable foods. J. Food Eng. 50(1), 1\u20139 (2001)","journal-title":"J. Food Eng."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Lei, Y., De, G., Fei, L.: Improved sparrow search algorithm based DV-Hop localization in WSN. In: 2020 Chinese Automation Congress (CAC) (2020)","DOI":"10.1109\/CAC51589.2020.9327429"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.3390\/s21041224","volume":"21","author":"G Liu","year":"2021","unstructured":"Liu, G., Shu, C., Liang, Z., Peng, B., Cheng, L.: A modified sparrow search algorithm with application in 3D route planning for UAV. Sensors 21(4), 1224 (2021)","journal-title":"Sensors"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"9541","DOI":"10.1016\/j.ijhydene.2020.12.107","volume":"46","author":"Y Zhu","year":"2021","unstructured":"Zhu, Y., Yousefi, N.: Optimal parameter identification of PEMFC stacks using adaptive sparrow search algorithm. Int. J. Hydrogen Energy 46, 9541\u20139552 (2021)","journal-title":"Int. J. Hydrogen Energy"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-110.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput. Appl. 27(4), 1053\u20131073 (2016). https:\/\/doi.org\/10.1007\/s00521-015-1920-110.1007\/s00521-015-1920-1","journal-title":"Neural Comput. Appl."},{"issue":"1","key":"13_CR12","first-page":"2960","volume":"33","author":"B Qian","year":"2009","unstructured":"Qian, B., Wang, L., Huang, D.X., Wang, X.: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res. 33(1), 2960\u20132971 (2009)","journal-title":"Comput. Oper. Res."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"102182","DOI":"10.1016\/j.yofte.2020.102182","volume":"56","author":"P Chen","year":"2020","unstructured":"Chen, P., You, C., Ding, P.: Event classification using improved salp swarm algorithm based probabilistic neural network in fiber-optic perimeter intrusion detection system. Opt. Fiber Technol. 56, 102182 (2020)","journal-title":"Opt. Fiber Technol."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.enconman.2018.02.012","volume":"163","author":"J Wang","year":"2018","unstructured":"Wang, J., Yang, W., Pei, D., Tong, N.: A novel hybrid forecasting system of wind speed based on a newly developed multi-objective sine cosine algorithm. Ener. Convers. Manag. 163, 134\u2013150 (2018)","journal-title":"Ener. Convers. Manag."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/LAWP.2012.2191584","volume":"11","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Wang, C.-F.: Synthesis of reactively controlled antenna arrays using characteristic modes and de algorithm. IEEE Antennas Wirel. Propag. Lett. 11, 385\u2013388 (2012)","journal-title":"IEEE Antennas Wirel. Propag. Lett."},{"issue":"9","key":"13_CR16","doi-asserted-by":"publisher","first-page":"678","DOI":"10.3390\/en9090678","volume":"9","author":"W Warid","year":"2016","unstructured":"Warid, W., Hashim, H., Norman, M., Noor, A.W.: Optimal power flow using the jaya algorithm. Energies 9(9), 678 (2016)","journal-title":"Energies"},{"issue":"May","key":"13_CR17","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.apm.2016.12.034","volume":"45","author":"A Ham","year":"2017","unstructured":"Ham, A.: Flexible job shop scheduling problem for parallel batch processing machine with compatible job families. Appl. Math. Model. 45(May), 551\u2013562 (2017)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir, Y., Isleyen, S.K.: Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Modell. 37(3), 977\u2013988 (2013)","journal-title":"Appl. Math. Modell."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Liang, J., Wang, Q., Xu, W., Gao, Z., Yan, Z., Yu, F.: Improved Niche GA for FJSP. In: 2019 IEEE 6th International Conference on Cloud Computing and Intelligence Systems (CCIS) (2019)","DOI":"10.1109\/CCIS48116.2019.9073748"},{"issue":"5","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/TFUZZ.2019.2895562","volume":"27","author":"L Sun","year":"2019","unstructured":"Sun, L., Lin, L., Gen, M., Li, H.: A hybrid cooperative coevolution algorithm for fuzzy flexible job shop scheduling. IEEE Trans. Fuzzy Syst. 27(5), 1008\u20131022 (2019)","journal-title":"IEEE Trans. Fuzzy Syst."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78743-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:16:08Z","timestamp":1625613368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78743-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030787424","9783030787431"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78743-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}