{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:35:38Z","timestamp":1725496538077},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540773443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77345-0_24","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T00:53:06Z","timestamp":1195865586000},"page":"383-393","source":"Crossref","is-referenced-by-count":4,"title":["An Extensible Modelling Framework for Timetabling Problems"],"prefix":"10.1007","author":[{"given":"David","family":"Ranson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samad","family":"Ahmadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Bixby, B., Reinelt, G.: TSPLIB a library of travelling salesman and related problem instances (1995), \n                    \n                      http:\/\/softlib.rice.edu\/tsplib.html"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-61794-9_52","volume-title":"Practice and Theory of Automated Timetabling","author":"E.K. Burke","year":"1996","unstructured":"Burke, E.K., Elliman, D.G., Ford, P.H., Weare, R.F.: Examination timetabling in British universities \u2013 a survey. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol.\u00a01153, pp. 76\u201390. Springer, Heidelberg (1996)"},{"key":"24_CR3","unstructured":"Burke, E.\u00a0K., McCollum, B.: Examination timetabling: a new formulation (Abstract). In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, August (2006) 373\u2013375"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E.K. Burke","year":"2002","unstructured":"Burke, E.K., Petrovic, S.: Recent research directions in automated timetabling. European Journal of Operational Research\u00a0140, 266\u2013280 (2002)","journal-title":"European Journal of Operational Research"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BFb0055891","volume-title":"Practice and Theory of Automated Timetabling II","author":"E.K. Burke","year":"1998","unstructured":"Burke, E.K., Kingston, J.H., Pepper, P.A.: A standard data format for timetabling instances. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 213\u2013222. Springer, Heidelberg (1998)"},{"key":"24_CR6","first-page":"445","volume-title":"The Handbook of Graph Theory","author":"E.K. Burke","year":"1997","unstructured":"Burke, E.K., de Werra, D., Kingston, J.: Applications to timetabling. In: Gross, J., Yellen, J. (eds.) The Handbook of Graph Theory, pp. 445\u2013474. Chapman Hall\/CRC Press, London (1997)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M.W. Carter","year":"1986","unstructured":"Carter, M.W.: A survey of practical applications of examination timetabling algorithms. Operations Research\u00a034, 193\u2013202 (1986)","journal-title":"Operations Research"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/1-4020-0611-X_1047","volume-title":"Encyclopedia of Operations Research and Management Science","author":"M.W. Carter","year":"2001","unstructured":"Carter, M.W.: Timetabling. In: Gass, S., Harris, C.M. (eds.) Encyclopedia of Operations Research and Management Science, pp. 833\u2013836. Kluwer, Dordrecht (2001)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/800184.810495","volume-title":"Proceedings of the 1971 26th Annual Conference","author":"G.B. Dantzig","year":"1971","unstructured":"Dantzig, G.B., Eisenstat, S.C., Magnanti, T.L., Maier, S.F., McGrath, M.B.: The mathematical programming language (MPL). In: Proceedings of the 1971 26th Annual Conference, pp. 278\u2013283. ACM Press, New York (1971)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-44629-X_19","volume-title":"Practice and Theory of Automated Timetabling III","author":"J.H. Kingston","year":"2001","unstructured":"Kingston, J.H.: Modelling timetabling problems with STTL. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 309\u2013321. Springer, Heidelberg (2001)"},{"key":"24_CR11","unstructured":"Kingston, J.H.: A user\u2019s guide to the STTL timetabling language version 1.0. \n                    \n                      http:\/\/www.it.usyd.edu.au\/~jeff\/ttsttl1.ps"},{"key":"24_CR12","unstructured":"Ozcan, E.: Towards an XML based standard for timetabling problems: TTML. In: MISTA 2003. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, Nottingham, pp. 566\u2013569 (August 2003)"},{"key":"24_CR13","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., Burke, E.K.: University timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, Boca Raton, FL (2004)"},{"key":"24_CR14","unstructured":"Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G., Lee, S.: A survey of search methodologies and automated approaches for examination timetabling. University of Nottingham, Computer Science Technical Report No. NOTTCS-TR-2006-4 (2006)"},{"key":"24_CR15","unstructured":"Ranson, D.: Extensible modelling framework for timetabling optimisation problem website. \n                    \n                      http:\/\/www.informatics.sussex.ac.uk\/users\/djr23\/emfop\/"},{"key":"24_CR16","unstructured":"Ranson, D., Cheng, P.C.H.: Graphical tools for heursitic visualization. In: MISTA. The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, pp. 658\u2013668 (July 2005)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-44629-X_20","volume-title":"Practice and Theory of Automated Timetabling III","author":"L.P. Reis","year":"2001","unstructured":"Reis, L.P., Oliveira, E.: A language for specifying complete timetabling problems. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 322\u2013341. Springer, Heidelberg (2001)"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-540-45157-0_21","volume-title":"Practice and Theory of Automated Timetabling IV","author":"H. Rudova","year":"2003","unstructured":"Rudova, H., Murray, K.: University course timetabling with soft constraints. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 310\u2013328. Springer, Heidelberg (2003)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review\u00a013, 87\u2013127 (1999)","journal-title":"Artificial Intelligence Review"},{"key":"24_CR20","unstructured":"Smith, S., Becker, M.: An ontology for constructing scheduling systems. In: Working Notes from 1997 AAAI Spring Symposium on Ontological Engineering, Stanford, CA, AAAI Press, Menlo Park, CA (March 1997)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/3-540-61794-9_51","volume-title":"Practice and Theory of Automated Timetabling","author":"A. Wren","year":"1996","unstructured":"Wren, A.: Scheduling, timetabling and rostering \u2013 a special relationship? In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol.\u00a01153, pp. 46\u201375. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77345-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:08:59Z","timestamp":1619507339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77345-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773443"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77345-0_24","relation":{},"subject":[]}}