{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:54Z","timestamp":1725551454111},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121470"},{"type":"electronic","value":"9783642121487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12148-7_22","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T11:19:10Z","timestamp":1270034350000},"page":"256-267","source":"Crossref","is-referenced-by-count":1,"title":["Genetic Programming for Auction Based Scheduling"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Bader-El-Den","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaheen","family":"Fatima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Asmuni, H., Burke, E.K., Garibaldi, J.M., McCollum, B.: Fuzzy multiple heuristic orderings for examination timetabling. In: Burke, Trick [7], pp. 334\u2013353","DOI":"10.1007\/11593577_19"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s12293-009-0022-y","volume":"1","author":"M. Bader-El-Den","year":"2009","unstructured":"Bader-El-Den, M., Poli, R., Fatima, S.: Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework. Memetic Computing\u00a01, 205\u2013219 (2009)","journal-title":"Memetic Computing"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-79305-2_4","volume-title":"Artificial Evolution","author":"M.B. Bader-El-Den","year":"2008","unstructured":"Bader-El-Den, M.B., Poli, R.: Generating sat local-search heuristics using a gp hyper-heuristic framework. In: Monmarch\u00e9, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol.\u00a04926, pp. 37\u201349. Springer, Heidelberg (2008)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/11844297_87","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"E.K. Burke","year":"2006","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Evolving bin packing heuristics with genetic programming. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol.\u00a04193, pp. 860\u2013869. Springer, Heidelberg (2006)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1145\/1276958.1277273","volume-title":"GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation","author":"E.K. Burke","year":"2007","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.: Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. In: GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 1559\u20131565. ACM, New York (2007)"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E.K. Burke","year":"2007","unstructured":"Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research\u00a0176(1), 177\u2013192 (2007)","journal-title":"European Journal of Operational Research"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Practice and Theory of Automated Timetabling V","year":"2005","unstructured":"Burke, E.K., Trick, M.A. (eds.): PATAT 2004. LNCS, vol.\u00a03616. Springer, Heidelberg (2005)"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1057\/jors.1996.37","volume":"47","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G., Lee, S.Y.: Examination timetabling: Algorithmic strategies and. Journal of Operational Research Society\u00a047, 73\u201383 (1996)","journal-title":"Journal of Operational Research Society"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Corne, D., Ross, P., lan Fang, H.: Evolutionary timetabling: practice, prospects and work in progress. In: Proceedings of the UK Planning and Scheduling SIG Workshop, Strathclyde (1994)","DOI":"10.1007\/3-540-58483-8_19"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"C\u00f4t\u00e9, P., Wong, T., Sabourin, R.: A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. In: Burke, Trick [7], pp. 294\u2013312","DOI":"10.1007\/11593577_17"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-30076-2_22","volume-title":"Data Warehousing and Knowledge Discovery","author":"J. Du","year":"2004","unstructured":"Du, J., Korkmaz, E., Alhajj, R., Barker, K.: Novel clustering approach that employs genetic algorithm with new representation scheme and multiple objectives. In: Kambayashi, Y., Mohania, M., W\u00f6\u00df, W. (eds.) DaWaK 2004. LNCS, vol.\u00a03181, pp. 219\u2013228. Springer, Heidelberg (2004)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-44629-X_9","volume-title":"Practice and Theory of Automated Timetabling III","author":"W. Erben","year":"2001","unstructured":"Erben, W.: A grouping genetic algorithm for graph colouring and exam timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 132\u2013158. Springer, Heidelberg (2001)"},{"key":"22_CR13","series-title":"LNBIP","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-77554-6_15","volume-title":"Negotiation, Auctions and Market Engineering","author":"S.S. Fatima","year":"2008","unstructured":"Fatima, S.S.: Bidding strategies for multi-object auctions. In: Negotiation, Auctions and Market Engineering. LNBIP, vol.\u00a02, pp. 200\u2013212. Springer, Heidelberg (2008)"},{"key":"22_CR14","unstructured":"Fukunaga, A.S.: Automated discovery of composite sat variable-selection heuristics. In: Eighteenth national conference on Artificial intelligence, Menlo Park, CA, USA. American Association for Artificial Intelligence, pp. 641\u2013648 (2002)"},{"key":"22_CR15","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"22_CR16","volume-title":"Auction Theory","author":"V. Krishna","year":"2002","unstructured":"Krishna, V.: Auction Theory. Academic Press, London (2002)"},{"key":"22_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04726-2","volume-title":"Foundations of Genetic Programming","author":"W.B. Langdon","year":"2002","unstructured":"Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)"},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10115-008-0171-1","volume":"19","author":"G. Pappa","year":"2009","unstructured":"Pappa, G., Freitas, A.: Evolving rule induction algorithms with multi-objective grammar-based genetic programming. Knowledge and information systems\u00a019(3), 283\u2013309 (2009)","journal-title":"Knowledge and information systems"},{"key":"22_CR19","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008) (With contributions by J. R. Koza) Published via, http:\/\/lulu.com and freely available at, http:\/\/www.gp-field-guide.org.uk"},{"key":"22_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/3-540-61794-9_68","volume-title":"Selected papers from the First International Conference on Practice and Theory of Automated Timetabling","author":"P. Ross","year":"1996","unstructured":"Ross, P., Corne, D., Terashima-Mar\u00edn, H.: The phase-transition niche for evolutionary algorithms in timetabling. In: Selected papers from the First International Conference on Practice and Theory of Automated Timetabling, London, UK, pp. 309\u2013324. Springer, Heidelberg (1996)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0055884","volume-title":"Practice and Theory of Automated Timetabling II","author":"P. Ross","year":"1998","unstructured":"Ross, P., Hart, E., Corne, D.: Some observations about ga-based exam timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 115\u2013129. Springer, Heidelberg (1998)"},{"key":"22_CR22","first-page":"755","volume-title":"Genetic algorithms and timetabling","author":"P. Ross","year":"2003","unstructured":"Ross, P., Hart, E., Corne, D.: Genetic algorithms and timetabling, pp. 755\u2013771. Springer-Verlag New York Inc., New York (2003)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-77345-0_22","volume-title":"Practice and Theory of Automated Timetabling VI","author":"\u00d6. \u00dclker","year":"2007","unstructured":"\u00dclker, \u00d6., \u00d6zcan, E., Korkmaz, E.E.: Linear linkage encoding in grouping problems: Applications on graph coloring and timetabling. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 347\u2013363. Springer, Heidelberg (2007)"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D. Welsh","year":"1967","unstructured":"Welsh, D., Powell, M.: An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal\u00a010(1), 85\u201387 (1967)","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12148-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:50:08Z","timestamp":1606168208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12148-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121470","9783642121487"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12148-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}