{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T06:17:02Z","timestamp":1770531422222,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819947416","type":"print"},{"value":"9789819947423","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-4742-3_9","type":"book-chapter","created":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T00:02:38Z","timestamp":1690675358000},"page":"109-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving Large-Scale Open Shop Scheduling Problem via Link Prediction Based on Graph Convolution Network"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7236-3589","authenticated-orcid":false,"given":"Lanjun","family":"Wan","sequence":"first","affiliation":[]},{"given":"Haoxin","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Xueyan","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Changyun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaojun","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,30]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10462-018-9667-6","volume":"53","author":"MH Fazel Zarandi","year":"2018","unstructured":"Fazel Zarandi, M.H., Sadat Asl, A.A., Sotudian, S., Castillo, O.: A state of the art review of intelligent scheduling. Artif. Intell. Rev. 53(1), 501\u2013593 (2018). https:\/\/doi.org\/10.1007\/s10462-018-9667-6","journal-title":"Artif. Intell. Rev."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2021.03.026","volume":"295","author":"MM Ahmadian","year":"2021","unstructured":"Ahmadian, M.M., Khatami, M., Salehipour, A., Cheng, T.: Four decades of research on the open-shop scheduling problem to minimize the makespan. Eur. J. Oper. Res. 295(2), 399\u2013426 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1080\/0305215X.2016.1164854","volume":"49","author":"D Bai","year":"2017","unstructured":"Bai, D., Zhang, Z., Zhang, Q., Tang, M.: Open shop scheduling problem to minimize total weighted completion time. Eng. Optim. 49(1), 98\u2013112 (2017)","journal-title":"Eng. Optim."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"107261","DOI":"10.1016\/j.cie.2021.107261","volume":"157","author":"S Gawiejnowicz","year":"2021","unstructured":"Gawiejnowicz, S., Koli\u0144ska, M.: Two-and three-machine open shop scheduling using LAPT-like rules. Comput. Ind. Eng. 157, 107261 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","volume":"124","author":"CF Liaw","year":"2000","unstructured":"Liaw, C.F.: A hybrid genetic algorithm for the open shop scheduling problem. Eur. J. Oper. Res. 124(1), 28\u201342 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"5099","DOI":"10.1007\/s00500-018-3177-y","volume":"23","author":"AA Rahmani Hosseinabadi","year":"2019","unstructured":"Rahmani Hosseinabadi, A.A., Vahidi, J., Saemi, B., Sangaiah, A.K., Elhoseny, M.: Extended genetic algorithm for solving open-shop scheduling problem. Soft. Comput. 23, 5099\u20135116 (2019)","journal-title":"Soft. Comput."},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum, C.: Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32(6), 1565\u20131591 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"9_CR8","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/j.cor.2007.02.019","volume":"35","author":"D Sha","year":"2008","unstructured":"Sha, D., Hsu, C.Y.: A new particle swarm optimization for the open shop scheduling problem. Comput. Oper. Res. 35(10), 3243\u20133261 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9_CR9","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/978-3-319-77028-4_88","volume-title":"Information Technology \u2013 New Generations","author":"W Marrouche","year":"2018","unstructured":"Marrouche, W., Harmanani, H.M.: Heuristic approaches for the open-shop scheduling problem. In: Latifi, S. (ed.) Information Technology \u2013 New Generations. AISC, vol. 738, pp. 691\u2013699. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77028-4_88"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.procir.2019.04.118","volume":"83","author":"Z Huang","year":"2019","unstructured":"Huang, Z., Zhuang, Z., Cao, Q., Lu, Z., Guo, L., Qin, W.: A survey of intelligent algorithms for open shop scheduling problem. Procedia CIRP 83, 569\u2013574 (2019)","journal-title":"Procedia CIRP"},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2020","unstructured":"Katoch, S., Chauhan, S.S., Kumar, V.: A review on genetic algorithm: past, present, and future. Multimedia Tools Appl. 80(5), 8091\u20138126 (2020). https:\/\/doi.org\/10.1007\/s11042-020-10139-6","journal-title":"Multimedia Tools Appl."},{"key":"9_CR12","volume-title":"Ant Colony Optimization: Overview and Recent Advances","author":"M Dorigo","year":"2019","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization: Overview and Recent Advances. Springer, Cham (2019)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"10031","DOI":"10.1109\/ACCESS.2022.3142859","volume":"10","author":"TM Shami","year":"2022","unstructured":"Shami, T.M., El-Saleh, A.A., Alswaitti, M., Al-Tashi, Q., Summakieh, M.A., Mir-jalili, S.: Particle swarm optimization: a comprehensive survey. IEEE Access 10, 10031\u201310061 (2022)","journal-title":"IEEE Access"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Philip, S.Y.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4\u201324 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.3390\/app11041921","volume":"11","author":"J Stastny","year":"2021","unstructured":"Stastny, J., Skorpil, V., Balogh, Z., Klein, R.: Job shop scheduling problem optimization by means of graph-based algorithm. Appl. Sci. 11(4), 1921 (2021)","journal-title":"Appl. Sci."},{"key":"9_CR16","unstructured":"Hameed, M.S.A., Schwung, A.: Reinforcement learning on job shop scheduling problems using graph networks. arXiv preprint arXiv:2009.03836 (2020)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Li, J., Dong, X., Zhang, K., Han, S.: Solving open shop scheduling problem via graph attention neural network. In: 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), pp. 277\u2013284. IEEE (2020)","DOI":"10.1109\/ICTAI50040.2020.00052"},{"key":"9_CR18","first-page":"1621","volume":"33","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P.S., Chi, X.: Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 1621\u20131632 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"11","key":"9_CR19","doi-asserted-by":"publisher","first-page":"3360","DOI":"10.1080\/00207543.2020.1870013","volume":"59","author":"J Park","year":"2021","unstructured":"Park, J., Chun, J., Kim, S.H., Kim, Y., Park, J.: Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning. Int. J. Prod. Res. 59(11), 3360\u20133377 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"105744","DOI":"10.1016\/j.cor.2022.105744","volume":"142","author":"LR Abreu","year":"2022","unstructured":"Abreu, L.R., Prata, B.A., Framinan, J.M., Nagano, M.S.: New efficient heuristics for scheduling open shops with makespan minimization. Comput. Oper. Res. 142, 105744 (2022)","journal-title":"Comput. Oper. Res."},{"key":"9_CR21","unstructured":"Zhang, M., Chen, Y.: Link prediction based on graph neural networks. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems. pp. 5171\u20135181 (2018)"},{"issue":"2","key":"9_CR22","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."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-4742-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T23:23:48Z","timestamp":1690932228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-4742-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819947416","9789819947423"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-4742-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2023a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2023\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}