{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:07:12Z","timestamp":1762459632465,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"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_65","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:12:40Z","timestamp":1530771160000},"page":"649-658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Hybrid Shuffle Frog Leaping Algorithm Based on Cuckoo Search for Flow Shop Scheduling with the Consideration of Energy Consumption"],"prefix":"10.1007","author":[{"given":"Ling-Chong","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-Sheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"65_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/s00170-004-2249-6","volume":"27","author":"T Pasupathy","year":"2006","unstructured":"Pasupathy, T., Rajendran, C., Suresh, R.K.: A multi-objective genetic algorithm for scheduling in flow shop to minimize the makespan and total flow time of jobs. Int. J. Adv. Manuf. Technol. 27, 804\u2013815 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"65_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1051\/ro:2001109","volume":"35","author":"V. T'kindt","year":"2001","unstructured":"T\u2019kindt, V., Billiaut, J.-C.: Multicriteria scheduling problems: a survey. RAIRO Oper. Res. 35, 143\u2013163 (2001)","journal-title":"RAIRO - Operations Research"},{"issue":"4","key":"65_CR3","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s11704-015-4178-y","volume":"9","author":"LJ Wang","year":"2015","unstructured":"Wang, L.J., Yin, Y.L., Zhong, Y.W.: Cuckoo search with varied scaling factor. Front. Comput. Sci. China 9(4), 623\u2013635 (2015)","journal-title":"Front. Comput. Sci. China"},{"key":"65_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-319-13826-8_7","volume":"585","author":"O Aziz","year":"2015","unstructured":"Aziz, O., Bela\u00efd, A., Yang, X.: Discrete Cuckoo search applied to job shop scheduling problem. Recent Adv. Swarm Intell. Evol. Comput. 585, 121\u2013137 (2015)","journal-title":"Recent Adv. Swarm Intell. Evol. Comput."},{"issue":"12","key":"65_CR5","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1080\/0305215X.2012.737784","volume":"45","author":"Ye Xu","year":"2013","unstructured":"Xu, Y., Wang, L., Wang, S.Y., Liu, M.: An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines. Eng. Optim. 45, 1409\u20131430 (2013)","journal-title":"Engineering Optimization"},{"key":"65_CR6","first-page":"15","volume":"13","author":"Lvjiang Yin","year":"2017","unstructured":"Yin, L., Li, X., Gao, L., Lu, C., Zhang, Z.: A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem, considering productivity, energy efficiency and noise reduction. Sustain. Comput. Inf. Syst. 13(3), 15\u201330 (2017)","journal-title":"Sustainable Computing: Informatics and Systems"},{"issue":"11","key":"65_CR7","doi-asserted-by":"publisher","first-page":"3126","DOI":"10.1080\/00207543.2016.1262082","volume":"55","author":"Deming Lei","year":"2016","unstructured":"Lei, D., Zheng, Y., Guo, X.: A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption. Int. J. Prod. Res. 55, 3126\u20133140 (2016)","journal-title":"International Journal of Production Research"},{"issue":"6","key":"65_CR8","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1016\/j.cor.2011.09.026","volume":"40","author":"XS Yang","year":"2013","unstructured":"Yang, X.S.: Multiobjective cuckoo search for design optimization. Comput. Oper. Res. 40(6), 1616\u20131624 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"65_CR9","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.3390\/su8121268","volume":"8","author":"Lvjiang Yin","year":"2016","unstructured":"Yin, L., Li, X., Lu, C., Gao, L.: Energy-efficient scheduling problem using an effective hybrid multi-objective evolutionary algorithm. Sustainability 8(12), 1268\u20131301 (2016)","journal-title":"Sustainability"},{"key":"65_CR10","volume-title":"Hybrid Differential Evolution and Scheduling Algorithm","author":"L Wang","year":"2012","unstructured":"Wang, L., Qian, B.: Hybrid Differential Evolution and Scheduling Algorithm. Tsinghua University Press, Beijing (2012)"},{"issue":"3","key":"65_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1080\/0951192X.2014.880803","volume":"28","author":"SY Wang","year":"2015","unstructured":"Wang, S.Y., Wang, L., Liu, M., Xu, Y.: An order-based estimation of distribution algorithm for stochastic hybrid flow-shop scheduling problem. Int. J. Comput. Integr. Manuf. 28(3), 307\u2013320 (2015)","journal-title":"Int. J. Comput. Integr. Manuf."},{"issue":"24","key":"65_CR12","doi-asserted-by":"publisher","first-page":"11851","DOI":"10.1016\/j.amc.2012.04.091","volume":"218","author":"De-ming Lei","year":"2012","unstructured":"Lei, D.M.: Minimizing makespan for scheduling stochastic job shop with random breakdown. Appl. Math. Comput. 218(24), 11851\u201311858 (2012)","journal-title":"Applied Mathematics and Computation"},{"doi-asserted-by":"crossref","unstructured":"Qian, B., Li, Z.H., Hu, R., Zhang, C.S.: A hybrid differential evolution algorithm for the multi objective reentrant job-shop scheduling problem. In: IEEE International Conference on Control and Automation (ICCA) Hangzhou, China, 12\u201314 June 2013, pp. 485\u2013489 (2013)","key":"65_CR13","DOI":"10.1109\/ICCA.2013.6565137"}],"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_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:21:21Z","timestamp":1710246081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95930-6_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959290","9783319959306"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95930-6_65","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)"}}]}}