{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:55:01Z","timestamp":1743098101256,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-981-15-3425-6_14","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"164-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiobjective Particle Swarm Optimization with Directional Search for Distributed Permutation Flow Shop Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6780-3073","authenticated-orcid":false,"given":"Wenqiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenlin","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diji","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsuo","family":"Gen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1162\/EVCO_a_00104","volume":"22","author":"N Al Moubayed","year":"2014","unstructured":"Al Moubayed, N., Petrovski, A., Mccall, J.: $$D{2}MOPSO$$: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces. Evol. Comput. 22(1), 47\u201377 (2014)","journal-title":"Evol. Comput."},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Chen, J.F., Wang, L., Peng, Z.P.: A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm Evol. Comput. 50 (2019). \nhttps:\/\/doi.org\/10.1016\/j.swevo.2019.100557","DOI":"10.1016\/j.swevo.2019.100557"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello, C.A.C., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 256\u2013279 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR4","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS 1995, pp. 39\u201343. IEEE (1995)"},{"issue":"4","key":"14_CR5","first-page":"295","volume":"3","author":"M Eddaly","year":"2016","unstructured":"Eddaly, M., Jarboui, B., Siarry, P.: Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J. Comput. Des. Eng. 3(4), 295\u2013311 (2016)","journal-title":"J. Comput. Des. Eng."},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"9","key":"14_CR7","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1109\/TCYB.2017.2692385","volume":"47","author":"H Han","year":"2017","unstructured":"Han, H., Lu, W., Qiao, J.: An adaptive multiobjective particle swarm optimization based on multiple adaptive methods. IEEE Trans. Cybern. 47(9), 2754\u20132767 (2017)","journal-title":"IEEE Trans. Cybern."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Jiang, E., Wang, L., Lu, J.: Modified multiobjective evolutionary algorithm based on decomposition for low-carbon scheduling of distributed permutation flow-shop. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20137. IEEE (2017)","DOI":"10.1109\/SSCI.2017.8280893"},{"issue":"22","key":"14_CR9","doi-asserted-by":"publisher","first-page":"6922","DOI":"10.1080\/00207543.2019.1571687","volume":"57","author":"JQ Li","year":"2019","unstructured":"Li, J.Q., Bai, S.C., Duan, P.Y., Sang, H.Y., Han, Y.Y., Zheng, Z.X.: An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system. Int. J. Prod. Res. 57(22), 6922\u20136942 (2019)","journal-title":"Int. J. Prod. Res."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.jclepro.2018.02.004","volume":"181","author":"JQ Li","year":"2018","unstructured":"Li, J.Q., Sang, H.Y., Han, Y.Y., Wang, C.G., Gao, K.Z.: Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. J. Clean. Prod. 181, 584\u2013598 (2018)","journal-title":"J. Clean. Prod."},{"key":"14_CR11","series-title":"IFMBE Proceedings","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-981-10-9023-3_8","volume-title":"World Congress on Medical Physics and Biomedical Engineering 2018","author":"V Mart\u00ednez-Cagigal","year":"2019","unstructured":"Mart\u00ednez-Cagigal, V., Santamar\u00eda-V\u00e1zquez, E., Hornero, R.: A novel hybrid swarm algorithm for P300-based BCI channel selection. In: Lhotska, L., Sukupova, L., Lackovi\u0107, I., Ibbott, G.S. (eds.) World Congress on Medical Physics and Biomedical Engineering 2018. IP, vol. 68\/3, pp. 41\u201345. Springer, Singapore (2019). \nhttps:\/\/doi.org\/10.1007\/978-981-10-9023-3_8"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi, B., Ruiz, R.: The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37(4), 754\u2013768 (2010)","journal-title":"Comput. Oper. Res."},{"key":"14_CR13","unstructured":"Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: 1985 Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 93\u2013100. Lawrence Erlbaum Associates. Inc. (1985)"},{"issue":"2","key":"14_CR14","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 problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.compind.2015.10.001","volume":"81","author":"D Tang","year":"2016","unstructured":"Tang, D., Dai, M., Salido, M.A., Giret, A.: Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization. Comput. Ind. 81, 82\u201395 (2016)","journal-title":"Comput. Ind."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.future.2016.08.004","volume":"76","author":"J Wang","year":"2017","unstructured":"Wang, J., Cao, Y., Li, B., Kim, H.J., Lee, S.: Particle swarm optimization based clustering algorithm with mobile sink for WSNs. Futur. Gener. Comput. Syst. 76, 452\u2013457 (2017)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"14_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-129-5","volume-title":"Introduction to Evolutionary Algorithms","author":"X Yu","year":"2010","unstructured":"Yu, X., Gen, M.: Introduction to Evolutionary Algorithms. Springer, Cham (2010). \nhttps:\/\/doi.org\/10.1007\/978-1-84996-129-5"},{"issue":"5","key":"14_CR18","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/s10845-013-0814-2","volume":"25","author":"W Zhang","year":"2014","unstructured":"Zhang, W., Gen, M., Jo, J.: Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem. J. Intell. Manuf. 25(5), 881\u2013897 (2014). \nhttps:\/\/doi.org\/10.1007\/s10845-013-0814-2","journal-title":"J. Intell. Manuf."},{"key":"14_CR19","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-981-10-1837-4_33","volume-title":"Proceedings of the Tenth International Conference on Management Science and Engineering Management","author":"W Zhang","year":"2017","unstructured":"Zhang, W., Lu, J., Zhang, H., Wang, C., Gen, M.: Fast multi-objective hybrid evolutionary algorithm for flow shop scheduling problem. In: Xu, J., Hajiyev, A., Nickel, S., Gen, M. (eds.) Proceedings of the Tenth International Conference on Management Science and Engineering Management. AISC, vol. 502, pp. 383\u2013392. Springer, Singapore (2017). \nhttps:\/\/doi.org\/10.1007\/978-981-10-1837-4_33"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.cie.2019.03.019","volume":"130","author":"W Zhang","year":"2019","unstructured":"Zhang, W., Wang, Y., Yang, Y., Gen, M.: Hybrid multiobjective evolutionary algorithm based on differential evolution for flow shop scheduling problems. Comput. Ind. Eng. 130, 661\u2013670 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.eswa.2019.01.084","volume":"126","author":"F Zhao","year":"2019","unstructured":"Zhao, F., Qin, S., Yang, G., Ma, W., Zhang, C., Song, H.: A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective. Expert Syst. Appl. 126, 41\u201353 (2019)","journal-title":"Expert Syst. Appl."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:30:58Z","timestamp":1585791058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","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":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"197","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":"121","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":"61% - 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","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":"3","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)"}}]}}