{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:59:34Z","timestamp":1778349574332,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T00:00:00Z","timestamp":1358380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10845-013-0729-y","type":"journal-article","created":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T07:56:48Z","timestamp":1358323008000},"page":"1271-1287","source":"Crossref","is-referenced-by-count":60,"title":["Scheduling a single mobile robot for part-feeding tasks of production lines"],"prefix":"10.1007","volume":"25","author":[{"given":"Quang-Vinh","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Izabela","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenn","family":"Steger-Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ole","family":"Madsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,17]]},"reference":[{"issue":"1","key":"729_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0803002","volume":"3","author":"N Ascheuer","year":"1993","unstructured":"Ascheuer, N., Escudero, L. F., Grotschel, M., & Stoer, M. A. (1993). Cutting plane approach to the sequential ordering problem (with application to job scheduling in manufacturing). SIAM Journal of Optimization, 3(1), 25\u201342.","journal-title":"SIAM Journal of Optimization"},{"key":"729_CR2","volume-title":"Modeling and analysis of manufacturing systems","author":"RG Askin","year":"1993","unstructured":"Askin, R. G., & Stanridge, C. R. (1993). Modeling and analysis of manufacturing systems. New York: Wiley."},{"issue":"8","key":"729_CR3","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1080\/15458830.1996.11770707","volume":"28","author":"WB Carlton","year":"1996","unstructured":"Carlton, W. B., & Barnes, J. W. (1996). Solving the traveling salesman problem with time windows using tabu search. IIE Transactions, 28(8), 617\u2013629.","journal-title":"IIE Transactions"},{"issue":"7","key":"729_CR4","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","volume":"26","author":"G Carpaneto","year":"1980","unstructured":"Carpaneto, G., & Toth, P. (1980). Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science, 26(7), 736\u2013743.","journal-title":"Management Science"},{"issue":"4","key":"729_CR5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/212066.212081","volume":"21","author":"G Carpaneto","year":"1995","unstructured":"Carpaneto, G., Dell\u2019Amico, M., & Toth, P. (1995). Exact solution of large-scale, asymmetric traveling salesman problems. ACM Transactions on Mathematical Software, 21(4), 394\u2013409.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"729_CR6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","volume":"9","author":"S Chatterjee","year":"1996","unstructured":"Chatterjee, S., Carrera, C., & Lynch, L. A. (1996). Genetic algorithms and traveling salesman problems. European Journal of Operational Research, 9, 490\u2013510.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"729_CR7","doi-asserted-by":"crossref","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen, S. M., & Chien, C. Y. (2011). Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Systems with Applications, 38(12), 14439\u201314450.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"729_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF00114139","volume":"7","author":"C Chen","year":"1996","unstructured":"Chen, C., & Tseng, C. (1996). The path and location planning of workpieces by genetic algorithms. Journal of Intelligent Manufacturing, 7(1), 69\u201376.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"5","key":"729_CR9","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/S0305-0548(02)00050-3","volume":"30","author":"IC Choi","year":"2003","unstructured":"Choi, I. C., Kim, S. I., & Kim, H. S. (2003). A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. Computers and Operations Research, 30(5), 773\u2013786.","journal-title":"Computers and Operations Research"},{"issue":"1\u20134","key":"729_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018995317468","volume":"96","author":"Y Crama","year":"2000","unstructured":"Crama, Y., Kats, V., van de Klundert, J., & Levner, E. (2000). Cyclic scheduling in robotic flow shops. Annals of Operations Research, 96(1\u20134), 97\u2013124.","journal-title":"Annals of Operations Research"},{"key":"729_CR11","unstructured":"Dang, Q. V., Nielsen, I., & Steger-Jensen, K. (2011). Scheduling a single mobile robot for feeding tasks in a manufacturing cell. In Proceedings of international conference advances in production management systems, Stavanger, Norway"},{"key":"729_CR12","first-page":"85","volume-title":"A genetic algorithm-based heuristic for part-feeding mobile robot scheduling problem","author":"QV Dang","year":"2012","unstructured":"Dang, Q. V., Nielsen, I., & Bocewicz, G. (2012a). Trends in PAAMS, AISC 157. In J. M. C. Rodr\u00edguez (Ed.), A genetic algorithm-based heuristic for part-feeding mobile robot scheduling problem (pp. 85\u201392). Berlin, Heidelberg: Springer."},{"key":"729_CR13","first-page":"185","volume-title":"Scheduling a single mobile robot incorporated into production environment","author":"QV Dang","year":"2012","unstructured":"Dang, Q. V., Nielsen, I., & Steger-Jensen, K. (2012b). Ecoproduction & logistics\u2014new trends and business practices. In P. Golinska (Ed.), Scheduling a single mobile robot incorporated into production environment (pp. 185\u2013201). Berlin, Heidelberg: Springer."},{"issue":"1","key":"729_CR14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/70.68069","volume":"7","author":"Y Edan","year":"1991","unstructured":"Edan, Y., Flash, T., Peiper, U. M., Shmullevich, I., & Sarig, Y. (1991). Near-minimum-time task planning for fruit-picking robots. IEEE Transactions on Robotics and Automation, 7(1), 48\u201355.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"4","key":"729_CR15","doi-asserted-by":"crossref","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"X Geng","year":"2011","unstructured":"Geng, X., Chen, Z., Yang, W., Shi, D., & Zhao, K. (2011). Solving the travelling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Applied Soft Computing, 11(4), 3680\u20133689.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"729_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.cor.2011.04.003","volume":"39","author":"R Germs","year":"2012","unstructured":"Germs, R., Goldengorin, B., & Turkensteen, M. (2012). Lower tolerance-based branch and bound algorithms for the ATSP. Computer and Operations Research, 39(2), 291\u2013298.","journal-title":"Computer and Operations Research"},{"key":"729_CR17","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. New York: Addison-Wesley."},{"issue":"1","key":"729_CR18","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1080\/07408178708975370","volume":"19","author":"MH Han","year":"1987","unstructured":"Han, M. H., McGinnis, L. F., Shieh, J. S., & White, J. A. (1987). On sequencing retrievals in an automated storage\/retrieval system. IIE Transactions, 19(1), 56\u201366.","journal-title":"IIE Transactions"},{"issue":"2","key":"729_CR19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0893-6080(02)00017-5","volume":"15","author":"M Hasegawa","year":"2002","unstructured":"Hasegawa, M., & Ikeguchi, T. (2002). Solving large scale traveling salesman problems by chaotic neurodynamics. Neural Networks, 15(2), 271\u2013283.","journal-title":"Neural Networks"},{"issue":"3","key":"729_CR20","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/B:JIMS.0000026569.88191.46","volume":"15","author":"W Ho","year":"2004","unstructured":"Ho, W., & Ji, P. (2004). A hybrid genetic algorithm for component sequencing and feeder arrangement. Journal of Intelligent Manufacturing, 15(3), 307\u2013315.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1\u20132","key":"729_CR21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0166-218X(01)00273-6","volume":"119","author":"J Hurink","year":"2002","unstructured":"Hurink, J., & Knust, S. (2002). A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Applied Mathematics, 119(1\u20132), 181\u2013203.","journal-title":"Discrete Applied Mathematics"},{"issue":"5\u20136","key":"729_CR22","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1023\/A:1012204504849","volume":"12","author":"A Landrieu","year":"2001","unstructured":"Landrieu, A., Mati, Y., & Binder, Z. (2001). A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. Journal of Intelligent Manufacturing, 12(5\u20136), 497\u2013508.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"729_CR23","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10845-005-0019-4","volume":"17","author":"L Lin","year":"2006","unstructured":"Lin, L., Shinn, S. W., Gen, M., & Hwang, H. (2006). Network model and effective evolutionary approach for AGV dispatching in manufacturing system. Journal of Intelligent Manufacturing, 17(4), 465\u2013477.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"729_CR24","doi-asserted-by":"crossref","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu, F., & Zeng, G. (2009). Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Systems with Applications, 36(3), 6995\u20137001.","journal-title":"Expert Systems with Applications"},{"issue":"9","key":"729_CR25","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1016\/j.cor.2009.11.015","volume":"37","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2010","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., & Blum, C. (2010). Beam-ACO for the travelling salesman problem with time windows. Computers and Operations Research, 37(9), 1570\u20131583.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"729_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0954-1810(00)00008-X","volume":"14","author":"O Maimon","year":"2000","unstructured":"Maimon, O., Braha, D., & Seth, V. (2000). A neural network approach for a robot task sequencing problem. Artificial Intelligence in Engineering, 14(2), 175\u2013189.","journal-title":"Artificial Intelligence in Engineering"},{"issue":"4995","key":"729_CR27","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1126\/science.251.4995.754","volume":"251","author":"DL Miller","year":"1991","unstructured":"Miller, D. L., & Pekny, J. F. (1991). Exact solution of large asymmetric traveling salesman problems. Science, 251(4995), 754\u2013761.","journal-title":"Science"},{"issue":"3","key":"729_CR28","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon, C., Kim, J., Choi, G., & Seo, Y. (2002). An efficient genetic algorithm for the traveling salesman problem with precedence constraints. European Journal of Operational Research, 140(3), 606\u2013617.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"729_CR29","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10845-005-0010-0","volume":"17","author":"C Moon","year":"2006","unstructured":"Moon, C., Seo, Y., Yun, Y., & Gen, M. (2006). Adaptive genetic algorithm for advanced planning in manufacturing supply chain. Journal of Intelligent Manufacturing, 17(4), 509\u2013522.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"729_CR30","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/ijoc.1050.0145","volume":"19","author":"JW Ohlmann","year":"2007","unstructured":"Ohlmann, J. W., & Thomas, B. W. (2007). A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS Journal on Computing, 19(1), 80\u201390.","journal-title":"INFORMS Journal on Computing"},{"key":"729_CR31","doi-asserted-by":"crossref","unstructured":"Potvin, J. Y. (1996). Genetic algorithms for the traveling salesman problem. Annals of Operation Research, 63(3), 339\u2013370.","DOI":"10.1007\/BF02125403"},{"key":"729_CR32","doi-asserted-by":"crossref","unstructured":"Ratliff, H. D., & Rosenthal, A. S. (1983). Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem. Operations Research, 31(3), 507\u2013521.","DOI":"10.1287\/opre.31.3.507"},{"key":"729_CR33","unstructured":"Reuther, H., Simon, B. & Mads, H. (2010). 3D simulation used for evaluating the use and implementation of the mobile manipulator \u201dLittle Helper\u201d at Grundfos A\/S. In H. Hvolby (Ed.), Proceedings of the 12th international modern information technology in the innovation processes of the industrial enterprises ( MITIP) conference, 29\u201331 August 2010 (pp. 9\u201318). Aalborg: Centre for Logistics, Aalborg University."},{"key":"729_CR34","volume-title":"Inventory management and production planning and scheduling","author":"EA Silver","year":"1998","unstructured":"Silver, E. A., Pyke, D. F., & Peterson, R. (1998). Inventory management and production planning and scheduling. New York: Wiley."},{"issue":"1","key":"729_CR35","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder, L. V., & Daskin, M. S. (2006). A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research, 174(1), 38\u201353.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"729_CR36","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.rcim.2004.07.013","volume":"21","author":"R Su\u00e1rez","year":"2005","unstructured":"Su\u00e1rez, R., & Rosell, J. (2005). Feeding sequence selection in a manufacturing cell with four parallel machines. Robotics and Computer-Integrated Manufacturing, 21(3), 185\u2013195.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"729_CR37","volume-title":"Discrete optimization algorithms: With Pascal programs","author":"MM Syslo","year":"1983","unstructured":"Syslo, M. M., Deo, N., & Kowalik, J. S. (1983). Discrete optimization algorithms: With Pascal programs. New Jersey: Prentice-Hall."},{"key":"729_CR38","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth, P., & Vigo, D. (2002). The vehicle routing problem. Philadelphia: SIAM."},{"issue":"1\u20134","key":"729_CR39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"CF Tsai","year":"2004","unstructured":"Tsai, C. F., Tsai, C. W., & Tseng, C. C. (2004). A new hybrid heuristic approach for solving large traveling salesman problem. Information Sciences, 166(1\u20134), 67\u201381.","journal-title":"Information Sciences"},{"issue":"2","key":"729_CR40","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1008920519970","volume":"10","author":"Y Tsujimura","year":"1999","unstructured":"Tsujimura, Y., & Gen, M. (1999). Parts loading scheduling in a flexible forging machine using an advanced genetic algorithm. Journal of Intelligent Manufacturing, 10(2), 149\u2013159.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"729_CR41","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/j.ejor.2006.10.062","volume":"189","author":"M Turkensteen","year":"2008","unstructured":"Turkensteen, M., Ghosh, D., Goldengorin, B., & Sierksma, G. (2008). Tolerance-based branch and bound algorithms for the ATSP. European Journal of Operational Research, 189(3), 775\u2013788.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"729_CR42","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1016\/j.engappai.2008.01.003","volume":"21","author":"LN Xing","year":"2008","unstructured":"Xing, L. N., Chen, Y. W., Yang, K. W., Hou, F., Shen, X. S., & Cai, H. P. (2008). A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem. Engineering Applications of Artificial Intelligence, 21(8), 1370\u20131380.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"1","key":"729_CR43","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.rcim.2004.04.003","volume":"21","author":"PTh Zacharia","year":"2005","unstructured":"Zacharia, P Th, & Aspragathos, N. A. (2005). Optimal robot task scheduling based on genetic algorithms. Robotics and Computer-Integrated Manufacturing, 21(1), 67\u201379.","journal-title":"Robotics and Computer-Integrated Manufacturing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0729-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-013-0729-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0729-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:11:56Z","timestamp":1559268716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-013-0729-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,17]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["729"],"URL":"https:\/\/doi.org\/10.1007\/s10845-013-0729-y","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,17]]}}}