{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:09:15Z","timestamp":1780351755369,"version":"3.54.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Youth Foundation of Social Science and Humanity, China Ministry of Education","award":["21YJC630084"],"award-info":[{"award-number":["21YJC630084"]}]},{"name":"Youth Foundation of Shandong Natural Science","award":["ZR2021QG001"],"award-info":[{"award-number":["ZR2021QG001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72101136"],"award-info":[{"award-number":["72101136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"DOI":"10.1007\/s10791-024-09474-1","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T07:08:05Z","timestamp":1730876885000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Outpatient scheduling problem in smart hospital with two-agent deep reinforcement learning algorithm"],"prefix":"10.1007","volume":"27","author":[{"given":"Jianing","family":"Zuo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weibo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,6]]},"reference":[{"key":"9474_CR1","doi-asserted-by":"publisher","DOI":"10.1177\/10591478241240390","author":"MM Canellas","year":"2024","unstructured":"Canellas MM, Pachamanova DA, Perakis G, Lami OS, Tsiourvas A. A granular approach to optimal and fair patient placement in hospital emergency departments. Prod Oper Manag. 2024. https:\/\/doi.org\/10.1177\/10591478241240390.","journal-title":"Prod Oper Manag"},{"key":"9474_CR2","doi-asserted-by":"publisher","DOI":"10.1177\/10591478241270115","author":"Q Wang","year":"2024","unstructured":"Wang Q, Carson AL, Zheng S. EXPRESS: the relative indirect effects of technology bias and implicit bias on racial disparity in service delivery and sepsis mortality. Prod Oper Manag. 2024. https:\/\/doi.org\/10.1177\/10591478241270115.","journal-title":"Prod Oper Manag"},{"issue":"6","key":"9474_CR3","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1111\/poms.13951","volume":"32","author":"V Babashov","year":"2023","unstructured":"Babashov V, Saur\u00e9 A, Ozturk O, Patrick J. Setting wait time targets in a multi-priority patient setting. Prod Oper Manag. 2023;32(6):1958\u201374. https:\/\/doi.org\/10.1111\/poms.13951.","journal-title":"Prod Oper Manag"},{"issue":"1","key":"9474_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2023.01.024","volume":"309","author":"M Reihaneh","year":"2023","unstructured":"Reihaneh M, Ansari S, Farhadi F. Patient appointment scheduling at hemodialysis centers: an exact branch and price approach. Eur J Oper Res. 2023;309(1):35\u201352. https:\/\/doi.org\/10.1016\/j.ejor.2023.01.024.","journal-title":"Eur J Oper Res"},{"key":"9474_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102853","volume":"118","author":"K Shao","year":"2023","unstructured":"Shao K, Fan W, Lan S, Kong M, Yang S. A column generation-based heuristic for brachytherapy patient scheduling with multiple treatment sessions considering radioactive source decay and time constraints. Omega. 2023;118: 102853. https:\/\/doi.org\/10.1016\/j.omega.2023.102853.","journal-title":"Omega"},{"issue":"1","key":"9474_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ejor.2023.03.004","volume":"310","author":"T Alves de Queiroz","year":"2023","unstructured":"Alves de Queiroz T, Iori M, Kramer A, Kuo YH. Dynamic scheduling of patients in emergency departments. Eur J Oper Res. 2023;310(1):100\u201316. https:\/\/doi.org\/10.1016\/j.ejor.2023.03.004.","journal-title":"Eur J Oper Res"},{"issue":"11","key":"9474_CR7","doi-asserted-by":"publisher","first-page":"4044","DOI":"10.1111\/poms.13501","volume":"30","author":"GA Kasapidis","year":"2021","unstructured":"Kasapidis GA, Paraskevopoulos DC, Repoussis PP, Tarantilis CD. Flexible job shop scheduling problems with arbitrary precedence graphs. Prod Oper Manag. 2021;30(11):4044\u201368. https:\/\/doi.org\/10.1111\/poms.13501.","journal-title":"Prod Oper Manag"},{"key":"9474_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102907","volume":"120","author":"D Golmohammadi","year":"2023","unstructured":"Golmohammadi D, Zhao L, Dreyfus D. Using machine learning techniques to reduce uncertainty for outpatient appointment scheduling practices in outpatient clinics. Omega. 2023;120: 102907. https:\/\/doi.org\/10.1016\/j.omega.2023.102907.","journal-title":"Omega"},{"key":"9474_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.omega.2015.04.009","volume":"57","author":"A Kuiper","year":"2015","unstructured":"Kuiper A, Mandjes M. Appointment scheduling in tandem-type service systems. Omega. 2015;57:145\u201356. https:\/\/doi.org\/10.1016\/j.omega.2015.04.009.","journal-title":"Omega"},{"issue":"2","key":"9474_CR10","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.ejor.2019.02.051","volume":"277","author":"M Soltani","year":"2019","unstructured":"Soltani M, Samorani M, Kolfal B. Appointment scheduling with multiple providers and stochastic service times. Eur J Oper Res. 2019;277(2):667\u201383. https:\/\/doi.org\/10.1016\/j.ejor.2019.02.051.","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9474_CR11","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ejor.2019.10.047","volume":"283","author":"J Schoenfelder","year":"2020","unstructured":"Schoenfelder J, Bretthauer KM, Wright PD, Coe E. Nurse scheduling with quick-response methods: improving hospital performance, nurse workload, and patient experience. Eur J Oper Res. 2020;283(1):390\u2013403. https:\/\/doi.org\/10.1016\/j.ejor.2019.10.047.","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9474_CR12","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.ejor.2018.11.028","volume":"275","author":"AF Hesaraki","year":"2019","unstructured":"Hesaraki AF, Dellaert NP, de Kok T. Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan. Eur J Oper Res. 2019;275(1):304\u201318. https:\/\/doi.org\/10.1016\/j.ejor.2018.11.028.","journal-title":"Eur J Oper Res"},{"key":"9474_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102350","volume":"102","author":"K Wang","year":"2021","unstructured":"Wang K, Qin H, Huang Y, Luo M, Zhou L. Surgery scheduling in outpatient procedure centre with re-entrant patient flow and fuzzy service times. Omega. 2021;102: 102350. https:\/\/doi.org\/10.1016\/j.omega.2020.102350.","journal-title":"Omega"},{"key":"9474_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2020.107764","volume":"229","author":"J Zhang","year":"2020","unstructured":"Zhang J, Dridi M, El Moudni A. Column-generation-based heuristic approaches to stochastic surgery scheduling with downstream capacity constraints. Int J Prod Econ. 2020;229: 107764. https:\/\/doi.org\/10.1016\/j.ijpe.2020.107764.","journal-title":"Int J Prod Econ"},{"key":"9474_CR15","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.eswa.2018.06.053","volume":"113","author":"M \u00d0urasevi\u0107","year":"2018","unstructured":"\u00d0urasevi\u0107 M, Jakobovi\u0107 D. A survey of dispatching rules for the dynamic unrelated machines environment. Expert Syst Appl. 2018;113:555\u201369. https:\/\/doi.org\/10.1016\/j.eswa.2018.06.053.","journal-title":"Expert Syst Appl"},{"key":"9474_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107890","volume":"113","author":"D Delikta\u015f","year":"2021","unstructured":"Delikta\u015f D, \u00d6zcan E, Ustun O, Torkul O. Evolutionary algorithms for multi-objective flexible job shop cell scheduling. Appl Soft Comput. 2021;113: 107890. https:\/\/doi.org\/10.1016\/j.asoc.2021.107890.","journal-title":"Appl Soft Comput"},{"key":"9474_CR17","doi-asserted-by":"publisher","unstructured":"Xin P, Sun T, Wang J, Zhang N, Li Y. A review of production scheduling research based on genetic algorithm. Lecture notes on data engineering and communications technologies; 2023. https:\/\/doi.org\/10.1007\/978-3-031-29097-8_52","DOI":"10.1007\/978-3-031-29097-8_52"},{"key":"9474_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109783","volume":"131","author":"N Chen","year":"2022","unstructured":"Chen N, Xie N, Wang Y. An elite genetic algorithm for flexible job shop scheduling problem with extracted grey processing time. Appl Soft Comput. 2022;131: 109783. https:\/\/doi.org\/10.1016\/j.asoc.2022.109783.","journal-title":"Appl Soft Comput"},{"key":"9474_CR19","doi-asserted-by":"publisher","unstructured":"Missaoui, A., & Boujelbene, Y. Hybrid Genetic algorithm for Blocking Flowshop scheduling with due date windows. In: 2021 international conference on decision aid sciences and application (DASA); 2021. https:\/\/doi.org\/10.1109\/dasa53625.2021.9682275","DOI":"10.1109\/dasa53625.2021.9682275"},{"key":"9474_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105431","volume":"135","author":"Z Liu","year":"2021","unstructured":"Liu Z, Wang J, Zhang C, Chu H, Ding G, Zhang L. A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem. Comput Oper Res. 2021;135: 105431. https:\/\/doi.org\/10.1016\/j.cor.2021.105431.","journal-title":"Comput Oper Res"},{"key":"9474_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104812","volume":"114","author":"M Marichelvam","year":"2020","unstructured":"Marichelvam M, Geetha M, Tosun M. An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors\u2014a case study. Comput Oper Res. 2020;114: 104812. https:\/\/doi.org\/10.1016\/j.cor.2019.104812.","journal-title":"Comput Oper Res"},{"issue":"1","key":"9474_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10845-015-1091-z","volume":"29","author":"B Zhao","year":"2015","unstructured":"Zhao B, Gao J, Chen K, Guo K. Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines. J Intell Manuf. 2015;29(1):93\u2013108. https:\/\/doi.org\/10.1007\/s10845-015-1091-z.","journal-title":"J Intell Manuf"},{"key":"9474_CR23","doi-asserted-by":"publisher","unstructured":"Jieran Y, Aimin W, Yan G, Xinyi S. An improved grey wolf optimizer for flexible job-shop scheduling problem. 2020 IEEE 11th international conference on mechanical and intelligent manufacturing technologies (ICMIMT); 2020. https:\/\/doi.org\/10.1109\/icmimt49010.2020.9041184","DOI":"10.1109\/icmimt49010.2020.9041184"},{"key":"9474_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106544","volume":"95","author":"Y Li","year":"2020","unstructured":"Li Y, Huang W, Wu R, Guo K. An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput. 2020;95: 106544. https:\/\/doi.org\/10.1016\/j.asoc.2020.106544.","journal-title":"Appl Soft Comput"},{"issue":"8","key":"9474_CR25","doi-asserted-by":"publisher","first-page":"618","DOI":"10.3390\/machines10080618","volume":"10","author":"W Yang","year":"2022","unstructured":"Yang W, Su J, Yao Y, Yang Z, Yuan Y. A novel hybrid whale optimization algorithm for flexible job-shop scheduling problem. Machines. 2022;10(8):618. https:\/\/doi.org\/10.3390\/machines10080618.","journal-title":"Machines"},{"issue":"9","key":"9474_CR26","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.1007\/s11431-022-2096-6","volume":"65","author":"X Li","year":"2022","unstructured":"Li X, Xie J, Ma Q, Gao L, Li P. Improved gray wolf optimizer for distributed flexible job shop scheduling problem. Sci China Technol Sci. 2022;65(9):2105\u201315. https:\/\/doi.org\/10.1007\/s11431-022-2096-6.","journal-title":"Sci China Technol Sci"},{"issue":"3","key":"9474_CR27","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1080\/18756891.2015.1017383","volume":"8","author":"N Shivasankaran","year":"2015","unstructured":"Shivasankaran N, Kumar PS, Raja KV. Hybrid sorting immune simulated annealing algorithm for flexible job shop scheduling. Int J Comput Intell Syst. 2015;8(3):455. https:\/\/doi.org\/10.1080\/18756891.2015.1017383.","journal-title":"Int J Comput Intell Syst"},{"issue":"3","key":"9474_CR28","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/0305215x.2021.1872067","volume":"54","author":"Y Cao","year":"2021","unstructured":"Cao Y, Shi H, Chang D. Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule. Eng Opt. 2021;54(3):387\u2013408. https:\/\/doi.org\/10.1080\/0305215x.2021.1872067.","journal-title":"Eng Opt"},{"key":"9474_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105263","volume":"132","author":"J Sun","year":"2021","unstructured":"Sun J, Zhang G, Lu J, Zhang W. A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times. Comput Oper Res. 2021;132: 105263. https:\/\/doi.org\/10.1016\/j.cor.2021.105263.","journal-title":"Comput Oper Res"},{"issue":"1","key":"9474_CR30","doi-asserted-by":"publisher","first-page":"15890","DOI":"10.1016\/j.ifacol.2017.08.2354","volume":"50","author":"W Bouazza","year":"2017","unstructured":"Bouazza W, Sallez Y, Beldjilali B. A distributed approach solving partially flexible job-shop scheduling problem with a Q-learning effect. IFAC-PapersOnLine. 2017;50(1):15890\u20135. https:\/\/doi.org\/10.1016\/j.ifacol.2017.08.2354.","journal-title":"IFAC-PapersOnLine"},{"key":"9474_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106208","volume":"91","author":"S Luo","year":"2020","unstructured":"Luo S. Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Appl Soft Comput. 2020;91: 106208. https:\/\/doi.org\/10.1016\/j.asoc.2020.106208.","journal-title":"Appl Soft Comput"},{"key":"9474_CR32","doi-asserted-by":"publisher","unstructured":"Xue T, Zeng P, Yu H. A reinforcement learning method for multi-AGV scheduling in manufacturing. In: 2018 IEEE International Conference on Industrial Technology (ICIT); 2018. https:\/\/doi.org\/10.1109\/icit.2018.8352413","DOI":"10.1109\/icit.2018.8352413"},{"issue":"13","key":"9474_CR33","doi-asserted-by":"publisher","first-page":"4049","DOI":"10.1080\/00207543.2022.2058432","volume":"60","author":"R Liu","year":"2022","unstructured":"Liu R, Piplani R, Toro C. Deep reinforcement learning for dynamic scheduling of a flexible job shop. Int J Prod Res. 2022;60(13):4049\u201369. https:\/\/doi.org\/10.1080\/00207543.2022.2058432.","journal-title":"Int J Prod Res"},{"issue":"4","key":"9474_CR34","doi-asserted-by":"publisher","first-page":"760","DOI":"10.3390\/pr10040760","volume":"10","author":"J Chang","year":"2022","unstructured":"Chang J, Yu D, Hu Y, He W, Yu H. Deep reinforcement learning for dynamic flexible job shop scheduling with random job arrival. Processes. 2022;10(4):760. https:\/\/doi.org\/10.3390\/pr10040760.","journal-title":"Processes"},{"issue":"4","key":"9474_CR35","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1109\/tase.2021.3104716","volume":"19","author":"S Luo","year":"2022","unstructured":"Luo S, Zhang L, Fan Y. Real-time scheduling for dynamic partial-no-wait multiobjective flexible job shop by deep reinforcement learning. IEEE Trans Autom Sci Eng. 2022;19(4):3020\u201338. https:\/\/doi.org\/10.1109\/tase.2021.3104716.","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"18","key":"9474_CR36","doi-asserted-by":"publisher","first-page":"9332","DOI":"10.3390\/app12189332","volume":"12","author":"CB Gil","year":"2022","unstructured":"Gil CB, Lee JH. Deep reinforcement learning approach for material scheduling considering high-dimensional environment of hybrid flow-shop problem. Appl Sci. 2022;12(18):9332. https:\/\/doi.org\/10.3390\/app12189332.","journal-title":"Appl Sci"},{"key":"9474_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109255","volume":"180","author":"Y Gui","year":"2023","unstructured":"Gui Y, Tang D, Zhu H, Zhang Y, Zhang Z. Dynamic scheduling for flexible job shop using a deep reinforcement learning approach. Comput Ind Eng. 2023;180: 109255. https:\/\/doi.org\/10.1016\/j.cie.2023.109255.","journal-title":"Comput Ind Eng"},{"key":"9474_CR38","doi-asserted-by":"publisher","unstructured":"Zhang C, Song W, Cao Z, Zhang J, Xu C. Learning to dispatch for job shop scheduling via deep reinforcement learning; 2020. https:\/\/doi.org\/10.48550\/arXiv.2010.12367.","DOI":"10.48550\/arXiv.2010.12367"},{"issue":"11","key":"9474_CR39","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 SH, 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. 2021;59(11):3360\u201377. https:\/\/doi.org\/10.1080\/00207543.2020.1870013.","journal-title":"Int J Prod Res"},{"issue":"2","key":"9474_CR40","doi-asserted-by":"publisher","first-page":"375","DOI":"10.2507\/ijsimm20-2-co7","volume":"20","author":"BA Han","year":"2021","unstructured":"Han BA, Yang JJ. A deep reinforcement learning based solution for flexible job shop scheduling problem. Int J Simul Model. 2021;20(2):375\u201386. https:\/\/doi.org\/10.2507\/ijsimm20-2-co7.","journal-title":"Int J Simul Model"},{"issue":"3","key":"9474_CR41","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1016\/j.aej.2021.01.030","volume":"60","author":"J Ren","year":"2021","unstructured":"Ren J, Ye C, Yang F. Solving flow-shop scheduling problem with a reinforcement learning algorithm that generalizes the value function with neural network. Alexandria Eng J. 2021;60(3):2787\u2013800. https:\/\/doi.org\/10.1016\/j.aej.2021.01.030.","journal-title":"Alexandria Eng J"},{"issue":"2","key":"9474_CR42","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/tii.2022.3189725","volume":"19","author":"W Song","year":"2023","unstructured":"Song W, Chen X, Li Q, Cao Z. Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans Ind Inf. 2023;19(2):1600\u201310. https:\/\/doi.org\/10.1109\/tii.2022.3189725.","journal-title":"IEEE Trans Ind Inf"},{"issue":"1","key":"9474_CR43","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10845-022-02037-5","volume":"35","author":"X Jing","year":"2022","unstructured":"Jing X, Yao X, Liu M, Zhou J. Two-agent reinforcement learning based on graph convolutional network for flexible job shop scheduling. J Intell Manuf. 2022;35(1):75\u201393. https:\/\/doi.org\/10.1007\/s10845-022-02037-5.","journal-title":"J Intell Manuf"},{"key":"9474_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Zhao W, Wang Y, Qian L, Meng X, Tang L. A multi-action deep reinforcement learning framework for flexible Job-shop scheduling problem. Expert Syst Appl. 2022;205: 117796. https:\/\/doi.org\/10.1016\/j.eswa.2022.117796.","journal-title":"Expert Syst Appl"},{"key":"9474_CR45","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1507.04296","author":"A Nair","year":"2015","unstructured":"Nair A, Srinivasan P, Blackwell S, Alcicek C, Fearon R, De Maria A, et al. Massively parallel methods for deep reinforcement learning. Comput Sci. 2015. https:\/\/doi.org\/10.48550\/arXiv.1507.04296.","journal-title":"Comput Sci"},{"issue":"4","key":"9474_CR46","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1080\/00207549408956978","volume":"32","author":"B Grabot","year":"1994","unstructured":"Grabot B, Geneste L. Dispatching rules in scheduling dispatching rules in scheduling: a fuzzy approach. Int J Prod Res. 1994;32(4):903\u201315. https:\/\/doi.org\/10.1080\/00207549408956978.","journal-title":"Int J Prod Res"},{"issue":"15","key":"9474_CR47","doi-asserted-by":"publisher","first-page":"4255","DOI":"10.1080\/00207543.2011.611539","volume":"50","author":"V Sels","year":"2012","unstructured":"Sels V, Gheysen N, Vanhoucke M. A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. Int J Prod Res. 2012;50(15):4255\u201370. https:\/\/doi.org\/10.1080\/00207543.2011.611539.","journal-title":"Int J Prod Res"},{"issue":"1","key":"9474_CR48","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar SS, Iskander W. A survey of scheduling rules. Oper Res. 1977;25(1):45\u201361. https:\/\/doi.org\/10.1287\/opre.25.1.45.","journal-title":"Oper Res"},{"issue":"3","key":"9474_CR49","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas V, Ruiz R, Framinan JM. A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. Eur J Oper Res. 2017;257(3):707\u201321. https:\/\/doi.org\/10.1016\/j.ejor.2016.09.055.","journal-title":"Eur J Oper Res"}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-024-09474-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-024-09474-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-024-09474-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T07:11:50Z","timestamp":1730877110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-024-09474-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,6]]},"references-count":49,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["9474"],"URL":"https:\/\/doi.org\/10.1007\/s10791-024-09474-1","relation":{},"ISSN":["2948-2992"],"issn-type":[{"value":"2948-2992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,6]]},"assertion":[{"value":"14 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"41"}}