{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:16:40Z","timestamp":1649143000315},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T00:00:00Z","timestamp":1295049600000},"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":[[2012,8]]},"DOI":"10.1007\/s10951-010-0221-x","type":"journal-article","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T14:36:09Z","timestamp":1295015769000},"page":"419-425","source":"Crossref","is-referenced-by-count":1,"title":["Cyclic Flowshop Scheduling with Operators and Robots: Vyacheslav Tanaev\u2019s Vision and Lasting Contributions"],"prefix":"10.1007","volume":"15","author":[{"given":"Vladimir","family":"Kats","sequence":"first","affiliation":[]},{"given":"Eugene","family":"Levner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,15]]},"reference":[{"issue":"2","key":"221_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0377-2217(99)00258-1","volume":"123","author":"A. Agnetis","year":"2000","unstructured":"Agnetis, A. (2000). Scheduling no-wait robotic cells with two and three machines. European Journal of Operational Research, 123(2), 303\u2013314.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"221_CR2","first-page":"224","volume":"7","author":"V. S. Aizenshtat","year":"1963","unstructured":"Aizenshtat, V. S. (1963). Multi-operator cyclic processes. Doklady of the National Academy of Sciences of Belarus, 7(4), 224\u2013227 (in\u00a0Russian).","journal-title":"Doklady of the National Academy of Sciences of Belarus"},{"key":"221_CR3","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1115\/1.3454046","volume":"101","author":"R. Bedini","year":"1979","unstructured":"Bedini, R., Lisini, G. G., & Sterpos, P. (1979). Optimal programming of working cycles for industrial robots. The ASME Journal of Mechanical Design, 101, 250\u2013257.","journal-title":"The ASME Journal of Mechanical Design"},{"key":"221_CR4","first-page":"5","volume":"2","author":"A. Sh. Blokh","year":"1966","unstructured":"Blokh, A. Sh., & Tanaev, V. S. (1966). Multioperator processes. Izvstiya Akademii Nauk Belarusi, Seriya Fizika-Matematycnyk Nauk, 2, 5\u201311 (in\u00a0Russian).","journal-title":"Izvstiya Akademii Nauk Belarusi, Seriya Fizika-Matematycnyk Nauk"},{"issue":"13","key":"221_CR5","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(13), 2480\u20132492.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"221_CR6","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.orl.2003.10.012","volume":"33","author":"A. Che","year":"2005","unstructured":"Che, A., & Chu, C. (2005). A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line. Operations Research Letters, 33(3), 274\u2013284.","journal-title":"Operations Research Letters"},{"issue":"1","key":"221_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2008.10.035","volume":"199","author":"A. Che","year":"2009","unstructured":"Che, A., & Chu, C. (2009). Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots. European Journal of Operational Research, 199(1), 77\u201388.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"221_CR8","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. (2002a). 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":"221_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0377-2217(02)00175-3","volume":"145","author":"A. Che","year":"2002","unstructured":"Che, A., Chu, C., & Levner, E. (2002b). 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":"221_CR10","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1080\/00207540802552659","volume":"48","author":"A. Che","year":"2010","unstructured":"Che, A., Yan, P., Yang, N., & Chu, C. (2010a). Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times. International Journal of Production Research, 48(5), 1225\u20131243.","journal-title":"International Journal of Production Research"},{"key":"221_CR11","author":"A. Che","year":"2010","unstructured":"Che, A., Yan, P., Yang, N., & Chu, C. (2010b). A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows. International Journal of Production Research. doi: 10.1080\/00207540903225205 .","journal-title":"International Journal of Production Research"},{"key":"221_CR12","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/70.660860","volume":"14","author":"H. Chen","year":"1998","unstructured":"Chen, H., Chu, C., & Proth, J.-M. (1998). Cyclic scheduling of a hoist with time window constrains. IEEE Transactions on Robotics and Automation, 14, 144\u2013152.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"221_CR13","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, 453\u2013468.","journal-title":"Journal of Scheduling"},{"key":"221_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1057\/jors.1962.10","volume":"13","author":"R. A. Cuninghame-Green","year":"1962","unstructured":"Cuninghame-Green, R. A. (1962). Describing industrial processes with interface and approximating their steady-state behaviour. Operational Research Quarterly, 13, 95\u2013100.","journal-title":"Operational Research Quarterly"},{"issue":"4","key":"221_CR15","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1137\/S003614450444138X","volume":"47","author":"M. N. Dawande","year":"2005","unstructured":"Dawande, M. N., Geismer, H. N., & Sethi, S. P. (2005). Dominance of cyclic solutions and challenges in the scheduling of robotic cells. SIAM Review, 47(4), 709\u2013721.","journal-title":"SIAM Review"},{"key":"221_CR16","volume-title":"Throughput optimization in robotic cells","author":"M. N. Dawande","year":"2007","unstructured":"Dawande, M. N., Geismer, H. N., Sethi, S. P., & Sriskandarajah, C. (2007). Throughput optimization in robotic cells. New York: Springer."},{"issue":"2\u20133","key":"221_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(94)00102-J","volume":"57","author":"C. Hanen","year":"1995","unstructured":"Hanen, C., & Munier-Kordon, A. (1995). A study of the cyclic scheduling problem on parallel processors. Discrete Applied Mathematics, 57(2\u20133), 167\u2013192.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"221_CR18","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.dam.2008.03.018","volume":"157","author":"C. Hanen","year":"2009","unstructured":"Hanen, C., & Munier-Kordon, A. (2009). Periodic schedules for linear precedence constraints. Discrete Applied Mathematics, 157(2), 280\u2013291.","journal-title":"Discrete Applied Mathematics"},{"key":"221_CR19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R. M. Karp","year":"1978","unstructured":"Karp, R. M. (1978). A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23, 309\u2013311.","journal-title":"Discrete Mathematics"},{"key":"221_CR20","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","volume":"3","author":"R. M. Karp","year":"1981","unstructured":"Karp, R. M., & Orlin, J. B. (1981). Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics, 3, 37\u201345.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"221_CR21","first-page":"445","volume":"39","author":"A. V. Karzanov","year":"1978","unstructured":"Karzanov, A. V., & Livshits, E. M. (1978). Minimal quantity of operators for serving a homogeneous linear technological process. Automation and Remote Control, 39(3), 445\u2013450.","journal-title":"Automation and Remote Control"},{"key":"221_CR22","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1018980928352","volume":"69","author":"V. Kats","year":"1997","unstructured":"Kats, V., & Levner, E. (1997a). Minimizing the number of robots to meet a given cyclic schedule. Annals of Operations Research, 69, 209\u2013226.","journal-title":"Annals of Operations Research"},{"key":"221_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0167-6377(97)00036-9","volume":"21","author":"V. Kats","year":"1997","unstructured":"Kats, V., & Levner, E. (1997b). A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling. Operations Research Letters, 21, 171\u2013179.","journal-title":"Operations Research Letters"},{"issue":"1","key":"221_CR24","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 in a robotic production line. Journal of Scheduling, 5(1), 23\u201341.","journal-title":"Journal of Scheduling"},{"key":"221_CR25","author":"V. Kats","year":"2010","unstructured":"Kats, V., & Levner, E. (2010). Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling. Computers and Industrial Engineering. doi: 10.1016\/j.cie.2010.04.009 .","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"221_CR26","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":"1","key":"221_CR27","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/opre.45.1.72","volume":"45","author":"T. E. Lee","year":"1997","unstructured":"Lee, T. E., & Pozner, M. E. (1997). Performance measures and schedules in periodic job shops. Operations Research, 45(1), 72\u201391.","journal-title":"Operations Research"},{"key":"221_CR28","unstructured":"Lei, L., & Wang, T. J. (1989). A proof: the cyclic scheduling problem is NP-complete. Working Paper no. 89-0016, Rutgers University, April."},{"key":"221_CR29","first-page":"115","volume-title":"Proceedings of the international working conference IFIP WG5.7 on managing concurrent manufacturing to improve industrial performance","author":"E. Levner","year":"1995","unstructured":"Levner, E., & Kats, V. (1995). Efficient algorithms for cyclic robotic flowshop problem. In R. Storch (Ed.), Proceedings of the international working conference IFIP WG5.7 on managing concurrent manufacturing to improve industrial performance (pp. 115\u2013123). Seattle: University of Washington."},{"key":"221_CR30","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/S0377-2217(96)00272-X","volume":"197","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, 197, 500\u2013508.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"221_CR31","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0165-0114(96)00387-9","volume":"98","author":"E. Levner","year":"1998","unstructured":"Levner, E., Meyzin, L., & Ptuskin, A. (1998). Periodic scheduling of a transporting robot under incomplete input data: a\u00a0fuzzy approach. Fuzzy Sets and Systems, 98(3), 255\u2013266.","journal-title":"Fuzzy Sets and Systems"},{"issue":"4","key":"221_CR32","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.orl.2005.07.010","volume":"34","author":"J. M. Y. Leung","year":"2006","unstructured":"Leung, J. M. Y., & Levner, E. (2006). An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times. Operations Research Letters, 34(4), 465\u2013472.","journal-title":"Operations Research Letters"},{"issue":"2","key":"221_CR33","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1287\/opre.1040.0167","volume":"53","author":"J. Liu","year":"2005","unstructured":"Liu, J., & Jiang, Y. (2005). An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem. Operations Research, 53(2), 313\u2013327.","journal-title":"Operations Research"},{"key":"221_CR34","first-page":"151","volume":"5","author":"E. M. Livshits","year":"1974","unstructured":"Livshits, E. M., Mikhailetsky, Z. N., & Chervyakov, E. V. (1974). A scheduling problem in an automated flow line with an automated operator. Computational Mathematics and Computerized Systems, 5, 151\u2013155 (in Russian).","journal-title":"Computational Mathematics and Computerized Systems"},{"key":"221_CR35","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N. (1979). Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4, 414\u2013424.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"221_CR36","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/05695557608975070","volume":"8","author":"L. W. Phillips","year":"1976","unstructured":"Phillips, L. W., & Unger, P. S. (1976). Mathematical programming solution of a hoist scheduling program. AIIE Transactions, 8(2), 219\u2013225.","journal-title":"AIIE Transactions"},{"issue":"6","key":"221_CR37","first-page":"1303","volume":"157","author":"I. V. Romanovskii","year":"1964","unstructured":"Romanovskii, I. V. (1964). Asymptotic behaviour of recurrence relations of dynamic programming and optimal stationary control. Doklady of the Soviet Academy of Sciences, 157(6), 1303\u20131306 (in\u00a0Russian).","journal-title":"Doklady of the Soviet Academy of Sciences"},{"issue":"2","key":"221_CR38","first-page":"66","volume":"3","author":"I. V. Romanovskii","year":"1967","unstructured":"Romanovskii, I. V. (1967). Optimization of stationary control of a discrete deterministic process. Kybernetika (Cybernetics), 3(2), 66\u201378.","journal-title":"Kybernetika (Cybernetics)"},{"issue":"9","key":"221_CR39","first-page":"541","volume":"6","author":"D. A. Suprunenko","year":"1962","unstructured":"Suprunenko, D. A., Aizenshtat, V. S., & Metel\u2019sky, A. S. (1962). A\u00a0multistage technological process. Doklady of the National Academy of Sciences of Belarus, 6(9), 541\u2013522 (in\u00a0Russian).","journal-title":"Doklady of the National Academy of Sciences of Belarus"},{"issue":"3","key":"221_CR40","first-page":"111","volume":"7","author":"V. S. Tanaev","year":"1964","unstructured":"Tanaev, V. S. (1964). A scheduling problem for a flowshop line with a single operator. Inzhenerno-Fizicheskii Zhurnal (Journal of Engineering Physics), 7(3), 111\u2013114 (in\u00a0Russian).","journal-title":"Inzhenerno-Fizicheskii Zhurnal (Journal of Engineering Physics)"},{"key":"221_CR41","volume-title":"Introduction to scheduling theory","author":"V. S. Tanaev","year":"1975","unstructured":"Tanaev, V. S., & Shkurba, V. V. (1975). Introduction to scheduling theory. Moscow: Nauka (in\u00a0Russian)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0221-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0221-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0221-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:45Z","timestamp":1559453985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0221-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,15]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["221"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0221-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,15]]}}}