{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T16:53:22Z","timestamp":1723568002723},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,4]],"date-time":"2010-03-04T00:00:00Z","timestamp":1267660800000},"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":[[2011,6]]},"DOI":"10.1007\/s10951-010-0166-0","type":"journal-article","created":{"date-parts":[[2010,3,3]],"date-time":"2010-03-03T20:52:01Z","timestamp":1267649521000},"page":"267-279","source":"Crossref","is-referenced-by-count":10,"title":["Parametric algorithms for 2-cyclic robot scheduling with interval processing times"],"prefix":"10.1007","volume":"14","author":[{"given":"Vladimir","family":"Kats","sequence":"first","affiliation":[]},{"given":"Eugene","family":"Levner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,4]]},"reference":[{"key":"166_CR1","first-page":"281","volume-title":"Operations research models and applications","author":"J. Blazewicz","year":"1989","unstructured":"Blazewicz, J., Sethi, S. P., & Sriskandarajah, C. (1989). Scheduling of robot moves and parts in a robotic cell. In K. E. Stecke & R.\u00a0Suri (Eds.), Operations research models and applications (pp. 281\u2013286). Amsterdam: Elsevier."},{"key":"166_CR2","doi-asserted-by":"crossref","first-page":"2480","DOI":"10.1016\/j.dam.2008.03.021","volume":"156","author":"N. Brauner","year":"2008","unstructured":"Brauner, N. (2008). Identical part production in cyclic robotic cells: Concepts, overview and open questions. Discrete Applied Mathematics, 156, 2480\u20132492.","journal-title":"Discrete Applied Mathematics"},{"key":"166_CR3","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., & Finke, G. (2001a). Cycles and permutations in robotic cells. Mathematical and Computer Modeling, 34, 565\u2013591.","journal-title":"Mathematical and Computer Modeling"},{"key":"166_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0925-5273(01)00132-3","volume":"74","author":"N. Brauner","year":"2001","unstructured":"Brauner, N., & Finke, G. (2001b). Optimal moves of the material handling system in a robotic cell. International Journal of Production Economics, 74, 269\u2013277.","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"166_CR5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1023\/A:1024008726557","volume":"6","author":"N. Brauner","year":"2003","unstructured":"Brauner, N., Finke, G., & Kubiak, W. (2003). Complexity of one-cycle robotic flow shops. Journal of Scheduling, 6(4), 355\u2013371.","journal-title":"Journal of Scheduling"},{"key":"166_CR6","first-page":"31-1","volume-title":"Algorithms and theory of computation handbook","author":"V. Chandru","year":"1999","unstructured":"Chandru, V., & Rao, M. R. (1999). Linear programming. In M. J. Atallah (Ed.), Algorithms and theory of computation handbook (pp. 31-1\u201331.37). New York: CRC Press."},{"issue":"1","key":"166_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/70.988976","volume":"18","author":"A. Che","year":"2002","unstructured":"Che, A., Chu, C., & Chu, F. (2002). Multicyclic hoist scheduling with constant processing times. IEEE Transactions on Robotics and Automation, 18(1), 69\u201380.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"1","key":"166_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0377-2217(02)00175-3","volume":"145","author":"A. Che","year":"2003","unstructured":"Che, A., Chu, C., & Levner, E. (2003). A polynomial algorithm for 2-degree cyclic robot scheduling. European Journal of Operational Research, 145(1), 31\u201344.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"166_CR9","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10951-006-8501-1","volume":"9","author":"C. Chu","year":"2006","unstructured":"Chu, C. (2006). A faster polynomial algorithm for 2-cyclic robotic scheduling. Journal of Scheduling, 9(5), 453\u2013468.","journal-title":"Journal of Scheduling"},{"issue":"1\u20134","key":"166_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\u00a0de Klundert, J., & Levner, E. (2000). Cyclic scheduling in robotic flowshop. Annals of Operations Research, 96(1\u20134), 97\u2013123.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"166_CR11","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1287\/msom.4.4.296.5731","volume":"4","author":"M. Dawande","year":"2002","unstructured":"Dawande, M., Sriskandarajah, C., & Sethi, S. P. (2002). On throughput maximization in constant travel time robotic cells. Manufacturing and Service Operations Management, 4(4), 296\u2013312.","journal-title":"Manufacturing and Service Operations Management"},{"key":"166_CR12","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10951-005-2861-9","volume":"8","author":"M. Dawande","year":"2005","unstructured":"Dawande, M., Geismar, H. N., Sethi, S. P., & Sriskandarajah, C. (2005). Sequencing and scheduling in robotic cells: Recent developments. Journal of Scheduling, 8, 387\u2013426.","journal-title":"Journal of Scheduling"},{"key":"166_CR13","volume-title":"Througput optimization in robotic cells","author":"M. W. Dawande","year":"2007","unstructured":"Dawande, M. W., Geismar, H. N., Sethi, S. P., & Sriskandarajah, C. (2007). Througput optimization in robotic cells. Berlin: Springer."},{"issue":"1","key":"166_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/07408170902789092","volume":"42","author":"M. W. Dawande","year":"2010","unstructured":"Dawande, M. W., Geismar, H. N., Pinedo, M., & Sriskandarajah, C. (2010). Throughput optimization in dual-gripper interval robotic cells. IIE Transactions, 42(1), 1\u201315.","journal-title":"IIE Transactions"},{"issue":"2","key":"166_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.ejor.2003.09.013","volume":"162","author":"H. N. Geismar","year":"2005","unstructured":"Geismar, H. N., Dawande, M., & Sriskandarajah, C. (2005). Approximation algorithms for k-unit cyclic solutions in robotic cells. European Journal of Operational Research, 162(2), 291\u2013309.","journal-title":"European Journal of Operational Research"},{"key":"166_CR16","first-page":"543","volume-title":"Handbook of industrial robotics","author":"N. G. Hall","year":"2007","unstructured":"Hall, N. G. (2007). Operations research techniques for robotic systems. In S. Y. Nof (Ed.), Handbook of industrial robotics (Vol. II, pp. 543\u2013577). New York: Wiley."},{"key":"166_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01324877","volume":"7","author":"I. Ioachim","year":"1995","unstructured":"Ioachim, I., & Soumis, F. (1995). Schedule efficiency in a robotic production cell. International Journal of Flexible Manufacturing Systems, 7, 5\u201326.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"key":"166_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jos.92","volume":"5","author":"V. Kats","year":"2002","unstructured":"Kats, V., & Levner, E. (2002). Cyclic scheduling on a robotic production line. Journal of Scheduling, 5, 23\u201341.","journal-title":"Journal of Scheduling"},{"key":"166_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/978-3-540-88636-5_62","volume-title":"Proceedings of MICAI-2008","author":"V. Kats","year":"2008","unstructured":"Kats, V., & Levner, E. (2008). Parametric algorithms for cyclic scheduling problems with applications to robotics. In A. Gelbukh & E. F. Morales (Eds.), Lecture notes in computer science : Vol. 5317. Proceedings of MICAI-2008 (pp. 653\u2013663). Berlin: Springer."},{"issue":"2","key":"166_CR20","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.dam.2008.03.025","volume":"157","author":"V. Kats","year":"2009","unstructured":"Kats, V., & Levner, E. (2009). A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. Discrete Applied Mathematics, 157(2), 339\u2013355.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"166_CR21","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1109\/70.781993","volume":"15","author":"V. Kats","year":"1999","unstructured":"Kats, V., Levner, E., & Meyzin, L. (1999). Multiple-part cyclic hoist scheduling using a sieve method. IEEE Transactions on Robotics and Automation, 15(4), 704\u2013713.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"3","key":"166_CR22","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1016\/j.ejor.2006.07.030","volume":"187","author":"V. Kats","year":"2008","unstructured":"Kats, V., Lei, L., & Levner, E. (2008). Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence and time-window constraints. European Journal of Operational Research, 187(3), 1196\u20131211.","journal-title":"European Journal of Operational Research"},{"key":"166_CR23","unstructured":"Lei, L., & Wang, T. J. (1989). A proof: the cyclic hoist-scheduling problem is NP-complete (Working paper #89-0016). Graduate School of Management, Rutgers University, New Jersey."},{"issue":"2","key":"166_CR24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/07408179408966593","volume":"26","author":"L. Lei","year":"1994","unstructured":"Lei, L., & Wang, T. J. (1994). Determining optimal cyclic hoist schedules in a single-hoist electroplating line. IEE Transactions, 26(2), 25\u201333.","journal-title":"IEE Transactions"},{"key":"166_CR25","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., & Kats, V. (1998). A parametric critical path problem and an application for cyclic scheduling. Discrete Applied Mathematics, 87, 149\u2013158.","journal-title":"Discrete Applied Mathematics"},{"key":"166_CR26","first-page":"101","volume-title":"Intelligent scheduling of robots and FMS","author":"E. Levner","year":"1996","unstructured":"Levner, E., Kats, V., & Sriskandarajah, C. (1996). A geometric algorithm for finding two-unit cyclic schedules in no-wait robotic flowshop. In E. Levner (Ed.), Intelligent scheduling of robots and FMS (pp. 101\u2013112). Holon: HAIT Press."},{"key":"166_CR27","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., Kats, V., & Levit, V. (1997). An improved algorithm for cyclic flowshop scheduling in a robotic cell. European Journal of Operational Research, 97, 500\u2013508.","journal-title":"European Journal of Operational Research"},{"key":"166_CR28","first-page":"857","volume-title":"The handbook of discrete and computational geometry","author":"D. M. Mount","year":"2004","unstructured":"Mount, D. M. (2004). Geometric intersection. In J. E. Goodman & J. O\u2019Rourke (Eds.), The handbook of discrete and computational geometry (pp. 857\u2013876). Boca Raton: Chapman&Hall\/CRC."},{"key":"166_CR29","first-page":"271","volume-title":"Mathematics: frontiers and perspectives","author":"S. Smale","year":"2000","unstructured":"Smale, S. (2000). Mathematical problems for the next century. In V.\u00a0Arnold, M. Atiyah, P. Lax, & B. Mazur (Eds.), Mathematics: frontiers and perspectives (pp. 271\u2013294). Providence: American Mathematics Society."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0166-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0166-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0166-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0166-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,4]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["166"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0166-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,4]]}}}