{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:55:00Z","timestamp":1772121300032,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10878-005-1778-8","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T06:09:50Z","timestamp":1124518190000},"page":"381-399","source":"Crossref","is-referenced-by-count":7,"title":["Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices"],"prefix":"10.1007","volume":"9","author":[{"given":"Vladimir G.","family":"Deineko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Steiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1778_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Upper Saddle River: New Jersey, 1993."},{"key":"1778_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0305-0548(98)00063-X","volume":"26","author":"Y.P. Aneja","year":"1999","unstructured":"Y.P. Aneja and H. Kamoun, \u201cScheduling of parts and robot activities in a two machine robotic cell,\u201d Computers and Operations Research, vol. 26, pp. 297\u2013312, 1999.","journal-title":"Computers and Operations Research"},{"key":"1778_CR3","first-page":"12","volume":"14","author":"V.Y. Burdyuk","year":"1976","unstructured":"V.Y. Burdyuk and V.N. Trofimov, \u201cGeneralization of the results of Gilmore and Gomory on the solution of the traveling salesman problem,\u201d Engineering Cybernetics, vol. 14, pp. 12\u201318, 1976.","journal-title":"Engineering Cybernetics"},{"key":"1778_CR4","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/S0036144596297514","volume":"40","author":"R.E. Burkard","year":"1998","unstructured":"R.E. Burkard, V.G. De\u00fc\u00edneko, R. van Dal, J.A.A. van der Veen, and G.J. Woeginger, \u201cWell-solvable special cases of the traveling salesman problem: A survey,\u201d SIAM Review, vol. 40, pp. 496\u2013546, 1998.","journal-title":"SIAM Review"},{"key":"1778_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"R.E. Burkard","year":"1996","unstructured":"R.E. Burkard, B. Klinz, and R. Rudolf, \u201cPerspectives of Monge properties in optimization,\u201d Discrete Applied Mathematics, vol. 70, pp. 95\u2013161, 1996.","journal-title":"Discrete Applied Mathematics"},{"key":"1778_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018995317468","volume":"96","author":"Y. Crama","year":"2000","unstructured":"Y. Crama, V. Kats, J. van de Klundert, and E. Levner, \u201cCyclic scheduling in robotic flowshops,\u201d Annals of Operations Research, vol. 96, pp. 97\u2013124, 2000.","journal-title":"Annals of Operations Research"},{"key":"1778_CR7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P.C. Gilmore","year":"1964","unstructured":"P.C. Gilmore and R.E. Gomory, \u201cSequencing a one state-variable machine: A solvable case of the traveling salesman problem,\u201d Operations Research, vol. 12, pp. 655\u2013679, 1964.","journal-title":"Operations Research"},{"key":"1778_CR8","first-page":"87","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"P.C. Gilmore","year":"1985","unstructured":"P.C. Gilmore, E.L. Lawler, and D.B. Shmoys, \u201cWell-solved special cases,\u201d in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, ch. 4, pp. 87\u2013143, John Wiley & Sons, Chichester, England, 1985."},{"key":"1778_CR9","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1287\/opre.45.3.421","volume":"45","author":"N.G. Hall","year":"1997","unstructured":"N.G. Hall, H. Kamoun, and C. Sriskandarajah, \u201cScheduling in robotic cells: Classification, two and three machine cells,\u201d Operations Research, vol. 45, pp. 421\u2013439, 1997.","journal-title":"Operations Research"},{"key":"1778_CR10","first-page":"489","volume-title":"The Traveling Salesman Problem and its Variations","author":"S.N. Kabadi","year":"2002","unstructured":"S.N. Kabadi, \u201cPolynomially solvable cases of the TSP,\u201d in G. Gutin and A.P. Punnen, eds., The Traveling Salesman Problem and its Variations, ch. 11, pp. 489\u2013583, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002."},{"key":"1778_CR11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal, \u201cOn the shortest spanning subtree of a graph and the traveling salesman problem,\u201d Proceedings of the American Mathematical Society, vol. 7, pp. 48\u201350, 1956.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"1778_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jos.95","volume":"5","author":"M. Middendorf","year":"2002","unstructured":"M. Middendorf and V.G. Timkovsky, \u201cOn scheduling cycle shops: Classification, complexity and approximation,\u201d Journal of Scheduling, vol. 5, pp. 135\u2013169, 2002.","journal-title":"Journal of Scheduling"},{"key":"1778_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(91)90118-2","volume":"40","author":"J.K. Park","year":"1991","unstructured":"J.K. Park, \u201cA special case of the n-vertex traveling-salesman problem that can be solved in O(n) time,\u201d Information Processing Letters, vol. 40, pp. 247\u2013254, 1991.","journal-title":"Information Processing Letters"},{"key":"1778_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"23","author":"S.S. Reddi","year":"1972","unstructured":"S.S. Reddi and C.V. Ramamoorthy, \u201cOn the flow-shop sequencing problem with no wait in process,\u201d Operational Research Quarterly, vol. 23, pp. 323\u2013331, 1972.","journal-title":"Operational Research Quarterly"},{"key":"1778_CR15","first-page":"118","volume":"22","author":"V.I. Sarvanov","year":"1980","unstructured":"V.I. Sarvanov, \u201cOn the complexity of minimizing a linear form on a set of cyclic permutations,\u201d Soviet Mathematics-Doklady, vol. 22, pp. 118\u2013120, 1980.","journal-title":"Soviet Mathematics-Doklady"},{"key":"1778_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01324886","volume":"4","author":"S.P. Sethi","year":"1992","unstructured":"S.P. Sethi, C. Sriskandarajah, G. Sorger, J. Blazewicz, and W. Kubiak, \u201cSequencing of parts and robot moves in a robotic cell,\u201d The International Journal of Flexible Manufacturing Systems, vol. 4, pp. 331\u2013358, 1992.","journal-title":"The International Journal of Flexible Manufacturing Systems"},{"key":"1778_CR17","volume-title":"Scheduling multi-component parts in robotic cells","author":"G. Steiner","year":"2002","unstructured":"G. Steiner and Z. Xue, \u201cScheduling multi-component parts in robotic cells,\u201d Working Paper, School of Business, McMaster University, Canada, 2002."},{"key":"1778_CR18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10951-005-5314-6","volume":"8","author":"G. Steiner","year":"2005","unstructured":"G. Steiner and Z. Xue, \u201cScheduling in reentrant robotic cells: Algorithms and complexity,\u201d Journal of Scheduling, vol. 8, pp. 25\u201348, 2005.","journal-title":"Journal of Scheduling"},{"key":"1778_CR19","unstructured":"Z. Xue, Shop Scheduling in Manufacturing Systems: Algorithms and Complexity, Ph.D. Thesis, McMaster University, Canada, 2004."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1778-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-1778-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1778-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:08Z","timestamp":1559261888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-1778-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["1778"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-1778-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}