{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T08:25:47Z","timestamp":1776932747684,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540617945","type":"print"},{"value":"9783540706823","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61794-9_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:26:23Z","timestamp":1330295183000},"page":"309-324","source":"Crossref","is-referenced-by-count":16,"title":["The phase-transition niche for evolutionary algorithms in timetabling"],"prefix":"10.1007","author":[{"given":"Peter","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Corne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"20_CR1","unstructured":"D. Abramson and J. Abela, \u2018A parallel genetic algorithm for solving the school timetabling problem', Technical report, Division of Information Technology, C.S.I.R.O., (April 1991)."},{"key":"20_CR2","unstructured":"B. Bollobas, Random Graphs, Academic Press, 1985."},{"key":"20_CR3","unstructured":"P. Cheeseman, B. Kenefsky, and W.M. Taylor, \u2018Where the really hard problems are', in Proceedings of IJCAI-91, pp. 331\u2013337, (1991)."},{"key":"20_CR4","first-page":"249","volume-title":"Selection in massively parallel genetic algorithms","author":"R. J. Collins","year":"1991","unstructured":"Robert J. Collins and David R. Jefferson, \u2018Selection in massively parallel genetic algorithms', in Proceedings of the Fourth International Conference on Genetic Algorithms, eds., R.K. Belew and L.B. Booker, pp. 249\u2013256. San Mateo: Morgan Kaufmann, (1991)."},{"key":"20_CR5","unstructured":"Dave Corne, Hsiao-Lan Fang, and Chris Mellish, 'solving the module exam scheduling problem with genetic algorithms', in Proceedings of the Sixth International Conference in Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, eds., Paul W.H. Chung, Gillian Lovegrove, and Moonis Ali, 370\u2013373, Gordon and Breach Science Publishers, (1993)."},{"key":"20_CR6","volume-title":"Technical Report UCB Technical Report CSD-94-834","author":"A. Juels","year":"1994","unstructured":"A. Juels and M. Wattenberg, \u2018Stochastic hillclimbing as a baseline method for evaluating genetic algorithms', Technical Report UCB Technical Report CSD-94-834, Department of Computer Science, University of California at Berkeley, (1994)."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"U-M. O'Reilly and F. Oppacher, \u2018Program search with a hierarchical variable length representation: genetic programming, simulated annealing and stochastic hill climbing', in Parallel Problem Solving from Nature \u2014 PPSN III, eds., Y. Davidor, H-P. Schwefel, and R. Manner, number 866 in Lecture Notes in Computer Science. Springer-Verlag, (1994).","DOI":"10.1007\/3-540-58484-6_283"},{"key":"20_CR8","unstructured":"Patrick Prosser, \u2018Binary constraint satisfaction problems: Some are harder than others', in Proceedings of the 11th European Conference on Artificial Intelligence, ed., A. Cohn, pp. 95\u201399. John Wiley & Sons, Ltd., (1994)."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Peter Ross, Dave Corne, and Hsiao-Lan Fang, \u2018Improving evolutionary timetabling with delta evaluation and directed mutation', in Parallel Problem Solving from Nature III, ed., Y. Davidor, Springer-Verlag, (1994).","DOI":"10.1007\/3-540-58484-6_298"},{"key":"20_CR10","unstructured":"Barbara Smith, \u2018Phase transition and the mushy region in constraint satisfaction problems', in Proceedings of the 11th European Conference on Artificial Intelligence, ed., A. Cohn, pp. 100\u2013104. John Wiley & Sons, Ltd., (1994)."},{"key":"20_CR11","unstructured":"H. Terashima-Marin, \u2018A comparison of ga-based methods and graph-colouring methods for solving the timetabling problem', Technical Report Technical Report AIGA-94-15, University of Edinburgh Department of Artificial Intelligence, (1994)."}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61794-9_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:47Z","timestamp":1619573807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61794-9_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617945","9783540706823"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61794-9_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}