{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:00:53Z","timestamp":1760709653078,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959290"},{"type":"electronic","value":"9783319959306"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95930-6_64","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:12:40Z","timestamp":1530771160000},"page":"638-648","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Salp Swarm Algorithm Based on Blocks on Critical Path for Reentrant Job Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Zai-Xing","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guo-Lin","family":"Che","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"issue":"22","key":"64_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.3901\/JME.2010.22.182","volume":"46","author":"P Quanke","year":"2010","unstructured":"Quanke, P., Ling, W., Liang, G., et al.: Differential evolution algorithm based on blocks on critical path for job shop scheduling problems. J. Mech. Eng. 46(22), 182\u2013188 (2010)","journal-title":"J. Mech. Eng."},{"issue":"2","key":"64_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. INFORMS (1976)","journal-title":"Mathematics of Operations Research"},{"issue":"11","key":"64_CR3","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"CY Zhang","year":"2007","unstructured":"Zhang, C.Y., Li, P.G., Guan, Z.L., et al.: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput. Oper. Res. 34(11), 3229\u20133242 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"64_CR4","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.cor.2010.09.014","volume":"38","author":"R Zhang","year":"2011","unstructured":"Zhang, R., Wu, C.: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective. Comput. Oper. Res. 38(5), 854\u2013867 (2011)","journal-title":"Comput. Oper. Res."},{"key":"64_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.cor.2015.07.011","volume":"66","author":"J. Kuhpfahl","year":"2016","unstructured":"Kuhpfahl, J., Bierwirth, C.: A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective. Elsevier Science Ltd. (2016)","journal-title":"Computers & Operations Research"},{"key":"64_CR6","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ejor.2017.03.030","volume":"261","author":"C Bierwirth","year":"2017","unstructured":"Bierwirth, C., Kuhpfahl, J.: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. Eur. J. Oper. Res. 261, 835\u2013848 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"7\u20138","key":"64_CR7","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00170-008-1881-y","volume":"44","author":"S Topaloglu","year":"2009","unstructured":"Topaloglu, S., Kilincli, G.: A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization. Int. J. Adv. Manuf. Technol. 44(7\u20138), 781\u2013794 (2009)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"64_CR8","doi-asserted-by":"crossref","unstructured":"Qian, B., Li, Z.H., Hu, R., et al.: A hybrid differential evolution algorithm for the multi-objective reentrant job-shop scheduling problem, pp. 485\u2013489 (2013)","DOI":"10.1109\/ICCA.2013.6565137"},{"key":"64_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili, S., Gandomi, A.H., et al.: Salp Swarm Algorithm: a bio-inspired optimizer for engineering design problems. Adv. Eng. Softw. 114, 163\u2013191 (2017)","journal-title":"Adv. Eng. Softw."},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.renene.2017.12.051","volume":"119","author":"AA Elfergany","year":"2018","unstructured":"Elfergany, A.A., Kalogirou, S.A., Christodoulides, P.: Extracting optimal parameters of PEM fuel cells using Salp Swarm Optimizer. Renew. Energy 119, 641\u2013648 (2018)","journal-title":"Renew. Energy"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.future.2018.03.020","volume":"85","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset, M., Gunasekaran, M., El-Shahat, D., et al.: A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener. Comput. Syst. 85, 129\u2013145 (2018)","journal-title":"Future Gener. Comput. Syst."},{"key":"64_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.cor.2015.10.005","volume":"67","author":"M Kurdi","year":"2016","unstructured":"Kurdi, M.: An effective new island model genetic algorithm for job shop scheduling problem. Comput. Oper. Res. 67, 132\u2013142 (2016)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95930-6_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:21:04Z","timestamp":1710246064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95930-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959290","9783319959306"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95930-6_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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":"44% - 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":"3.46","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":"0","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}