{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:31:19Z","timestamp":1765355479611},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642111686"},{"type":"electronic","value":"9783642111693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11169-3_7","type":"book-chapter","created":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T21:26:05Z","timestamp":1259357165000},"page":"89-103","source":"Crossref","is-referenced-by-count":25,"title":["A Knowledge Discovery Approach to Understanding Relationships between Scheduling Problem Structure and Heuristic Performance"],"prefix":"10.1007","author":[{"given":"Kate A.","family":"Smith-Miles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross J. W.","family":"James","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John W.","family":"Giffin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqing","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J.R. Rice","year":"1976","unstructured":"Rice, J.R.: The Algorithm Selection Problem. Adv. Comp.\u00a015, 65\u2013118 (1976)","journal-title":"Adv. Comp."},{"unstructured":"Watson, J.P., Barbulescu, L., Howe, A.E., Whitley, L.D.: Algorithm Performance and Problem Structure for Flow-shop Scheduling. In: Proc. AAAI Conf. on Artificial Intelligence, pp. 688\u2013694 (1999)","key":"7_CR2"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE T. Evolut. Comput.\u00a01, 67 (1997)","journal-title":"IEEE T. Evolut. Comput."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-540-74970-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Satzilla-07: The Design and Analysis of An Algorithm Portfolio For SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 712\u2013727. Springer, Heidelberg (2007)"},{"key":"7_CR5","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\u2013569. Springer, Heidelberg (2002)"},{"unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A Portfolio Approach to Algorithm Selection. In: Proc. IJCAI, pp. 1542\u20131543 (2003)","key":"7_CR6"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H., Devkar, A., Shoham, Y.: Understanding Random SAT: Beyond the Clauses-To-Variables Ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"7_CR8","first-page":"235","volume-title":"Proc. 17th Conf. on Uncertainty in Artificial Intelligence","author":"E. Horvitz","year":"2001","unstructured":"Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., Chickering, M.: A Bayesian Approach to Tackling Hard Computational Problems. In: Proc. 17th Conf. on Uncertainty in Artificial Intelligence, pp. 235\u2013244. Morgan Kaufmann, San Francisco (2001)"},{"unstructured":"Samulowitz, H., Memisevic, R.: Learning to solve QBF. In: Proc. 22nd AAAI Conf. on Artificial Intelligence, pp. 255\u2013260 (2007)","key":"7_CR9"},{"unstructured":"Streeter, M., Golovin, D., Smith, S.F.: Combining multiple heuristics online. In: Proc. 22nd AAAI Conf. on Artificial Intelligence, pp. 1197\u20131203 (2007)","key":"7_CR10"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R. Vilalta","year":"2002","unstructured":"Vilalta, R., Drissi, Y.: A Perspective View and Survey of Meta-Learning. Artif. Intell. Rev.\u00a018, 77\u201395 (2002)","journal-title":"Artif. Intell. Rev."},{"volume-title":"Machine Learning, Neural and Statistical Classification","year":"1994","unstructured":"Michie, D., Spiegelhalter, D.J., Taylor, C.C. (eds.): Machine Learning, Neural and Statistical Classification. Ellis Horwood, New York (1994)","key":"7_CR12"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1021713901879","volume":"50","author":"P. Brazdil","year":"2003","unstructured":"Brazdil, P., Soares, C., Costa, J.: Ranking Learning Algorithms: Using IBL and Meta-Learning on Accuracy and Time Results. Mach. Learn.\u00a050, 251\u2013277 (2003)","journal-title":"Mach. Learn."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.asoc.2004.12.002","volume":"6","author":"S. Ali","year":"2006","unstructured":"Ali, S., Smith, K.: On Learning Algorithm Selection for Classification. Appl. Soft Comp.\u00a06, 119\u2013138 (2006)","journal-title":"Appl. Soft Comp."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-24652-7_20","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"T. St\u00fctzle","year":"2004","unstructured":"St\u00fctzle, T., Fernandes, S.: New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.\u00a03004, pp. 199\u2013209. Springer, Heidelberg (2004)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1111\/j.1467-8640.2005.00278.x","volume":"21","author":"T. Carchrae","year":"2005","unstructured":"Carchrae, T., Beck, J.C.: Applying Machine Learning to Low Knowledge Control of Optimization Algorithms. Comput. Intell.\u00a021, 373\u2013387 (2005)","journal-title":"Comput. Intell."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1080\/07408179208964213","volume":"24","author":"M.J. Shaw","year":"1992","unstructured":"Shaw, M.J., Park, S., Raman, N.: Intelligent Scheduling With Machine Learning Capabilities: The Induction of Scheduling Knowledge. IIE Trans.\u00a024, 156\u2013168 (1992)","journal-title":"IIE Trans."},{"key":"7_CR18","first-page":"271","volume-title":"Soft Computing Systems: Design, Management and Applications","author":"J.D. Knowles","year":"2002","unstructured":"Knowles, J.D., Corne, D.W.: Towards Landscape Analysis to Inform the Design of a Hybrid Local Search for the Multiobjective Quadratic Assignment Problem. In: Abraham, A., Ruiz-Del-Solar, J., Koppen, M. (eds.) Soft Computing Systems: Design, Management and Applications, pp. 271\u2013279. IOS Press, Amsterdam (2002)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"2","author":"P. Merz","year":"2004","unstructured":"Merz, P.: Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms. Evol. Comp.\u00a02, 303\u2013325 (2004)","journal-title":"Evol. Comp."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0004-3702(02)00363-6","volume":"143","author":"J. Watson","year":"2003","unstructured":"Watson, J., Beck, J.C., Howe, A.E., Whitley, L.D.: Problem Difficulty for Tabu Search in Job-Shop Scheduling. Artif. Intell.\u00a0143, 189\u2013217 (2003)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.A.: Cross-Disciplinary Perspectives on Meta-Learning For Algorithm Selection. ACM Computing Surveys (in press, 2009)","key":"7_CR21","DOI":"10.1145\/1456650.1456656"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1990","unstructured":"Baker, K.R., Scudder, G.D.: Sequencing With Earliness and Tardiness Penalties: A Review. Ops. Res.\u00a038, 22\u201336 (1990)","journal-title":"Ops. Res."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0377-2217(96)00239-1","volume":"102","author":"R.J.W. James","year":"1997","unstructured":"James, R.J.W., Buchanan, J.T.: A Neighbourhood Scheme with a Compressed Solution Space for The Early\/Tardy Scheduling Problem. Eur. J. Oper. Res.\u00a0102, 513\u2013527 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1080\/07408178708975418","volume":"19","author":"T.D. Fry","year":"1987","unstructured":"Fry, T.D., Armstrong, R.D., Blackstone, J.H.: Minimizing Weighted Absolute Deviation in Single Machine Scheduling. IIE Transactions\u00a019, 445\u2013450 (1987)","journal-title":"IIE Transactions"},{"key":"7_CR25","volume-title":"Manufacturing Planning and Control for Supply Chain Management","author":"T.E. Vollmann","year":"2005","unstructured":"Vollmann, T.E., Berry, W.L., Whybark, D.C., Jacobs, F.R.: Manufacturing Planning and Control for Supply Chain Management, 5th edn. McGraw Hill, New York (2005)","edition":"5"},{"key":"7_CR26","volume-title":"Operations Management: Processes and Value Chains","author":"L.J. Krajewski","year":"2005","unstructured":"Krajewski, L.J., Ritzman, L.P.: Operations Management: Processes and Value Chains, 7th edn. Pearson Prentice Hall, New Jersey (2005)","edition":"7"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T. Schiavinotto","year":"2007","unstructured":"Schiavinotto, T., St\u00fctzle, T.: A review of metrics on permutations for search landscape analysis. Comput. Oper. Res.\u00a034, 3143\u20133153 (2007)","journal-title":"Comput. Oper. Res."},{"unstructured":"Pfahringer, B., Bensusan, H., Giraud-Carrier, C.G.: Meta-Learning by Landmarking Various Learning Algorithms. In: Proc. ICML, pp. 743\u2013750 (2000)","key":"7_CR28"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/nav.3800210114","volume":"21","author":"K.B. Baker","year":"1974","unstructured":"Baker, K.B., Martin, J.B.: An Experimental Comparison of Solution Algorithms for the Single Machine Tardiness Problem. Nav. Res. Log.\u00a021, 187\u2013199 (1974)","journal-title":"Nav. Res. Log."},{"key":"7_CR30","first-page":"457","volume-title":"Handbook of Meta-heuristics","author":"E. Burke","year":"2002","unstructured":"Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An Emerging Direction in Modern Search Technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-heuristics, pp. 457\u2013474. Kluwer, Norwell (2002)"},{"key":"7_CR31","first-page":"865","volume-title":"Encyclopaedia of Data Warehousing and Mining","author":"K.A. Smith","year":"2006","unstructured":"Smith, K.A.: Neural Networks for Prediction and Classification. In: Wang, J. (ed.) Encyclopaedia of Data Warehousing and Mining, vol.\u00a02, pp. 865\u2013869. Information Science Publishing, Hershey (2006)"},{"key":"7_CR32","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)","edition":"2"},{"key":"7_CR33","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF00337288","volume":"43","author":"T. Kohonen","year":"1982","unstructured":"Kohonen, T.: Self-Organized Formation of Topologically Correct Feature Maps. Biol. Cyber.\u00a043, 59\u201369 (1982)","journal-title":"Biol. Cyber."},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1038\/nature03602","volume":"435","author":"D. Achlioptas","year":"2005","unstructured":"Achlioptas, D., Naor, A., Peres, Y.: Rigorous Location of Phase Transitions in Hard Optimization Problems. Nature\u00a0435, 759\u2013764 (2005)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11169-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:38:16Z","timestamp":1606185496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11169-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642111686","9783642111693"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11169-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}