{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T23:23:05Z","timestamp":1770506585400,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10951-005-5314-6","type":"journal-article","created":{"date-parts":[[2005,2,15]],"date-time":"2005-02-15T11:50:20Z","timestamp":1108468220000},"page":"25-48","source":"Crossref","is-referenced-by-count":13,"title":["Scheduling in Reentrant Robotic Cells: Algorithms and Complexity"],"prefix":"10.1007","volume":"8","author":[{"given":"George","family":"Steiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0305-0548(98)00063-X","volume":"26","author":"Y. P. Aneja","year":"1999","unstructured":"Aneja, Y. P. and H. Kamoun, ?Scheduling of parts and robot activities in a two machine robotic cell? Computers and Operations Research, 26, 297?312 (1999).","journal-title":"Computers and Operations Research"},{"key":"CR2","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, ?Cyclic scheduling of identical parts in a robotic cell? Operations Research, 45, 952?965 (1997).","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018995317468","volume":"96","author":"Y. Crama","year":"2000","unstructured":"Crama, Y., V. Kats, J. van de Klundert, and E. Levner, ?Cyclic scheduling in robotic flowshops? Annals of Operations Research, 96, 97?124 (2000).","journal-title":"Annals of Operations Research"},{"key":"CR4","unstructured":"Deineko, V. G., G. Steiner, and Z. Xue, ?New solvable cases of the traveling salesman problem on permuted Monge matrices? Working Paper, School of Business, McMaster University, Canada, 2003."},{"key":"CR5","volume-title":"Integrated Circuit Fabrication Technology","author":"D. J. Elliott","year":"1989","unstructured":"Elliott, D. J., Integrated Circuit Fabrication Technology, 2nd ed. McGraw-Hill, New York, NY, 1989.","edition":"2nd ed."},{"key":"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, CA, 1979."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P. C. Gilmore","year":"1964","unstructured":"Gilmore, P. C. and R. E. Gomory, ?Sequencing a one state-variable machine: A solvable case of the traveling salesman problem? Operations Research, 12, 655?679 (1964).","journal-title":"Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0272-6963(83)90004-9","volume":"3","author":"S. C. Graves","year":"1983","unstructured":"Graves, S. C., H. C. Meal, D. Stefek, and A. H. Zeghmi, ?Scheduling of re-entrant flow shops? Journal of Operations Management, 3, 197?207 (1983).","journal-title":"Journal of Operations Management"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1287\/opre.45.3.421","volume":"45","author":"N. G. Hall","year":"1997","unstructured":"Hall, N. G., H. Kamoun, and C. Sriskandarajah, ?Scheduling in robotic cells: Classification, two and three machine cells? Operations Research, 45, 421?439 (1997).","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0377-2217(96)00333-5","volume":"109","author":"N. G. Hall","year":"1998","unstructured":"Hall, N. G., H. Kamoun, and C. Sriskandarajah, ?Scheduling in robotic cells: Complexity and steady state analysis? European Journal of Operational Research, 109, 43?65 (1998).","journal-title":"European Journal of Operational Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(00)00316-4","volume":"112","author":"J. Hurink","year":"2001","unstructured":"Hurink, J. and S. Knust, ?Makespan minimization for flow-shop problems with transportation times and a single robot? Discrete Applied Mathematics, 112, 199?216 (2001).","journal-title":"Discrete Applied Mathematics"},{"key":"CR12","first-page":"257","volume":"39","author":"I. Ioachim","year":"2001","unstructured":"Ioachim, I., E. Sanlaville, and M. Lefebvre, ?The basic cyclic scheduling model for robotic flow shops? INFOR, 39, 257?277 (2001).","journal-title":"INFOR"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1080\/07408179108963836","volume":"23","author":"H. Kise","year":"1991","unstructured":"Kise, H., T. Shioyama, and T. Ibaraki, ?Automated two-machine flowshop scheduling: A solvable case? IIE Transactions, 23, 10?16 (1991).","journal-title":"IIE Transactions"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"354","DOI":"10.15807\/jorsj.34.354","volume":"34","author":"H. Kise","year":"1991","unstructured":"Kise, H., ?On an automated two-machine flowshop scheduling problem with infinite buffer? Journal of the Operations Research Society of Japan, 34, 354?361 (1991).","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.44.5.764","volume":"44","author":"W. Kubiak","year":"1996","unstructured":"Kubiak, W., S. X. C. Lou, and Y. Wang, ?Mean flow time minimization in reentrant job shops with hub? Operations Research, 44, 764?776 (1996).","journal-title":"Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0377-2217(84)90260-1","volume":"18","author":"V. Lev","year":"1984","unstructured":"Lev, V. and I. Adiri, ?V-shop scheduling? European Journal of Operational Research, 18, 51?56 (1984).","journal-title":"European Journal of Operational Research"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(98)00054-7","volume":"87","author":"E. Levner","year":"1998","unstructured":"Levner, E. and V. Kats, ?A parametric critical path problem and an application for cyclic scheduling? Discrete Applied Mathematics, 87, 149?158 (1998).","journal-title":"Discrete Applied Mathematics"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1057\/jors.1995.205","volume":"46","author":"E. Levner","year":"1995","unstructured":"Levner, E., K. Kogan, and O. Maimon, ?Flowshop scheduling of robotic cells with job-dependent transportation and set-up effects? Journal of the Operational Research Society, 46, 1447?1455 (1995).","journal-title":"Journal of the Operational Research Society"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jos.95","volume":"5","author":"M. Middendorf","year":"2002","unstructured":"Middendorf, M. and V. G. Timkovsky, ?On scheduling cycle shops: Classification, complexity and approximation? Journal of Scheduling, 5, 135?169 (2002).","journal-title":"Journal of Scheduling"},{"key":"CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6234-0","volume-title":"Printed Circuit Board Assembly: The Complete Works","author":"P. J. W. Noble","year":"1989","unstructured":"Noble, P. J. W., Printed Circuit Board Assembly: The Complete Works, Halsted Press, New York, NY, 1989."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01324886","volume":"4","author":"S. P. Sethi","year":"1992","unstructured":"Sethi, S. P., C. Sriskandarajah, G. Sorger, J. Blazewicz, and W. Kubiak, ?Sequencing of parts and robot moves in a robotic cell? The International Journal of Flexible Manufacturing Systems, 4, 331?358 (1992).","journal-title":"The International Journal of Flexible Manufacturing Systems"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1018952722784","volume":"76","author":"C. Sriskandarajah","year":"1998","unstructured":"Sriskandarajah, C., N. G. Hall, and H. Kamoun, ?Scheduling large robotic cells without buffers? Annals of Operations Research, 76, 287?321 (1998).","journal-title":"Annals of Operations Research"},{"key":"CR23","unstructured":"Van de Klundert, J., Scheduling Problems in Automated Manufacturing, Ph.D. Thesis, University of Limburg, Maastricht, The Netherlands, 1996."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.45.5.702","volume":"45","author":"M. Y. Wang","year":"1997","unstructured":"Wang, M. Y., S. P. Sethi, and S. L. van de Velde, ?Minimizing makespan in a class of reentrant shops? Operations Research, 45, 702?712 (1997).","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-5314-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-005-5314-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-5314-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:37Z","timestamp":1559468377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-005-5314-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["5314"],"URL":"https:\/\/doi.org\/10.1007\/s10951-005-5314-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}