{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:53:54Z","timestamp":1780635234000,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467135","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:09Z","timestamp":1628748729000},"page":"3441-3451","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["A Multi-Graph Attributed Reinforcement Learning based Optimization Algorithm for Large-scale Hybrid Flow Shop Scheduling Problem"],"prefix":"10.1145","author":[{"given":"Fei","family":"Ni","sequence":"first","affiliation":[{"name":"Huazhong Unviersity of Science and Technology, Wuhan, AE, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianye","family":"Hao","sequence":"additional","affiliation":[{"name":"Tianjin University &amp; Huawei Noah's Ark Lab, Tianjin, AA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawen","family":"Lu","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shenzhen, AA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xialiang","family":"Tong","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shenzhen, AA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingxuan","family":"Yuan","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Hong Kong, AA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiahui","family":"Duan","sequence":"additional","affiliation":[{"name":"Sichuan University, Chengdu, AA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Ma","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin, AA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"He","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, AA, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5267\/j.dsl.2015.7.001"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.08.010"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3132687"},{"key":"e_1_3_2_2_4_1","volume-title":"Learning to perform local rewriting for combinatorial optimization. arXiv preprint arXiv:1810.00337","author":"Chen Xinyun","year":"2018","unstructured":"Xinyun Chen and Yuandong Tian . 2018. Learning to perform local rewriting for combinatorial optimization. arXiv preprint arXiv:1810.00337 ( 2018 ). Xinyun Chen and Yuandong Tian. 2018. Learning to perform local rewriting for combinatorial optimization. arXiv preprint arXiv:1810.00337 (2018)."},{"key":"e_1_3_2_2_5_1","volume-title":"A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Computers & industrial engineering","author":"Elmi Atabak","year":"2011","unstructured":"Atabak Elmi , Maghsud Solimanpur , Seyda Topaloglu , and Afshin Elmi . 2011. A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Computers & industrial engineering , Vol. 61 , 1 ( 2011 ), 171--178. Atabak Elmi, Maghsud Solimanpur, Seyda Topaloglu, and Afshin Elmi. 2011. A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Computers & industrial engineering , Vol. 61, 1 (2011), 171--178."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106288"},{"key":"e_1_3_2_2_7_1","volume-title":"Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428","author":"Fey Matthias","year":"2019","unstructured":"Matthias Fey and Jan Eric Lenssen . 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428 ( 2019 ). Matthias Fey and Jan Eric Lenssen. 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428 (2019)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0534-0"},{"key":"e_1_3_2_2_9_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.10.016"},{"key":"e_1_3_2_2_11_1","volume-title":"et almbox","author":"Li Longkang","year":"2020","unstructured":"Longkang Li , Hui-Ling Zhen , Mingxuan Yuan , Jiawen Lu , Jia Zeng , Jun Wang , Dirk Schnieders , et almbox . 2020 . Bilevel Learning Model Towards Industrial Scheduling . arXiv preprint arXiv:2008.04130 (2020). Longkang Li, Hui-Ling Zhen, Mingxuan Yuan, Jiawen Lu, Jia Zeng, Jun Wang, Dirk Schnieders, et almbox. 2020. Bilevel Learning Model Towards Industrial Scheduling. arXiv preprint arXiv:2008.04130 (2020)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2908210"},{"key":"e_1_3_2_2_13_1","volume-title":"Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Applied Soft Computing","author":"Luo Shu","year":"2020","unstructured":"Shu Luo . 2020. Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Applied Soft Computing ( 2020 ), 106208. Shu Luo. 2020. Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Applied Soft Computing (2020), 106208."},{"key":"e_1_3_2_2_14_1","volume-title":"Zili Meng, and Mohammad Alizadeh.","author":"Mao Hongzi","year":"2019","unstructured":"Hongzi Mao , Malte Schwarzkopf , Shaileshh Bojja Venkatakrishnan , Zili Meng, and Mohammad Alizadeh. 2019 . Learning scheduling algorithms for data processing clusters. In Proceedings of the ACM Special Interest Group on Data Communication. 270--288. Hongzi Mao, Malte Schwarzkopf, Shaileshh Bojja Venkatakrishnan, Zili Meng, and Mohammad Alizadeh. 2019. Learning scheduling algorithms for data processing clusters. In Proceedings of the ACM Special Interest Group on Data Communication. 270--288."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2014.04.012"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.019"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"e_1_3_2_2_18_1","unstructured":"Gurobi Optimization. 2014. Inc. ?Gurobi optimizer reference manual \" 2015. Gurobi Optimization. 2014. Inc. ?Gurobi optimizer reference manual \" 2015."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2013.12.004"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"e_1_3_2_2_21_1","volume-title":"The hybrid flow shop scheduling problem. European journal of operational research","author":"Ruiz Rub\u00e9n","year":"2010","unstructured":"Rub\u00e9n Ruiz and Jos\u00e9 Antonio V\u00e1zquez-Rodr'iguez . 2010. The hybrid flow shop scheduling problem. European journal of operational research , Vol. 205 , 1 ( 2010 ), 1--18. Rub\u00e9n Ruiz and Jos\u00e9 Antonio V\u00e1zquez-Rodr'iguez. 2010. The hybrid flow shop scheduling problem. European journal of operational research , Vol. 205, 1 (2010), 1--18."},{"key":"e_1_3_2_2_22_1","volume-title":"Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347","author":"Schulman John","year":"2017","unstructured":"John Schulman , Filip Wolski , Prafulla Dhariwal , Alec Radford , and Oleg Klimov . 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 ( 2017 ). John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/458"},{"key":"e_1_3_2_2_24_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems. 5998--6008. Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems. 5998--6008."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00873-1"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Chengfeng Xu Pengpeng Zhao Yanchi Liu Victor S Sheng Jiajie Xu Fuzhen Zhuang Junhua Fang and Xiaofang Zhou. 2019. Graph Contextualized Self-Attention Network for Session-based Recommendation.. In IJCAI . 3940--3946. Chengfeng Xu Pengpeng Zhao Yanchi Liu Victor S Sheng Jiajie Xu Fuzhen Zhuang Junhua Fang and Xiaofang Zhou. 2019. Graph Contextualized Self-Attention Network for Session-based Recommendation.. In IJCAI . 3940--3946.","DOI":"10.24963\/ijcai.2019\/547"},{"key":"e_1_3_2_2_27_1","volume-title":"Puay Siew Tan, and Xu Chi","author":"Zhang Cong","year":"2020","unstructured":"Cong Zhang , Wen Song , Zhiguang Cao , Jie Zhang , Puay Siew Tan, and Xu Chi . 2020 . Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning. Advances in Neural Information Processing Systems , Vol. 33 (2020). Cong Zhang, Wen Song, Zhiguang Cao, Jie Zhang, Puay Siew Tan, and Xu Chi. 2020. Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning. Advances in Neural Information Processing Systems , Vol. 33 (2020)."}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467135","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:27Z","timestamp":1750191507000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":27,"alternative-id":["10.1145\/3447548.3467135","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467135","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}