{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:20:38Z","timestamp":1785543638053,"version":"3.56.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T00:00:00Z","timestamp":1497312000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005415","name":"H\u00e1sk\u00f3li \u00cdslands","doi-asserted-by":"publisher","award":["HI13110165"],"award-info":[{"award-number":["HI13110165"]}],"id":[{"id":"10.13039\/501100005415","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10951-017-0534-0","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T15:03:43Z","timestamp":1497366223000},"page":"413-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2780-3546","authenticated-orcid":false,"given":"Helga","family":"Ingimundardottir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1067-7694","authenticated-orcid":false,"given":"Thomas Philip","family":"Runarsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,13]]},"reference":[{"key":"534_CR1","unstructured":"Andresen, M., Engelhardt, F., & Werner, F. (2010). LiSA\u2014A Library of Scheduling Algorithms (version 3.0) [software]. \n                        http:\/\/www.math.ovgu.de\/Lisa.html\n                        \n                    ."},{"issue":"12","key":"534_CR2","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695\u20131724.","journal-title":"Journal of the Operational Research Society"},{"key":"534_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"E Burke","year":"2006","unstructured":"Burke, E., Petrovic, S., & Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9, 115\u2013132.","journal-title":"Journal of Scheduling"},{"key":"534_CR4","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games, Chap. 4. Cambridge: Cambridge University Press.","DOI":"10.1017\/CBO9780511546921"},{"key":"534_CR5","unstructured":"Chang, K., Krishnamurthy, A., Agarwal, A., III, Daume, H., & Langford, J. (2015). Learning to search better than your teacher. In Proceedings of the 32nd international conference on machine learning, pp. 2058\u20132066."},{"issue":"1\u20134","key":"534_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00170-013-4843-y","volume":"67","author":"T Chen","year":"2013","unstructured":"Chen, T., Rajendran, C., & Wu, C. W. (2013). Advanced dispatching rules for large-scale manufacturing systems. The International Journal of Advanced Manufacturing Technology, 67(1\u20134), 1\u20133.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"534_CR7","first-page":"1871","volume":"9","author":"RE Fan","year":"2008","unstructured":"Fan, R. E., Chang, K. W., Hsieh, C. J., Wang, X. R., & Lin, C. J. (2008). LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research, 9, 1871\u20131874.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"534_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"issue":"1\u20132","key":"534_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C. P., & Selman, B. (2001). Algorithm portfolios. Artificial Intelligence, 126(1\u20132), 43\u201362.","journal-title":"Artificial Intelligence"},{"key":"534_CR10","unstructured":"Gurobi Optimization, Inc. (2014). Gurobi optimization (version 6.0.0) [software]. \n                        http:\/\/www.gurobi.com\/\n                        \n                    ."},{"key":"534_CR11","first-page":"97","volume":"3","author":"J Hannan","year":"1957","unstructured":"Hannan, J. (1957). Approximation to bayes risk in repeated play. Contributions to the Theory of Games, 3, 97\u2013139.","journal-title":"Contributions to the Theory of Games"},{"key":"534_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R Haupt","year":"1989","unstructured":"Haupt, R. (1989). A survey of priority rule-based scheduling. OR Spectrum, 11, 3\u201316.","journal-title":"OR Spectrum"},{"key":"534_CR13","doi-asserted-by":"crossref","unstructured":"Ingimundardottir, H., & Runarsson, T. P. (2011). Supervised learning linear priority dispatch rules for job-shop scheduling. In: Learning and intelligent optimization, Lecture Notes in Computer Science (Vol. 6683, pp. 263\u2013277). Berlin: Springer","DOI":"10.1007\/978-3-642-25566-3_20"},{"key":"534_CR14","doi-asserted-by":"crossref","unstructured":"Ingimundardottir, H., & Runarsson, T. (2014). Evolutionary learning of weighted linear composite dispatching rules for scheduling. In International conference on evolutionary computation theory and applications. SCITEPRESS.","DOI":"10.5220\/0005077200590067"},{"key":"534_CR15","doi-asserted-by":"crossref","unstructured":"Ingimundardottir, H., & Runarsson, T. P. (2015). Generating training data for learning linear composite dispatching rules for scheduling. In Learning and intelligent optimization, Lecture Notes in Computer Science (Vol. 8994, pp. 236\u2013248). Berlin: Springer.","DOI":"10.1007\/978-3-319-19084-6_22"},{"issue":"2","key":"534_CR16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0377-2217(03)00204-2","volume":"157","author":"M Jayamohan","year":"2004","unstructured":"Jayamohan, M., & Rajendran, C. (2004). Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operational Research, 157(2), 307\u2013321.","journal-title":"European Journal of Operational Research"},{"key":"534_CR17","unstructured":"Judah, K., Fern, A., & Dietterich, T. G. (2012). Active imitation learning via reduction to I.I.D. active learning. CoRR abs\/1210.4876."},{"key":"534_CR18","doi-asserted-by":"crossref","unstructured":"Kim, B., & Pineau, J. (2013). Maximum mean discrepancy imitation learning. In Robotics: Science and systems.","DOI":"10.15607\/RSS.2013.IX.038"},{"issue":"67","key":"534_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00170-013-4769-4","volume":"1","author":"P Korytkowski","year":"2013","unstructured":"Korytkowski, P., Rymaszewski, S., & Wi\u015bniewski, T. (2013). Ant colony optimization for job shop scheduling using multi-attribute dispatching rules. The International Journal of Advanced Manufacturing Technology, 1(67), 231\u2013241.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"534_CR20","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10951-005-4781-0","volume":"8","author":"X Li","year":"2005","unstructured":"Li, X., & Olafsson, S. (2005). Discovering dispatching rules using data mining. Journal of Scheduling, 8, 515\u2013527.","journal-title":"Journal of Scheduling"},{"issue":"1\u20134","key":"534_CR21","first-page":"19","volume":"67","author":"MS Lu","year":"2013","unstructured":"Lu, M. S., & Romanowski, R. (2013). Multicontextual dispatching rules for job shops with dynamic job arrival. The International Journal of Advanced Manufacturing Technology, 67(1\u20134), 19\u201333.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"6","key":"534_CR22","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10732-007-9051-1","volume":"14","author":"AM Malik","year":"2008","unstructured":"Malik, A. M., Russell, T., Chase, M., & Beek, P. (2008). Learning heuristics for basic block instruction scheduling. Journal of Heuristics, 14(6), 549\u2013569.","journal-title":"Journal of Heuristics"},{"issue":"4","key":"534_CR23","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s10845-011-0520-x","volume":"23","author":"S Meeran","year":"2012","unstructured":"Meeran, S., & Morshed, M. (2012). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study. Journal of intelligent manufacturing, 23(4), 1063\u20131078.","journal-title":"Journal of intelligent manufacturing"},{"key":"534_CR24","doi-asserted-by":"crossref","unstructured":"M\u00f6nch, L., Fowler, J. W., & Mason, S. J. (2013). Production planning and control for semiconductor wafer fabrication facilities. In Operations Research\/Computer Science Interfaces Series, Vol.\u00a052, chap.\u00a04. Berlin: Springer","DOI":"10.1007\/978-1-4614-4472-5"},{"issue":"1","key":"534_CR25","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ijpe.2010.06.004","volume":"128","author":"S Olafsson","year":"2010","unstructured":"Olafsson, S., & Li, X. (2010). Learning effective new single machine dispatching rules from optimal scheduling data. International Journal of Production Economics, 128(1), 118\u2013126.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"534_CR26","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar, S. S., & Iskander, W. (1977). A survey of scheduling rules. Operations Research, 25(1), 45\u201361.","journal-title":"Operations Research"},{"issue":"1","key":"534_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.ijpe.2012.10.016","volume":"145","author":"CW Pickardt","year":"2013","unstructured":"Pickardt, C. W., Hildebrandt, T., Branke, J., Heger, J., & Scholz-Reiter, B. (2013). Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems. International Journal of Production Economics, 145(1), 67\u201377.","journal-title":"International Journal of Production Economics"},{"key":"534_CR28","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"ML Pinedo","year":"2008","unstructured":"Pinedo, M. L. (2008). Scheduling: Theory, Algorithms, and Systems (3rd ed.). Berlin: Springer.","edition":"3"},{"key":"534_CR29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J. R. (1976). The algorithm selection problem. Advances in Computers, 15, 65\u2013118.","journal-title":"Advances in Computers"},{"key":"534_CR30","unstructured":"Ross, S., & Bagnell, D. (2010). Efficient reductions for imitation learning. In Proceedings of the thirteenth international conference on artificial intelligence and statistics, Vol. 9, pp. 661\u2013668."},{"key":"534_CR31","unstructured":"Ross, S., Gordon, G. J., & Bagnell, D. (2011). A reduction of imitation learning and structured prediction to no-regret online learning. In Proceedings of the fourteenth international conference on artificial intelligence and statistics, Vol. 15, pp. 627\u2013635. Journal of Machine Learning Research\u2014Workshop and Conference Proceedings."},{"key":"534_CR32","doi-asserted-by":"crossref","unstructured":"Ross, S., Melik-Barkhudarov, N., Shankar, K., Wendel, A., Dey, D., Bagnell, J., et al. (2013). Learning monocular reactive UAV control in cluttered natural environments. In IEEE international conference on robotics and automation, pp. 1765\u20131772.","DOI":"10.1109\/ICRA.2013.6630809"},{"key":"534_CR33","doi-asserted-by":"crossref","unstructured":"Runarsson, T. (2006). Ordinal regression in evolutionary computation. In Parallel problem solving from nature\u2014PPSN IX, Lecture Notes in Computer Science (Vol. 4193, pp. 1048\u20131057). Berlin: Springer.","DOI":"10.1007\/11844297_106"},{"key":"534_CR34","doi-asserted-by":"crossref","unstructured":"Runarsson, T. P., Schoenauer, M., & Sebag, M. (2012). Pilot, rollout and monte carlo tree search methods for job shop scheduling. In Learning and intelligent optimization, Lecture Notes in Computer Science, pp. 160\u2013174. Berlin: Springer.","DOI":"10.1007\/978-3-642-34413-8_12"},{"key":"534_CR35","doi-asserted-by":"crossref","unstructured":"Russell, T., Malik, A. M., Chase, M., & van Beek, P. (2009). Learning heuristics for the superblock instruction scheduling problem. IEEE Transactions on Knowledge and Data Engineering, 21(10), 1489\u20131502.","DOI":"10.1109\/TKDE.2009.17"},{"key":"534_CR36","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H., & Leyton-Brown, K. (2007). SATzilla-07: The design and analysis of an algorithm portfolio for SAT. In Principles and practice of constraint programming.","DOI":"10.1007\/978-3-540-74970-7_50"},{"issue":"1\u20134","key":"534_CR37","first-page":"157","volume":"67","author":"JM Yu","year":"2013","unstructured":"Yu, J. M., Doh, H. H., Kim, J. S., Kwon, Y. J., Lee, D. H., & Nam, S. H. (2013). Input sequencing and scheduling for a reconfigurable manufacturing system with a limited number of fixtures. The International Journal of Advanced Manufacturing Technology, 67(1\u20134), 157\u2013169.","journal-title":"The International Journal of Advanced Manufacturing Technology"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0534-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0534-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0534-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T07:58:15Z","timestamp":1531295895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0534-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,13]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["534"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0534-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,13]]}}}