{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:35:57Z","timestamp":1764333357563,"version":"3.40.5"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61603131"],"award-info":[{"award-number":["61603131"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2021JJ30146"],"award-info":[{"award-number":["2021JJ30146"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2021YFB2012100"],"award-info":[{"award-number":["2021YFB2012100"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10951-023-00792-8","type":"journal-article","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T22:01:42Z","timestamp":1699308102000},"page":"299-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving scheduling in multi-AGV systems by task prediction"],"prefix":"10.1007","volume":"27","author":[{"given":"Hongkai","family":"Fan","sequence":"first","affiliation":[]},{"given":"Dong","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2378-981X","authenticated-orcid":false,"given":"Bo","family":"Ouyang","sequence":"additional","affiliation":[]},{"given":"Zhi","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Yaonan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"key":"792_CR1","unstructured":"Araki, T., Sugiyama, Y., & Kasami, T. (1977). Complexity of the deadlock avoidance problem. In: 2nd IBM symposium on mathematical foundations of computer science, pp. 229\u2013257."},{"key":"792_CR2","doi-asserted-by":"crossref","unstructured":"Brezonik, L., Fister, I., & Podgorelec, V. (2018). Scrum task allocation based on particle swarm optimization, pp. 38\u201349.","DOI":"10.1007\/978-3-319-91641-5_4"},{"key":"792_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jmsy.2019.09.004","volume":"53","author":"G Chao","year":"2019","unstructured":"Chao, G., Zza, B., Sla, B., & Jga, B. (2019). Multi-objective particle swarm optimization for multi-workshop facility layout problem. Journal of Manufacturing Systems, 53, 32\u201348.","journal-title":"Journal of Manufacturing Systems"},{"key":"792_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y., Du, C., Chen, J., & Yu, W. (2021). Cooperative task allocation of multiple via vs based on greedy algorithm. In: 2021 IEEE 4th international conference on computer and communication engineering technology (CCET), pp. 408\u2013413.","DOI":"10.1109\/CCET52649.2021.9544170"},{"key":"792_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, H., Tan, P., Gao, J., & Scripps, J. (2006). Multistep-ahead time series prediction. In 2006 Pacific-Asia conference on knowledge discovery and data mining, pp. 765\u2013774. Springer.","DOI":"10.1007\/11731139_89"},{"issue":"8","key":"792_CR6","first-page":"63","volume":"443","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Zhuang, L., Zhu, L., Shao, X., & Wang, H. (2017). Research on path planing of parking system based on the improved dijkstra algorithm. Modern Manufacturing Engineering, 443(8), 63\u201367.","journal-title":"Modern Manufacturing Engineering"},{"issue":"2","key":"792_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10845-011-0612-7","volume":"24","author":"G Confessore","year":"2013","unstructured":"Confessore, G., Fabiano, M., & Liotta, G. (2013). A network flow based heuristic approach for optimising AGV movements. Journal of Intelligent Manufacturing, 24(2), 405\u2013419.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"792_CR8","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1016\/j.cor.2005.07.004","volume":"34","author":"AI Correa","year":"2007","unstructured":"Correa, A. I., Langevin, A., & Rousseau, L. M. (2007). Scheduling and routing of automated guided vehicles: A hybrid approach. Computers Operations Research, 34, 1688\u20131707.","journal-title":"Computers Operations Research"},{"key":"792_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., & Vapnik, V. N. (1995). Support vector networks. Machine Learning, 20, 273\u2013297.","journal-title":"Machine Learning"},{"key":"792_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1023\/B:FLEX.0000036032.41757.3d","volume":"15","author":"G Desaulniers","year":"2003","unstructured":"Desaulniers, G., Langevin, A., Riopel, D., & Villeneuve, B. (2003). Dispatching and conflict-free routing of automated guided vehicles: An exact approach. International Journal of Flexible Manufacturing Systems, 15, 309\u2013331.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"issue":"3","key":"792_CR11","first-page":"182","volume":"3","author":"E Diaconescu","year":"2008","unstructured":"Diaconescu, E. (2008). The use of NARX neural networks to predict chaotic time series. Wseas Transactions on computer research, 3(3), 182\u2013191.","journal-title":"Wseas Transactions on computer research"},{"key":"792_CR12","unstructured":"Fraunhofer Institute for Material Flow and Logistics (IML). The open transportation control system. https:\/\/www.opentcs.org\/en\/index.html. Accessed: 2019-08-30."},{"issue":"5","key":"792_CR13","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10845-013-0804-4","volume":"25","author":"M Gen","year":"2014","unstructured":"Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849\u2013866.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"6","key":"792_CR14","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/72.963769","volume":"12","author":"FA Gers","year":"2001","unstructured":"Gers, F. A., & Schmidhuber, E. (2001). LSTM recurrent networks learn simple context-free and context-sensitive languages. IEEE Transactions on Neural Networks, 12(6), 1333\u20131340.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"4","key":"792_CR15","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00291-006-0054-3","volume":"28","author":"M Grunow","year":"2006","unstructured":"Grunow, M., G\u00fcnther, H.-O., & Lehmann, M. (2006). Strategies for dispatching AGVs at automated seaport container terminals. OR Spectrum, 28(4), 587\u2013610.","journal-title":"OR Spectrum"},{"key":"792_CR16","doi-asserted-by":"crossref","unstructured":"Gueniche, T., Fournier-Viger, P., & Tseng, V. S. (2013). Compact prediction tree: A lossless model for accurate sequence prediction. In International conference on advanced data mining and applications pp. 177\u2013188. Berlin: Springer.","DOI":"10.1007\/978-3-642-53917-6_16"},{"key":"792_CR17","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.jmsy.2013.07.002","volume":"32","author":"M Hamzeei","year":"2013","unstructured":"Hamzeei, M., Farahani, R. Z., & Rashidi-Bejgan, H. (2013). An exact and a simulated annealing algorithm for simultaneously determining flow path and the location of p\/d stations in bidirectional path - sciencedirect. Journal of Manufacturing Systems, 32, 648\u2013654.","journal-title":"Journal of Manufacturing Systems"},{"key":"792_CR18","doi-asserted-by":"crossref","unstructured":"He, Z. (2011). Research on improved greedy algorithm for train rescheduling. In: 2011 seventh international conference on computational intelligence and security. IEEE, pp. 1197\u20131200.","DOI":"10.1109\/CIS.2011.265"},{"issue":"8","key":"792_CR19","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., & Schmidhuber, J. (1997). Long short-term memory. Neural Computation, 9(8), 1735\u20131780.","journal-title":"Neural Computation"},{"issue":"5","key":"792_CR20","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s00170-005-2529-9","volume":"29","author":"J Jerald","year":"2006","unstructured":"Jerald, J., Asokan, P., Saravanan, R., & Delphin Carolina Rani, A. (2006). Simultaneous scheduling of parts and automated guided vehicles in an FMS environment using adaptive genetic algorithm. The International Journal of Advanced Manufacturing Technology, 29(5), 584\u2013589.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"792_CR21","doi-asserted-by":"crossref","unstructured":"Klyne, A., & Merrick, K. (2015). Task allocation using particle swarm optimisation and anomaly detection to generate a dynamic fitness function. Springer, Cham, pp. 317\u2013329.","DOI":"10.1007\/978-3-319-26350-2_28"},{"key":"792_CR22","doi-asserted-by":"crossref","unstructured":"Kmiecik, W., Wojcikowski, M., Koszalka, L., & Kasprzak, A. (2010). Task allocation in mesh connected processors with local search meta-heuristic algorithms. In: Asian conference on intelligent information database systems.","DOI":"10.1007\/978-3-642-12101-2_23"},{"key":"792_CR23","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1287\/opre.41.6.1077","volume":"41","author":"NN Krishnamurthy","year":"1993","unstructured":"Krishnamurthy, N. N., & Karwan, B. M. H. (1993). Developing conflict-free routes for automated guided vehicles. Operations Research, 41, 1077\u20131090.","journal-title":"Operations Research"},{"key":"792_CR24","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jmsy.2019.02.003","volume":"51","author":"S Lee","year":"2019","unstructured":"Lee, S., Kahng, H. G., Cheong, T., & Kim, S. B. (2019). Iterative two-stage hybrid algorithm for the vehicle lifter location problem in semiconductor manufacturing - sciencedirect. Journal of Manufacturing Systems, 51, 106\u2013119.","journal-title":"Journal of Manufacturing Systems"},{"key":"792_CR25","doi-asserted-by":"crossref","unstructured":"Li, X., Liu, Z., & Tan, F. (2017). Multi-robot task allocation based on cloud ant colony algorithm. In I. V. Part (Ed.), Neural information processing\u201324th international conference, ICONIP 2017, Guangzhou, China, November 14\u201318, 2017 (pp. 3\u201310). Springer.","DOI":"10.1007\/978-3-319-70093-9_1"},{"key":"792_CR26","doi-asserted-by":"crossref","unstructured":"Liu, C., & Kroll, A. (2012). A centralized multi-robot task allocation for industrial plant inspection by using a* and genetic algorithms. In Proceedings of the 11th international conference on artificial intelligence and soft computing - volume Part II.","DOI":"10.1007\/978-3-642-29350-4_56"},{"issue":"11","key":"792_CR27","doi-asserted-by":"publisher","first-page":"3283","DOI":"10.1080\/00207543.2017.1306132","volume":"55","author":"JC Luo","year":"2017","unstructured":"Luo, J. C., Xing, K. Y., Zhou, M. C., Li, X. L., & Wang, X. N. (2017). Scheduling of deadlock and failure-prone automated manufacturing systems via hybrid heuristic search. International Journal of Production Research, 55(11), 3283\u20133293.","journal-title":"International Journal of Production Research"},{"key":"792_CR28","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/0169-2070(95)90035-7","volume":"11","author":"J Marquez","year":"1995","unstructured":"Marquez, J. (1995). Time series analysis. International Journal of Forecasting, 11, 494\u2013495.","journal-title":"International Journal of Forecasting"},{"key":"792_CR29","unstructured":"Mosteo, A. R., & Montano, L. (2006). Simulated annealing for multi-robot hierarchical task allocation with flexible constraints and objective functions. In: Workshop on network robot systems: Toward intelligent robotic systems integrated with environments at IROS 2006."},{"key":"792_CR30","unstructured":"Pandit, S. M., & Wu, S. M. (1983). Time series and system analysis with applications. Reprint of the orig. Wiley."},{"issue":"3","key":"792_CR31","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.camwa.2010.12.009","volume":"61","author":"H Rashidi","year":"2011","unstructured":"Rashidi, H., & Tsang, E. P. K. (2011). A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals. Computers and Mathematics with Applications, 61(3), 630\u2013641.","journal-title":"Computers and Mathematics with Applications"},{"key":"792_CR32","unstructured":"Reveliotis, S., & Masopust, T. (2019). Efficient liveness assessment for traffic states in open, irreversible, dynamically routed, zone-controlled guidepath-based transport systems. IEEE Transactions on Automatic Control (Early Access), pp. 1\u201316"},{"issue":"7","key":"792_CR33","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1080\/07408170008967423","volume":"32","author":"SA Reveliotis","year":"2000","unstructured":"Reveliotis, S. A. (2000). Conflict resolution in AGV systems. IIE Transactions, 32(7), 647\u2013659.","journal-title":"IIE Transactions"},{"key":"792_CR34","doi-asserted-by":"crossref","unstructured":"Sabattini, L., Digani, V., Lucchi, M., Secchi, C., & Fantuzzi, C. (2015). Mission assignment for multi-vehicle systems in industrial environments. IFAC-PapersOnLine, 48(19), 268\u2013273.","DOI":"10.1016\/j.ifacol.2015.12.044"},{"key":"792_CR35","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.jmsy.2013.01.001","volume":"32","author":"B Sharda","year":"2013","unstructured":"Sharda, B., & Banerjee, A. (2013). Robust manufacturing system design using multi objective genetic algorithms, petri nets and Bayesian uncertainty representation. Journal of Manufacturing Systems, 32, 315\u2013324.","journal-title":"Journal of Manufacturing Systems"},{"issue":"3","key":"792_CR36","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s11721-022-00213-0","volume":"16","author":"HS Shin","year":"2019","unstructured":"Shin, H. S., Li, T., & Segui-Gasco, P. (2019). Sample greedy based task allocation for multiple robot systems. Swarm Intelligence, 16(3), 233\u2013260.","journal-title":"Swarm Intelligence"},{"issue":"1","key":"792_CR37","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TASE.2009.2016350","volume":"7","author":"N Smolic-Rocak","year":"2009","unstructured":"Smolic-Rocak, N., Bogdan, S., Kovacic, Z., & Petrovic, T. (2009). Time windows based dynamic routing in multi-AGV systems. IEEE Transactions on Automation Science and Engineering, 7(1), 151\u2013155.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"792_CR38","unstructured":"Sutskever, I., Vinyals, O., & Le, Q. V. (2014) Sequence to sequence learning with neural networks. Advances in Neural Information Processing Systems, pp. 3104\u20133112."},{"issue":"3","key":"792_CR39","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1299\/jamdsm.4.701","volume":"4","author":"Y Tanaka","year":"2010","unstructured":"Tanaka, Y., Nishi, T., & Inuiguchi, M. (2010). Dynamic optimization of simultaneous dispatching and conflict-free routing for automated guided vehicles. Journal of Advanced Mechanical Design, Systems, and Manufacturing, 4(3), 701\u2013715.","journal-title":"Journal of Advanced Mechanical Design, Systems, and Manufacturing"},{"key":"792_CR40","unstructured":"Thapa, R. (2020). A survey on deep learning-based methodologies for solving combinatorial optimization problems."},{"issue":"1","key":"792_CR41","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TMECH.2014.2308930","volume":"9","author":"N Wu","year":"2004","unstructured":"Wu, N., & Zhou, M. (2004). Modeling and deadlock control of automated guided vehicle systems. IEEE\/ASME Transactions on Mechatronics, 9(1), 50\u201357.","journal-title":"IEEE\/ASME Transactions on Mechatronics"},{"issue":"11","key":"792_CR42","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J. Y. (1971). Finding the $$k$$ shortest loopless paths in a network. Management Science, 17(11), 712\u2013716.","journal-title":"Management Science"},{"key":"792_CR43","unstructured":"Yu, J., & Lavalle, S.M. (2015). Optimal multi-robot path planning on graphs: Structure and computational complexity. arXiv preprint, arXiv:1507.03289."},{"key":"792_CR44","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.jmsy.2021.05.002","volume":"60","author":"J Zajc","year":"2021","unstructured":"Zajc, J., & Maopolski, W. (2021). Structural on-line control policy for collision and deadlock resolution in multi-AGV systems. Journal of Manufacturing Systems, 60, 80\u201392.","journal-title":"Journal of Manufacturing Systems"},{"issue":"11","key":"792_CR45","first-page":"46","volume":"32","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Bo, C., & Chen, W. (2016). Dynamic routing of automated guided vehicles with time window. Microcomputer Applications, 32(11), 46\u201349.","journal-title":"Microcomputer Applications"},{"key":"792_CR46","doi-asserted-by":"publisher","first-page":"8255","DOI":"10.1007\/s13369-017-2820-8","volume":"43","author":"L Zhang","year":"2018","unstructured":"Zhang, L., Sun, J., Guo, C., & Zhang, H. (2018). A multi-swarm competitive algorithm based on dynamic task allocation particle swarm optimization. Arabian Journal for Science and Engineering, 43, 8255\u20138274.","journal-title":"Arabian Journal for Science and Engineering"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00792-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00792-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00792-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T07:19:19Z","timestamp":1747293559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00792-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["792"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00792-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"11 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}