{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:02:49Z","timestamp":1742997769233,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_4","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"50-64","source":"Crossref","is-referenced-by-count":10,"title":["Simple Rules for Low-Knowledge Algorithm Selection"],"prefix":"10.1007","author":[{"given":"J. Christopher","family":"Beck","sequence":"first","affiliation":[]},{"given":"Eugene C.","family":"Freuder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J. Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Advances in Computers\u00a015, 65\u2013118 (1976)","journal-title":"Advances in Computers"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K. Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 556\u2013572. Springer, Heidelberg (2002)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1","author":"S. Minton","year":"1996","unstructured":"Minton, S.: Automatically configuring constraint satisfaction programs: A case study. CONSTRAINTS\u00a01, 7\u201343 (1996)","journal-title":"CONSTRAINTS"},{"key":"4_CR4","unstructured":"Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., Chickering, M.: A bayesian approach to tacking hard computational problems. In: Proceedings of the Seventeenth Conference on uncertainty and Artificial Intelligence (UAI 2001), pp. 235\u2013244 (2001)"},{"key":"4_CR5","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic restart policies. In: Proceedings of the Eighteenth National Conference on Artifiical Intelligence (AAAI 2002), pp. 674\u2013681 (2002)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-46135-3_38","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"Y. Ruan","year":"2002","unstructured":"Ruan, Y., Horvitz, E., Kautz, H.: Restart policies with dependence among runs: A dynamic programming approach. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 573\u2013586. Springer, Heidelberg (2002)"},{"key":"4_CR7","unstructured":"Watson, J.P.: Empirical Modeling and Analysis of Local Search Algorithms for the Job-Shop Scheduling Problem. PhD thesis, Dept. of Computer Science, Colorado State University (2003)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Watson, J.P., Barbulescu, L., Whitley, L., Howe, A.: Constrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal on Computing\u00a014 (2002)","DOI":"10.1287\/ijoc.14.2.98.120"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science\u00a042, 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"J.C. Beck","year":"2000","unstructured":"Beck, J.C., Fox, M.S.: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence\u00a0117, 31\u201381 (2000)","journal-title":"Artificial Intelligence"},{"key":"4_CR11","unstructured":"Nuijten, W.P.M.: Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1994)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P. Laborie","year":"2003","unstructured":"Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence\u00a0143, 151\u2013188 (2003)","journal-title":"Artificial Intelligence"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters\u00a047, 173\u2013180 (1993)","journal-title":"Information Processing Letters"},{"key":"4_CR14","unstructured":"Scheduler: ILOG Scheduler 5.2 User\u2019s Manual and Reference Manual. ILOG, S.A. (2001)"},{"key":"4_CR15","unstructured":"Beck, J.C., Perron, L.: Discrepancy-bounded depth first search. In: Proceedings of the Second International Workshop on Integration of AI and OR Technologies for Combinatorial Optimization Problems, CPAIOR 2000 (2000)"},{"key":"4_CR16","volume-title":"Empirical Methods for Artificial Intelligence","author":"P.R. Cohen","year":"1995","unstructured":"Cohen, P.R.: Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge (1995)"},{"key":"4_CR17","unstructured":"Beck, J.C., Refalo, P.: Combining local search and linear programming to solve earliness\/tardiness scheduling problems. In: Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2002 (2002)"},{"key":"4_CR18","first-page":"1011","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000)","author":"M. Vazquez","year":"2000","unstructured":"Vazquez, M., Whitley, L.D.: A comparision of genetic algorithms for the dynamic job shop scheduling problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 1011\u20131018. Morgan Kaufmann, San Francisco (2000)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:24:21Z","timestamp":1676075061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}