{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:59:22Z","timestamp":1725541162917},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642104879"},{"type":"electronic","value":"9783642104886"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10488-6_31","type":"book-chapter","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T07:55:13Z","timestamp":1258444513000},"page":"310-321","source":"Crossref","is-referenced-by-count":9,"title":["On Undecidability of Cyclic Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Grzegorz","family":"Bocewicz","sequence":"first","affiliation":[]},{"given":"Robert","family":"W\u00f3jcik","sequence":"additional","affiliation":[]},{"given":"Zbigniew","family":"Banaszak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/978-3-540-69052-8_80","volume-title":"New Frontiers in Applied Artificial Intelligence","author":"I. Bach","year":"2008","unstructured":"Bach, I., Bocewicz, G., Banaszak, Z.: Constraint Programming Approach to Time-Window and Multi-Resource-Constrained Projects Portfolio Prototyping. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds.) IEA\/AIE 2008. LNCS (LNAI), vol.\u00a05027, pp. 767\u2013776. Springer, Heidelberg (2008)"},{"key":"31_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-540-72830-6_60","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"G. Bocewicz","year":"2007","unstructured":"Bocewicz, G., Banaszak, Z., W\u00f3jcik, R.: Design of Admissible Schedules for AGV Systems with Constraints: a Logic-Algebraic Approach. In: Nguyen, N.T., Grzech, A., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2007. LNCS (LNAI), vol.\u00a04496, pp. 578\u2013587. Springer, Heidelberg (2007)"},{"key":"31_CR3","unstructured":"Bart\u00e1k, R.: Incomplete Depth-First Search Techniques: A Short Survey. In: Figwer, J. (ed.) Proceedings of the 6th Workshop on Constraint Programming for Decision and Control, pp. 7\u201314 (2004)"},{"issue":"3\/4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1504\/IJLSM.2009.022496","volume":"5","author":"R. Birger","year":"2009","unstructured":"Birger, R., El-Houssaine, A., Wout, D.: Cyclic Scheduling of Multiple Tours with Multiple Frequencies for a Single Vehicle. International Journal of Logistics Systems and Management\u00a05(3\/4), 214\u2013227 (2009)","journal-title":"International Journal of Logistics Systems and Management"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0377-2217(99)00391-4","volume":"125","author":"X. Cai","year":"2000","unstructured":"Cai, X., Li, K.N.: A Genetic Algorithm for Scheduling Staff of Mixed Skills under Multi-criteria. European Journal of Operational Research\u00a0125, 359\u2013369 (2000)","journal-title":"European Journal of Operational Research"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2307\/2318447","volume":"80","author":"M. Davis","year":"1973","unstructured":"Davis, M.: Hilbert\u2019s Tenth Problem is Unsolvable. Amer. Math. Monthly\u00a080, 233\u2013269 (1973)","journal-title":"Amer. Math. Monthly"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"A.T. Ernst","year":"2009","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Owens, B., Sier, D.: An Annotated Bibliography of Personnel Scheduling and Rostering. Annals of Operations Research\u00a0127, 21\u2013144 (2009)","journal-title":"Annals of Operations Research"},{"issue":"5","key":"31_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/70.466609","volume":"11","author":"B. Gaujal","year":"1995","unstructured":"Gaujal, B., Jafari, M., Baykal-Gursoy, M., Alpan, G.: Allocation Sequences of Two Processes Sharing a Resource. IEEE Trans. on Robotics and Automation\u00a011(5), 353\u2013748 (1995)","journal-title":"IEEE Trans. on Robotics and Automation"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0049-237X(08)71882-2","volume-title":"Proceedings of the Herbrand Symposium, Marseilles","author":"J.P. Jones","year":"1982","unstructured":"Jones, J.P., Matiyasevich, Y.V.: Exponential Diophantine Representation of Recursively Enumerable Sets. In: Proceedings of the Herbrand Symposium, Marseilles, pp. 159\u2013177. North-Holland, Amsterdam (1982)"},{"key":"31_CR10","volume-title":"Planning and Scheduling in Manufacturing and Services","author":"M.L. Pinedo","year":"2005","unstructured":"Pinedo, M.L.: Planning and Scheduling in Manufacturing and Services. Springer, New York (2005)"},{"key":"31_CR11","unstructured":"Schutle, H., Smolka, G., Wurtz, J.: Finite Domain Constraint Programming in Oz. German Research Center for Artificial Intelligence, Germany, D-66123 Saarbrucken (1998)"},{"key":"31_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0073786","volume-title":"Classical Diophantine Equations","author":"V.G. Sprindzuk","year":"1993","unstructured":"Sprindzuk, V.G.: Classical Diophantine Equations. Lecture Notes in Mathematics, vol.\u00a01559. Springer, Berlin (1993)"},{"key":"31_CR13","volume-title":"London Mathematical Society Student Text","author":"N.P. Smart","year":"1998","unstructured":"Smart, N.P.: The Algorithmic Resolution of Diophantine Equations. In: London Mathematical Society Student Text, vol.\u00a041. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"31_CR14","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1021\/ie020308u","volume":"42","author":"S.-K. Heo","year":"2003","unstructured":"Heo, S.-K., Lee, K.-H., Lee, H.-K., Lee, I.-B., Park, J.H.: A New Algorithm for Cyclic Scheduling and Design of Multipurpose Batch Plants. Ind. Eng. Chem. Res.\u00a042(4), 836\u2013846 (2003)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"11","key":"31_CR15","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1057\/palgrave.jors.2600625","volume":"49","author":"B. Tan","year":"1998","unstructured":"Tan, B., Karabati, S.: Stochastic Cyclic Scheduling Problem in Synchronous Assembly and Production Lines. Journal of the Operational Research Society\u00a049(11), 1173\u20131187 (1998)","journal-title":"Journal of the Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10488-6_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:33:26Z","timestamp":1619782406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10488-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642104879","9783642104886"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10488-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}