{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:10:31Z","timestamp":1743012631324,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030788100"},{"type":"electronic","value":"9783030788117"}],"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-78811-7_4","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"34-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Algorithm for Multi-objective Permutation Flow Shop Scheduling Problem with Setup Times"],"prefix":"10.1007","author":[{"given":"Cuiyu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Shuting","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xinyu","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Li, Y., Wang, C., Gao, L., Song, Y., Li, X.: An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling. Complex Intell. Syst., 1\u201311 (2020). https:\/\/doi.org\/10.1007\/s40747-020-00205-9","DOI":"10.1007\/s40747-020-00205-9"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1111\/j.1937-5956.2000.tb00137.x","volume":"9","author":"E Cheng","year":"2000","unstructured":"Cheng, E., Gupta, J., Wang, G.: A review of flow shop scheduling research with setup times. Prod. Oper. Manag. 9(3), 262\u2013282 (2000)","journal-title":"Prod. Oper. Manag."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s10033-020-00462-2","volume":"33","author":"L Gui","year":"2020","unstructured":"Gui, L., Gao, L., Li, X.: Anomalies in special permutation flow shop scheduling problems. Chin. J. Mech. Eng. 33(1), 1\u20137 (2020). https:\/\/doi.org\/10.1186\/s10033-020-00462-2","journal-title":"Chin. J. Mech. Eng."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"2081","DOI":"10.1007\/s00170-013-5192-6","volume":"69","author":"J Lee","year":"2013","unstructured":"Lee, J., Yu, J., Lee, D.: A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: minimizing total tardiness. Int. J. Adv. Manuf. Technol. 69, 2081\u20132089 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"M Yenisey","year":"2014","unstructured":"Yenisey, M., Yagmahan, B.: Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega 45, 119\u2013135 (2014)","journal-title":"Omega"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"100716","DOI":"10.1016\/j.swevo.2020.100716","volume":"57","author":"G Wang","year":"2020","unstructured":"Wang, G., Gao, L., Li, X., Li, P., Tasgetiren, M.: Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm. Swarm Evol. Comput. 57, 100716 (2020)","journal-title":"Swarm Evol. Comput."},{"issue":"18","key":"4_CR7","doi-asserted-by":"publisher","first-page":"6025","DOI":"10.1007\/s00500-018-3075-3","volume":"22","author":"S Deb","year":"2018","unstructured":"Deb, S., Tian, Z., Fong, S., Tang, R., Wong, R., Dey, N.: Solving permutation flow-shop scheduling problem by rhinoceros search algorithm. Soft. Comput. 22(18), 6025\u20136034 (2018). https:\/\/doi.org\/10.1007\/s00500-018-3075-3","journal-title":"Soft. Comput."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ejor.2020.03.035","volume":"286","author":"G Xu","year":"2020","unstructured":"Xu, G., Luo, K., Jing, G., Yu, X., Ruan, X., Song, J.: On convergence analysis of multi-objective particle swarm optimization algorithm. Eur. J. Oper. Res. 286, 32\u201338 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.cie.2007.08.003","volume":"54","author":"B Yagmahan","year":"2008","unstructured":"Yagmahan, B., Yenisey, M.: Ant colony optimization for multi-objective flow shop scheduling problem. Comput. Ind. Eng. 54, 411\u2013420 (2008)","journal-title":"Comput. Ind. Eng."},{"issue":"20","key":"4_CR10","doi-asserted-by":"publisher","first-page":"5957","DOI":"10.1080\/00207543.2010.528056","volume":"49","author":"M Frosolini","year":"2011","unstructured":"Frosolini, M., Braglia, M., Zammori, F.: A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates. Int. J. Prod. Res. 49(20), 5957\u20135985 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"30","key":"4_CR11","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/0360-8352(96)00045-9","volume":"4","author":"T Murata","year":"1996","unstructured":"Murata, T., Ishibuchi, H., Tanaka, H.: Multi-objective genetic algorithm and its applications to flow shop scheduling. Comput. Ind. Eng. 4(30), 957\u2013968 (1996)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ejor.2012.12.031","volume":"227","author":"C Michele","year":"2013","unstructured":"Michele, C., Gerardo, M., Ruben, R.: Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study. Eur. J. Oper. Res. 227(2), 301\u2013313 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"H Pierre","year":"2010","unstructured":"Pierre, H., Nenad, M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega 11, 91\u201395 (1983)","journal-title":"Omega"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Deb, K., Samir, A., Amrit, P., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II KanGAL Report 200001. Indian Institute of Technology, Kanpur, India (2000)","DOI":"10.1007\/3-540-45356-3_83"},{"key":"4_CR16","unstructured":"Vallada, E., Ruiz, R., Maroto, C.: Synthetic and real benchmarks for complex flow-shop problems. Technical Report, Universidad Polytechnic de Valencia, Valencia, Espana, Grupo de Investigation Operativa GIO (2003)"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."}],"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-78811-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:21:30Z","timestamp":1625613690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78811-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030788100","9783030788117"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78811-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}