Evolutionary Learning of Weighted Linear Composite Dispatching Rules for Scheduling

Helga Ingimundardottir, Thomas Philip Runarsson

Abstract

A prevalent approach to solving job shop scheduling problems is to combine several relatively simple dispatching rules such that they may benefit each other for a given problem space. Generally, this is done on an ad-hoc basis, requiring expert knowledge from heuristics designer, or extensive exploration of suitable combinations of heuristics. The approach here, is to automate that selection, by translating dispatching rules into measurable features and optimising what their contribution should be via evolutionary search. The framework is straight forward and easy to implement and shows promising results. Various data distributions are investigated, for both job shop and flow shop problems, as is scalability for higher dimensions. Moreover, the study shows that the choice of objective function for evolutionary search is worth investigating. Since the optimisation is based on minimising the expected mean of the fitness function over a large set of problem instances, which can vary within. Then normalising the objective function can stabilise the optimisation process away from local minima.

References

  1. Ak, B. and Koc, E. (2012). A Guide for Genetic Algorithm Based on Parallel Machine Scheduling and Flexible Job-Shop Scheduling. Procedia - Social and Behavioral Sciences, 62:817-823.
  2. Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., and Qu, R. (2013). Hyper-heuristics: a survey of the state of the art. Journal of the Operational Research Society, 64(12):1695-1724.
  3. Cheng, R., Gen, M., and Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithmsI. Representation. Computers & Industrial Engineering, 30(4):983-997.
  4. Cheng, R., Gen, M., and Tsujimura, Y. (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Computers & Industrial Engineering, 36(2):343-364.
  5. Dhingra, A. and Chandna, P. (2010). A bi-criteria Mmachine SDST flow shop scheduling using modified heuristic genetic algorithm. International Journal of Engineering, Science and Technology, 2(5):216-225.
  6. Gurobi Optimization, Inc. (2013). (version 5.6.2) [software].
  7. Hansen, N. and Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evol. Comput., 9(2):159-195.
  8. Haupt, R. (1989). A survey of priority rule-based scheduling. OR Spectrum, 11:3-16.
  9. Ingimundardottir, H. and Runarsson, T. P. (2011a). Sampling strategies in ordinal regression for surrogate assisted evolutionary optimization. In Intelligent Systems Design and Applications (ISDA), 2011 11th International Conference on, pages 1158-1163.
  10. Ingimundardottir, H. and Runarsson, T. P. (2011b). Supervised learning linear priority dispatch rules for jobshop scheduling. In Coello, C., editor, Learning and Intelligent Optimization, volume 6683 of Lecture Notes in Computer Science, pages 263-277. Springer, Berlin, Heidelberg.
  11. Ingimundardottir, H. and Runarsson, T. P. (2012). Determining the characteristic of difficult job shop scheduling instances for a heuristic solution method. In Hamadi, Y. and Schoenauer, M., editors, Learning and Intelligent Optimization, Lecture Notes in Computer Science, pages 408-412. Springer, Berlin, Heidelberg.
  12. Jayamohan, M. and Rajendran, C. (2004). Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operational Research, 157(2):307-321.
  13. Koza, J. R. and Poli, R. (2005). Genetic programming. In Burke, E. and Kendal, G., editors, Introductory Tutorials in Optimization and Decision Support Techniques, chapter 5. Springer.
  14. Nguyen, S., Zhang, M., Johnston, M., and Tan, K. C. (2013). Learning iterative dispatching rules for job shop scheduling with genetic programming. The International Journal of Advanced Manufacturing Technology.
  15. Panwalkar, S. S. and Iskander, W. (1977). A survey of scheduling rules. Operations Research, 25(1):45-61.
  16. Pinedo, M. L. (2008). Scheduling: Theory, Algorithms, and Systems. Springer Publishing Company, Incorporated, 3 edition.
  17. Qing-dao-er ji, R. and Wang, Y. (2012). A new hybrid genetic algorithm for job shop scheduling problem. Computers & Operations Research, 39(10):2291- 2299.
  18. Rice, J. R. (1976). The algorithm selection problem. Advances in Computers, 15:65-118.
  19. Smith-Miles, K., James, R., Giffin, J., and Tu, Y. (2009). A knowledge discovery approach to understanding relationships between scheduling problem structure and heuristic performance. In Sttzle, T., editor, Learning and Intelligent Optimization, volume 5851 of Lecture Notes in Computer Science, pages 89-103. Springer, Berlin, Heidelberg.
  20. Smith-Miles, K. and Lopes, L. (2011). Generalising algorithm performance in instance space: A timetabling case study. In Coello, C., editor, Learning and Intelligent Optimization, volume 6683 of Lecture Notes in Computer Science, pages 524-538. Springer, Berlin, Heidelberg.
  21. Tay, J. C. and Ho, N. B. (2008). Evolving dispatching rules using genetic programming for solving multiobjective flexible job-shop problems. Computers and Industrial Engineering, 54(3):453-473.
  22. Tsai, J.-T., Liu, T.-K., Ho, W.-H., and Chou, J.-H. (2007). An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover. The International Journal of Advanced Manufacturing Technology, 38(9-10):987-994.
  23. Vázquez-Rodríguez, J. A. and Petrovic, S. (2009). A new dispatching rule based genetic algorithm for the multiobjective job shop problem. Journal of Heuristics, 16(6):771-793.
  24. Watson, J.-P., Barbulescu, L., Whitley, L. D., and Howe, A. E. (2002). Contrasting structured and random permutation flow-shop scheduling problems: Searchspace topology and algorithm performance. INFORMS Journal on Computing, 14:98-123.
Download


Paper Citation


in Harvard Style

Ingimundardottir H. and Runarsson T. (2014). Evolutionary Learning of Weighted Linear Composite Dispatching Rules for Scheduling . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014) ISBN 978-989-758-052-9, pages 59-67. DOI: 10.5220/0005077200590067


in Bibtex Style

@conference{ecta14,
author={Helga Ingimundardottir and Thomas Philip Runarsson},
title={Evolutionary Learning of Weighted Linear Composite Dispatching Rules for Scheduling},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)},
year={2014},
pages={59-67},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005077200590067},
isbn={978-989-758-052-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)
TI - Evolutionary Learning of Weighted Linear Composite Dispatching Rules for Scheduling
SN - 978-989-758-052-9
AU - Ingimundardottir H.
AU - Runarsson T.
PY - 2014
SP - 59
EP - 67
DO - 10.5220/0005077200590067