{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:52Z","timestamp":1725573352507},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540307051"},{"type":"electronic","value":"9783540324218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593577_11","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T07:32:45Z","timestamp":1131175965000},"page":"177-189","source":"Crossref","is-referenced-by-count":1,"title":["Decomposition and Parallelization of Multi-resource Timetabling Problems"],"prefix":"10.1007","author":[{"given":"Petr","family":"\u0160lechta","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45982-0_8","volume-title":"Multi-Agent-Systems and Applications II","author":"J. B\u00e1rta","year":"2002","unstructured":"B\u00e1rta, J., \u0160tep\u00e1nkov\u00e1, O., Pechoucek, M.: Distributed Branch and Bound Algorithm in Coalition Planning. In: Ma\u0159\u00edk, V., \u0160t\u011bp\u00e1nkov\u00e1, O., Krautwurmov\u00e1, H., Luck, M. (eds.) ACAI 2001, EASSS 2001, AEMAS 2001, and HoloMAS 2001. LNCS (LNAI), vol.\u00a02322, p. 159. Springer, Heidelberg (2002)"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"E.K. Burke","year":"1999","unstructured":"Burke, E.K., Newall, J.P.: A Multi-Stage Evolutionary Algorithm for the Timetable Problem. IEEE Trans. on Evolutionary Computation 3, 63\u201374 (1999)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"11_CR3","unstructured":"Carter, M.W.: A Decomposition Algorithm for Practical Timetabling Problems. Technical Paper 83-06. Department of Industrial Engineering, University of Toronto (1983)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BFb0055878","volume-title":"Practice and Theory of Automated Timetabling II","author":"M.W. Carter","year":"1998","unstructured":"Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 3\u201319. Springer, Heidelberg (1998)"},{"key":"11_CR5","unstructured":"Friha, L., Queloz, P., Pellegrini, C.: A\u00a0Decomposition Method for Hospital Scheduling Problems. In: Workshop on Industrial Constraint-Directed Scheduling (1997)"},{"key":"11_CR6","unstructured":"Goltz, H.-J., John, U.: Methods for Solving Practical Problems of Job-Shop Scheduling Modelled in CLP(FD). In: Proc. Practical Application of Constraint Technology (PACT 1996) (1996)"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N., Perez-Brito, D.: Variable Neighborhood Decomposition Search. J. Heuristics 7, 335\u2013350 (2001)","journal-title":"J. Heuristics"},{"key":"11_CR8","volume-title":"Umel\u00e1 Intelligence","author":"V. Mar\u00edk","year":"2001","unstructured":"Mar\u00edk, V., \u0160tep\u00e1nkov\u00e1, O., La\u017eansk\u00fd, J., et al.: Umel\u00e1 Intelligence, vol.\u00a03. Academia, Praha (2001)"},{"key":"11_CR9","unstructured":"Schaerf, A.: A Survey of Automated Timetabling. CWI Report (1995) ISSN\u00a00169-118X"},{"key":"11_CR10","unstructured":"The Source for Java Technology. Sun Microsystems, Inc. (2003), \n                    \n                      http:\/\/java.sun.com"},{"key":"11_CR11","unstructured":"Souza, M.J.F., Maculan, N., Ochi, L.S.: A\u00a0GRASP-Tabu Search Algorithm to Solve a School Timetabling Problem. In: 4th\u00a0Metaheuristics Int. Conf. (MIC 2001) (2001)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19, 151\u2013162 (1985)","DOI":"10.1016\/0377-2217(85)90167-5"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593577_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:53Z","timestamp":1619506313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11593577_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}