{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T21:41:55Z","timestamp":1745876515666,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612919"},{"type":"electronic","value":"9783540684503"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61291-2_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:25:46Z","timestamp":1330273546000},"page":"41-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Selecting the right heuristic algorithm: Runtime performance predictors"],"prefix":"10.1007","author":[{"given":"John A.","family":"Allen","sequence":"first","affiliation":[]},{"given":"Steven","family":"Minton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"4_CR1","first-page":"331","volume-title":"Proceedings of the 12 th IJCAI","author":"P. Cheeseman","year":"1991","unstructured":"P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of the 12 th IJCAI, pages 331\u2013337, Sydney, Australia, 1991. Morgan Kaufmann."},{"issue":"3","key":"4_CR2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover. Tabu search \u2014 part I. ORSA Journal on Computing, 1(3):190\u2013206, 1989.","journal-title":"ORSA Journal on Computing"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover. Tabu search \u2014 part II. ORSA Journal on Computing, 2:4\u201332, 1990.","journal-title":"ORSA Journal on Computing"},{"key":"4_CR4","unstructured":"M. Johnston and S. Minton. Analyzing a heuristic strategy for constraint-satisfaction and scheduling. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 257\u2013290. Morgan Kaufmann, 1994."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(90)90156-R","volume":"34","author":"L. Kale","year":"1990","unstructured":"L. Kale. An almost perfect heuristic for the n nonattacking queens problem. Inf. Process. Lett, 34:173\u2013178, 1990.","journal-title":"Inf. Process. Lett"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","volume":"29","author":"D. Knuth","year":"1975","unstructured":"D. Knuth. Estimating the efficiency of backtrack programs. Mathematics of Computation, 29:121\u2013136, 1975.","journal-title":"Mathematics of Computation"},{"issue":"1","key":"4_CR7","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"V. Kumar. Algorithms for constraint-satisfaction problems: a survey. AI Magazine, 13(1):32\u201344, 1992.","journal-title":"AI Magazine"},{"key":"4_CR8","volume-title":"Proceedings of the Eleventh National Conference on Artificial Intelligence","author":"S. Minton","year":"1993","unstructured":"S. Minton. Integrating heuristics for constraint satisfaction problems: A case study. In Proceedings of the Eleventh National Conference on Artificial Intelligence, San Jose, CA, 1993. AAAI Press."},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M. Johnston, A. Philips, and P. Laird. Minimizing conficts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161\u2013205, 1992.","journal-title":"Artificial Intelligence"},{"key":"4_CR10","first-page":"459","volume-title":"Proceedings of AAAI-92","author":"D. Mitchell","year":"1991","unstructured":"D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings of AAAI-92, pages 459\u2013465, San Jose, CA, 1991. AAAI Press."},{"key":"4_CR11","unstructured":"N. Muscettola. HSTS: Integrating planning and scheduling. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 169\u2013212. Morgan Kaufmann, 1994."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"B. Nadel. Tree search and arc consistency in constraint satisfaction algorithms. In L. Kanal and V. Kumar, editors, Search in Artificial Intelligence, pages 287\u2013342. Springer-Verlag, 1988.","DOI":"10.1007\/978-1-4613-8788-6_9"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"V. Rao and V. Kumar. Superlinear speedup in state-space search. In Conference on foundations of softwar technology and theoretical computer science, 1988.","DOI":"10.1007\/3-540-50517-2_79"},{"key":"4_CR14","volume-title":"Proceedings of the 1994 Workshop on Principles and Practice of Constraint Programming","author":"D. Sabin","year":"1994","unstructured":"D. Sabin and E. Freuder. Constradicting conventional wisdom in constraint satisfaction. In A. Borning, editor, Proceedings of the 1994 Workshop on Principles and Practice of Constraint Programming, Orcas Island, Washington, 1994. Springer-Verlag."},{"key":"4_CR15","volume-title":"Technical Report CMU-CS-91-102","author":"N. Sadeh","year":"1991","unstructured":"N. Sadeh. Look-ahead techniques for micro-opportunist job shop scheduling. Technical Report CMU-CS-91-102, School of Computer Science, Carnegie Mellon, 1991."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"N. Sadeh. Micro-opportunistic scheduling: the micro-boss factory scheduler. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 99\u2013135. Morgan Kaufmann, 1994.","DOI":"10.21236\/ADA282968"},{"key":"4_CR17","first-page":"440","volume-title":"Proceedings of AAAI-92","author":"B. Selman","year":"1992","unstructured":"B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of AAAI-92, pages 440\u2013446, San Jose, CA, 1992. AAAI Press."},{"key":"4_CR18","unstructured":"D. Smith. Transformational approach to scheduling. Technical Report KES.U.92.2, Kestrel Institute, 1992."}],"container-title":["Lecture Notes in Computer Science","Advances in Artifical Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61291-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:30:20Z","timestamp":1558254620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61291-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612919","9783540684503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61291-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}