Advertisement

Journal of Scheduling

, Volume 21, Issue 4, pp 413–428 | Cite as

Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem

  • Helga Ingimundardottir
  • Thomas Philip Runarsson
Article

Abstract

Dispatching rules can be automatically generated from scheduling data. This paper will demonstrate that the key to learning an effective dispatching rule is through the careful construction of the training data, \(\{\mathbf {x}_i(k),y_i(k)\}_{k=1}^K\in {\mathscr {D}}\), where (i) features of partially constructed schedules \(\mathbf {x}_i\) should necessarily reflect the induced data distribution \({\mathscr {D}}\) for when the rule is applied. This is achieved by updating the learned model in an active imitation learning fashion; (ii) \(y_i\) is labelled optimally using a MIP solver; and (iii) data need to be balanced, as the set is unbalanced with respect to the dispatching step k. Using the guidelines set by our framework the design of custom dispatching rules, for a particular scheduling application, will become more effective. In the study presented three different distributions of the job-shop will be considered. The machine learning approach considered is based on preference learning, i.e. which dispatch (post-decision state) is preferable to another.

Keywords

Scheduling Composite dispatching rules Performance analysis Imitation learning DAgger Preference learning 

References

  1. Andresen, M., Engelhardt, F., & Werner, F. (2010). LiSA—A Library of Scheduling Algorithms (version 3.0) [software]. http://www.math.ovgu.de/Lisa.html.
  2. 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–1724.CrossRefGoogle Scholar
  3. Burke, E., Petrovic, S., & Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9, 115–132.CrossRefGoogle Scholar
  4. Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games, Chap. 4. Cambridge: Cambridge University Press.Google Scholar
  5. 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–2066.Google Scholar
  6. 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–4), 1–3.CrossRefGoogle Scholar
  7. 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–1874.Google Scholar
  8. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.CrossRefGoogle Scholar
  9. Gomes, C. P., & Selman, B. (2001). Algorithm portfolios. Artificial Intelligence, 126(1–2), 43–62.CrossRefGoogle Scholar
  10. Gurobi Optimization, Inc. (2014). Gurobi optimization (version 6.0.0) [software]. http://www.gurobi.com/.
  11. Hannan, J. (1957). Approximation to bayes risk in repeated play. Contributions to the Theory of Games, 3, 97–139.Google Scholar
  12. Haupt, R. (1989). A survey of priority rule-based scheduling. OR Spectrum, 11, 3–16.CrossRefGoogle Scholar
  13. 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–277). Berlin: SpringerGoogle Scholar
  14. 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.Google Scholar
  15. 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–248). Berlin: Springer.Google Scholar
  16. 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–321.CrossRefGoogle Scholar
  17. Judah, K., Fern, A., & Dietterich, T. G. (2012). Active imitation learning via reduction to I.I.D. active learning. CoRR abs/1210.4876.Google Scholar
  18. Kim, B., & Pineau, J. (2013). Maximum mean discrepancy imitation learning. In Robotics: Science and systems.Google Scholar
  19. Korytkowski, P., Rymaszewski, S., & Wiśniewski, T. (2013). Ant colony optimization for job shop scheduling using multi-attribute dispatching rules. The International Journal of Advanced Manufacturing Technology, 1(67), 231–241.CrossRefGoogle Scholar
  20. Li, X., & Olafsson, S. (2005). Discovering dispatching rules using data mining. Journal of Scheduling, 8, 515–527.CrossRefGoogle Scholar
  21. 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–4), 19–33.CrossRefGoogle Scholar
  22. Malik, A. M., Russell, T., Chase, M., & Beek, P. (2008). Learning heuristics for basic block instruction scheduling. Journal of Heuristics, 14(6), 549–569.CrossRefGoogle Scholar
  23. 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–1078.CrossRefGoogle Scholar
  24. Mönch, 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. 52, chap. 4. Berlin: SpringerGoogle Scholar
  25. Olafsson, S., & Li, X. (2010). Learning effective new single machine dispatching rules from optimal scheduling data. International Journal of Production Economics, 128(1), 118–126.CrossRefGoogle Scholar
  26. Panwalkar, S. S., & Iskander, W. (1977). A survey of scheduling rules. Operations Research, 25(1), 45–61.CrossRefGoogle Scholar
  27. 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–77.CrossRefGoogle Scholar
  28. Pinedo, M. L. (2008). Scheduling: Theory, Algorithms, and Systems (3rd ed.). Berlin: Springer.Google Scholar
  29. Rice, J. R. (1976). The algorithm selection problem. Advances in Computers, 15, 65–118.CrossRefGoogle Scholar
  30. 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–668.Google Scholar
  31. 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–635. Journal of Machine Learning Research—Workshop and Conference Proceedings.Google Scholar
  32. 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–1772.Google Scholar
  33. Runarsson, T. (2006). Ordinal regression in evolutionary computation. In Parallel problem solving from nature—PPSN IX, Lecture Notes in Computer Science (Vol. 4193, pp. 1048–1057). Berlin: Springer.Google Scholar
  34. 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–174. Berlin: Springer.Google Scholar
  35. 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–1502.Google Scholar
  36. 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.Google Scholar
  37. 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–4), 157–169.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.University of Iceland, School of Engineering and Natural SciencesReykjavíkIceland

Personalised recommendations