{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:57:39Z","timestamp":1763978259513,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030954697"},{"type":"electronic","value":"9783030954703"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-95470-3_18","type":"book-chapter","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T10:07:13Z","timestamp":1643710033000},"page":"241-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Migrating Birds Optimization Algorithm to Solve Hybrid Flowshop Scheduling Problem with Lot-Streaming of Random Breakdown"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8763-4273","authenticated-orcid":false,"given":"Ping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9783-608X","authenticated-orcid":false,"given":"Renato","family":"De Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7476-5039","authenticated-orcid":false,"given":"Hongyan","family":"Sang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Peng, K., Pan, Q., Zhang, B.: An improved artificial bee colony algorithm for steelmaking-refining-continuous casting scheduling problem. Chin. J. Chem. Eng. 26(8), 1727\u20131735 (2018)","DOI":"10.1016\/j.cjche.2018.06.008"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Nie, L., Wang, X., Liu, K., Bai, Y.: A rescheduling approach based on genetic algorithm for flexible scheduling problem subject to machine breakdown. J. Phys. Conf. Series, 1453-012018 (2020)","DOI":"10.1088\/1742-6596\/1453\/1\/012018"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Tian, J., Zhou, Y., Fu, R.: An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown. J. Combin. Optim. 40(1), 170\u2013180 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00572-6","DOI":"10.1007\/s10878-020-00572-6"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Duman, E., Uysal, M., and Alkaya, A.F.: Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf. Sci., (217) (2012)","DOI":"10.1016\/j.ins.2012.06.032"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, S.J., Gu, X.S., and Zhou, F.N.: An improved discrete migrating birds optimization algorithm for the no-wait flow shop scheduling problem. IEEE Access (99), 1 (2020)","DOI":"10.1109\/ACCESS.2020.2997379"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, M., Tan, Y., Zhu, J., Chen, Y., and Chen, Z.: A competitive and cooperative migrating birds optimization algorithm for vary-sized batch splitting scheduling problem of flexible job-shop with setup time. Simul. Modell. Practice Theory (100), 102065(2019)","DOI":"10.1016\/j.simpat.2019.102065"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Wang, P., Sang, H., Tao, Q., Guo, H., Han, Y.: Improved migrating birds optimization algorithm to solve hybrid flowshop scheduling problem with lot-streaming. IEEE Access (99), 1 (2020)","DOI":"10.1109\/ACCESS.2020.2993881"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Mao, J., Hu, X.L., Pan, Q.K., Miao, Z., Tasgetiren, M.F.: An iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime. In: 2020 39th Chinese Control Conference. https:\/\/doi.org\/10.23919\/CCC50068.2020.9189642","DOI":"10.23919\/CCC50068.2020.9189642"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Marichelvam, M.K., Geetha, M., Tosun, M.: An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors-a case study. Comput. Oper. Res. (114), 104812 (2019)","DOI":"10.1016\/j.cor.2019.104812"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Chen, T.L., Cheng, C.Y., Chou, Y.H.: Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming. Ann. Oper. Res. 290(4), 813\u2013836(2020)","DOI":"10.1007\/s10479-018-2969-x"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Sang, H.-Y., Pan, Q.-K., Duan, P.-Y., Li, J.-Q.: An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems. J. Intell. Manuf. 29(6), 1337\u20131349 (2015). https:\/\/doi.org\/10.1007\/s10845-015-1182-x","DOI":"10.1007\/s10845-015-1182-x"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Huang, J.P., Pan, Q.K., Miao, Z.H., Gao, L.: Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times. Eng. Appl. Artif. Intell. (97), 104016(2021)","DOI":"10.1016\/j.engappai.2020.104016"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95470-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T10:14:47Z","timestamp":1643710487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95470-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954697","9783030954703"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95470-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"2 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2021.icas.cc\/","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":"215","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":"86","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":"40% - 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":"5-6","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":"1-2","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)"}}]}}