{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:24:27Z","timestamp":1760711067487,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T00:00:00Z","timestamp":1660867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,8,19]]},"DOI":"10.1145\/3561613.3561642","type":"proceedings-article","created":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T18:18:15Z","timestamp":1668017895000},"page":"187-192","source":"Crossref","is-referenced-by-count":1,"title":["An Adaptive Population-based Iterative Greedy Algorithm for Optimizing the Maximum Completion Time of Hybrid Flow Shop"],"prefix":"10.1145","author":[{"given":"Fuyou","family":"Mao","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Shenyang Jianzhu University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiyang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Shenyang Jianzhu University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haomin","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Shenyang Jianzhu University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"issue":"23","key":"e_1_3_2_1_1_1","first-page":"2798","article-title":"Review on Hybrid Flow Shop Scheduling Problems","volume":"31","author":"Yingli LI","year":"2020","unstructured":"LI Yingli , LI Xinyu , GAO Liang . Review on Hybrid Flow Shop Scheduling Problems . China Mechanical Engineering , 2020 , 31 ( 23 ): 2798 - 2813 ,2828. LI Yingli, LI Xinyu, GAO Liang. Review on Hybrid Flow Shop Scheduling Problems. China Mechanical Engineering, 2020, 31(23): 2798-2813,2828.","journal-title":"China Mechanical Engineering"},{"key":"e_1_3_2_1_2_1","volume-title":"Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. (Memorandum COSOR","author":"Hoogeveen J. A.","year":"1993","unstructured":"Hoogeveen , J. A. , Lenstra , J. K. , & Veltman , B. ( 1993 ). Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. (Memorandum COSOR ; Vol. 9320). Technische Universiteit Eindhoven. Hoogeveen, J. A., Lenstra, J. K., & Veltman, B. (1993). Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. (Memorandum COSOR; Vol. 9320). Technische Universiteit Eindhoven."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-80784-8_7"},{"key":"e_1_3_2_1_4_1","first-page":"91","article-title":"heuristic algorithm for the m-machine,n-job flow-shop sequencing problem [J].","volume":"1983","author":"Nawaz M","unstructured":"Nawaz M , Enscore J , Ham I.A heuristic algorithm for the m-machine,n-job flow-shop sequencing problem [J]. Omega , 1983 ,11(1): 91 - 95 . Nawaz M, Enscore J,Ham I.A heuristic algorithm for the m-machine,n-job flow-shop sequencing problem [J].Omega,1983,11(1):91-95.","journal-title":"Omega"},{"key":"e_1_3_2_1_5_1","volume-title":"Cui Zhe. Workshop scheduling method based on swarm intelligence optimization [M] \/ Beijing: Tsinghua University Press","author":"Deng Guanlong","year":"2016","unstructured":"Deng Guanlong , Gu Xingsheng , Cui Zhe. Workshop scheduling method based on swarm intelligence optimization [M] \/ Beijing: Tsinghua University Press , 2016 Deng Guanlong, Gu Xingsheng, Cui Zhe. Workshop scheduling method based on swarm intelligence optimization [M] \/ Beijing: Tsinghua University Press, 2016"},{"key":"e_1_3_2_1_6_1","volume-title":"Doye n A. A new approach to solve hybrid f low shop scheduling problems by artificial immune system [ J ]. Future Gene ratio n Compute r Systems","author":"Engin O","year":"2004","unstructured":"Engin O , Doye n A. A new approach to solve hybrid f low shop scheduling problems by artificial immune system [ J ]. Future Gene ratio n Compute r Systems , 2004 , 20(6) : 1083-1095. Engin O, Doye n A. A new approach to solve hybrid f low shop scheduling problems by artificial immune system [ J ]. Future Gene ratio n Compute r Systems, 2004, 20(6) : 1083-1095."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"e_1_3_2_1_8_1","first-page":"212","article-title":"Improved PSO algorithm for solving hybrid flow-shop scheduling[J]","volume":"2011","author":"Jianjun WANG","unstructured":"ZHANG Jianjun , WANG Chunfang . Improved PSO algorithm for solving hybrid flow-shop scheduling[J] . Computer Engineering and Applocations , 2011 ,47(31): 212 - 214 ,219(in Chinese). ZHANG Jianjun, WANG Chunfang. Improved PSO algorithm for solving hybrid flow-shop scheduling[J]. Computer Engineering and Applocations,2011,47(31):212-214,219(in Chinese).","journal-title":"Computer Engineering and Applocations"},{"issue":"3","key":"e_1_3_2_1_10_1","first-page":"437","article-title":"A distribution estimation algorithm for solving the hybrid flow shop scheduling problem[J]","volume":"2012","author":"Shengyao WANG","unstructured":"WANG Shengyao , WANG Ling , XU Ye , A distribution estimation algorithm for solving the hybrid flow shop scheduling problem[J] . Journal of Automation , 2012 ( 3 ): 437 - 443 . WANG Shengyao, WANG Ling, XU Ye, A distribution estimation algorithm for solving the hybrid flow shop scheduling problem[J]. Journal of Automation,2012(3):437-443.","journal-title":"Journal of Automation"},{"key":"e_1_3_2_1_11_1","first-page":"5767","article-title":"Hybrid Flexible Flowshop Problems: Models and Solution Methods[J]","volume":"2014","unstructured":"NADERI B, GOHARI S, YAZDANI M . Hybrid Flexible Flowshop Problems: Models and Solution Methods[J] . Applied Mathematical Modelling , 2014 , 38(24): 5767 - 5780 . NADERI B, GOHARI S, YAZDANI M. Hybrid Flexible Flowshop Problems: Models and Solution Methods[J]. Applied Mathematical Modelling,2014, 38(24):5767-5780.","journal-title":"Applied Mathematical Modelling"},{"key":"e_1_3_2_1_12_1","first-page":"91","article-title":"heuristic algorithm for the m-machine,n-job flow-shop sequencing problem [J].","volume":"1983","author":"Nawaz M","unstructured":"Nawaz M , Enscore J , Ham I.A heuristic algorithm for the m-machine,n-job flow-shop sequencing problem [J]. Omega , 1983 ,11(1): 91 - 95 . Nawaz M,Enscore J,Ham I.A heuristic algorithm for the m-machine,n-job flow-shop sequencing problem [J].Omega,1983,11(1):91-95.","journal-title":"Omega"},{"key":"e_1_3_2_1_13_1","unstructured":"Dong H Wang HP. Waitless flow shop scheduling based on population iterative greedy algorithm [J\/OL]. Control Engineering: 1-12 [2022-03-24]. doi:10.14107\/j.cnki.kzgc.20210248.    10.14107\/j.cnki.kzgc.20210248\nDong H Wang HP. Waitless flow shop scheduling based on population iterative greedy algorithm [J\/OL]. Control Engineering: 1-12 [2022-03-24]. doi:10.14107\/j.cnki.kzgc.20210248."},{"key":"e_1_3_2_1_14_1","volume-title":"Elsevier","volume":"2049","author":"Ruiz","year":"2007","unstructured":"Ruiz , Ruben & Stutzle, Thomas , 2007 . \" A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem,\"\u00a0European Journal of Operational Research , Elsevier , vol. 177(3), pages 2033- 2049 , March. Ruiz, Ruben & Stutzle, Thomas, 2007. \"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem,\"\u00a0European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March."},{"key":"e_1_3_2_1_15_1","unstructured":"Congram R K Potts C N Vab-de-Velde S L. An iterated dynasearch algorithm for the single-machine total weighted.  Congram R K Potts C N Vab-de-Velde S L. An iterated dynasearch algorithm for the single-machine total weighted."}],"event":{"name":"ICCCV 2022: 2022 The 5th International Conference on Control and Computer Vision","acronym":"ICCCV 2022","location":"Xiamen China"},"container-title":["2022 The 5th International Conference on Control and Computer Vision"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561613.3561642","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561613.3561642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:35Z","timestamp":1750186835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561613.3561642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,19]]},"references-count":14,"alternative-id":["10.1145\/3561613.3561642","10.1145\/3561613"],"URL":"https:\/\/doi.org\/10.1145\/3561613.3561642","relation":{},"subject":[],"published":{"date-parts":[[2022,8,19]]}}}