{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:08:51Z","timestamp":1769810931679,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1023\/a:1024008726557","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T21:07:28Z","timestamp":1063400848000},"page":"355-372","source":"Crossref","is-referenced-by-count":42,"title":["Complexity of One-Cycle Robotic Flow-Shops"],"prefix":"10.1007","volume":"6","author":[{"given":"N.","family":"Brauner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Finke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5124576_CR1","volume-title":"Robots and Manufacturing Automation","author":"C. R. Asfahl","year":"1985","unstructured":"Asfahl, C. R., Robots and Manufacturing Automation, John Wiley & Sons, New York, NY, 1985."},{"key":"5124576_CR2","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0895-7177(01)00084-X","volume":"34","author":"N. Brauner","year":"2001","unstructured":"Brauner, N. and G. Finke, \u201cOn cycles and permutations in robotic cells,\u201d Math. Comp. Model., 34, 565-591 (2001).","journal-title":"Math. Comp. Model."},{"key":"5124576_CR3","first-page":"409","volume":"1","author":"N. Brauner","year":"1999","unstructured":"Brauner, N. and G. Finke, \u201cOptimal moves of the material handling system in a robotic flow-shop,\u201d in Proc. IEPM'99 Int. Conf. Indust. Eng. Prod. Management, Glasgow, 1, United Kingdom, 1999, pp. 409-417.","journal-title":"Proc. IEPM'99 Int. Conf. Indust. Eng. Prod. Management"},{"issue":"6","key":"5124576_CR4","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1287\/opre.45.6.952","volume":"45","author":"Y. Crama","year":"1997","unstructured":"Crama, Y. and J. van de Klundert, \u201cCyclic scheduling of identical parts in a robotic cell,\u201d Oper. Res., 45(6), 952-965 (1997a).","journal-title":"Oper. Res."},{"key":"5124576_CR5","first-page":"277","volume-title":"Ten Years LNMB","author":"Y. Crama","year":"1997","unstructured":"Crama, Y. and J. van de Klundert, \u201cRobotic flowshop scheduling is strongly NP-complete,\u201d in W. K. Klein Haneveld et al. (ed.), Ten Years LNMB, CWI Tract, Amsterdam, 1997b, pp. 277-286."},{"key":"5124576_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979."},{"key":"5124576_CR7","volume-title":"Shop-scheduling Problems with Transportation","author":"S. Knust","year":"1999","unstructured":"Knust, S., Shop-scheduling Problems with Transportation, PhD Thesis, Universit\u00e4t Osnabr\u00fcck, Germany, 1999."},{"key":"5124576_CR8","unstructured":"Lei, L. and T. J. Wang, \u201cA proof: The cyclic hoist-scheduling problem is NP-complete,\u201d Graduate School of Management, Rutgers University, Working Paper, #89-0016, 1989."},{"key":"5124576_CR9","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/S0377-2217(96)00272-X","volume":"97","author":"E. Levner","year":"1997","unstructured":"Levner, E., V. Kats, and V. E. Levit, \u201cAn improved algorithm for cyclic flowshop scheduling in a robotic cell,\u201d Eur. J. Oper. Res., 97, 500-508 (1997).","journal-title":"Eur. J. Oper. Res."},{"key":"5124576_CR10","first-page":"331","volume":"4","author":"S. P. Sethi","year":"1992","unstructured":"Sethi, S. P., C. Sriskandarajah, G. Sorger, J. Blazewicz, and W. Kubiak, \u201cSequencing of parts and robot moves in a robotic cell,\u201d Int. J. FMS, 4, 331-358 (1992).","journal-title":"Int. J. FMS"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024008726557.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024008726557\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024008726557.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:51:14Z","timestamp":1751633474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024008726557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["5124576"],"URL":"https:\/\/doi.org\/10.1023\/a:1024008726557","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}