Selected variants of a Memetic Algorithm for JSP – a comparative study

References

• Arango Serna, M. D., and C. A. Serna Uran. 2015. “A Memetic Algorithm for the Traveling Salesman Problem.” IEEE Latin America Transactions 13 (8): 2674–2679. doi:10.1109/TLA.2015.7332148.
   Web of Science ®Google Scholar
• Boryczka, U. 2004. “Ant Colony System for JSP”. In Cellular Automata: 6th International Conference on Cellular Automata for Research and Industry, ACRI 2004, Amsterdam: October 25–28, 2004. Proceedings: 296–305. doi:10.1007/978-3-540-30479-1_31.
   Google Scholar
• Boryczka, U. 2006. Algorytmy optymalizacji mrowiskowej. Katowice: Wydawnictwo Uniwersytetu Śląskiego.
   Google Scholar
• Braglia, M., G. Carmignani, and F. Zammori. 2006. “A New Value Stream Mapping Approach for Complex Production Systems.” International Journal of Production Research 44 (18–19): 3929–3952. doi:10.1080/00207540600690545.
   Web of Science ®Google Scholar
• Brucker, P. 2001. Scheduling Algorithms. New York: Springer-Verlag.
   Google Scholar
• Chong, C., Low Hean, and K. Gay. 2006. “A Bee Colony Optimization Algorithm to Job Shop Scheduling”. In Proceedings of the 2006 Winter Simulation Conference.
   Google Scholar
• Cormen, T. H., C. E. Leiserson, R. L. Rivest, and C. Stein. 2009. Introduction to Algorithms. 3rd ed. Cambridge, MA: MIT Press.
   Google Scholar
• Cutillas-Lozano, J., D. Giménez, and F. Almeida. 2015. “Hyperheuristics Based on Parametrized Metaheuristic Schemes”. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation GECCO '15, 361–368. doi:10.1145/2739480.2754641.
   Google Scholar
• Dawkins, R. 1976. The Selfish Gene. New York: Oxford University Press.
   Google Scholar
• Dell'Amico, M., and M. Trubian. 1993. “Applying Tabu Search to the Job-Shop Scheduling Problem.” Annals of Operations Research 41 (3): 231–252. doi:10.1007/BF02023076.
   Google Scholar
• Gao, L., Z. Guohui, A. Liping, and L. Xinyu. 2011. “An Efficient Memetic Algorithm for Solving the Job Shop Scheduling Problem.” Computers & Industrial Engineering 60 (4): 699–705. doi:10.1016/j.cie.2011.01.003.
   Web of Science ®Google Scholar
• González, O. M., and C. Segura. 2017. “A Memetic Algorithm for the Capacitated Vehicle Routing Problem with Time Windows”. In IEEE Congress on Evolutionary Computation (CEC), San Sebastian, 2017, 2582–2589. doi:10.1109/CEC.2017.7969619.
   Google Scholar
• Hasan, S., R. Sarker, D. Essam, and D. Cornforth. 2009. “Memetic Algorithms for Solving Job-Shop Scheduling Problems.” Memetic Computing 1 (1): 69–83. doi: 10.1007/s12293-008-0004-5
   Google Scholar
• Hoitomt, D., P. Luh, and K. Pattipati. 1993. “A Practical Approach to Job-Shop Scheduling Problems.” IEEE Transactions on Robotics and Automation 9: 1–13. doi: 10.1109/70.210791
   Google Scholar
• Jansen, K., M. Mastrolilli, and R. Solis-Oba. 2005. “Approximation Schemes for Job Shop Scheduling Problems with Controllable Processing Times.” European Journal of Operational Research 167 (2): 297–319. doi:10.1016/j.ejor.2004.03.025.
   Web of Science ®Google Scholar
• Jasti, N. V. K., and R. Kodali. 2014. “Lean Production: Literature Review and Trends.” International Journal of Production Research 53 (3): 297–319. doi:10.1080/00207543.2014.937508.
   Web of Science ®Google Scholar
• Karlsson, C., and P. Åhlström. 1996. “Assessing Changes Towards Lean Production.” International Journal of Operations & Production Management 16 (2): 24–41. doi:10.1108/01443579610109820.
   Web of Science ®Google Scholar
• Krasnogor, N., A. Aragón, and J. Pacheco. 2006. “Memetic Algorithms.” In Metaheuristic Procedures for Training Neural Networks, edited by Enrique Alba and Rafael Martí, 225–248. New York: Springer US. doi:10.1007/0-387-33416-5.
   Google Scholar
• Lamos-Díaz, H., K. Aguilar-Imitola, Y. Pérez-Díaz, and S. Galván-Núñez. 2017. “A Memetic Algorithm for Minimizing the Makespan in the Job Shop Scheduling Problem.” Revista Facultad de Ingeniería 26 (44): 113–123.
   Google Scholar
• Lee, H., and S. Sutinah. 2006. “A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem.” Matematika 2 (22): 91–107.
   Google Scholar
• Li, X., and L. Gao. 2016. “An Effective Hybrid Genetic Algorithm and Tabu Search for Flexible Job Shop Scheduling Problem.” International Journal of Production Economics 174: 93–110. doi:10.1016/j.ijpe.2016.01.016.
   Web of Science ®Google Scholar
• Molina, D., F. Herrera, and M. Lozano. 2005. “Adaptive Local Search Parameters for Real-Coded Memetic Algorithms”. In 2005 IEEE Congress on Evolutionary Computation, Vol. 1, 888–895. doi:10.1109/CEC.2005.1554777.
   Google Scholar
• Moscato, P. 1989. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts – Towards Memetic Algorithms.
   Google Scholar
• Pezzella, F., and E. Merelli. 2000. “A Tabu Search Method Guided by Shifting Bottleneck for the Job Shop Scheduling Problem.” European Journal of Operational Research 120 (2): 297–310. doi:10.1016/S0377-2217(99)00158-7.
   Web of Science ®Google Scholar
• Poikolainen, I. 2014. “Simple Memetic Computing Structures for Global Optimization.” PhD diss., University of Jyväskylä
   Google Scholar
• Ponnambalam, S. G., N. Jawahar, and B. S. Girish. 2009. Giffler and Thompson Procedure Based Genetic Algorithms for Scheduling Job Shops. In: Computational Intelligence in Flow Shop and Job Shop Scheduling. Studies in Computational Intelligence, edited by U. K. Chakraborty, Vol. 230, 229–259. Berlin: Springer. doi:10.1007/978-3-642-02836-6_8.
   Google Scholar
• Shen, X., and X. Yao. 2015. “Mathematical Modeling and Multi-Objective Evolutionary Algorithms Applied to Dynamic Flexible Job Shop Scheduling Problems.” Information Sciences 298: 198–224. doi:10.1016/j.ins.2014.11.036.
   Web of Science ®Google Scholar
• Szwarc, K., and U. Boryczka. 2017. “A Comparative Study of Different Variants of a Memetic Algorithm for ATSP”. In: Computational Collective Intelligence. ICCCI 2017, Lecture Notes in Computer Science, edited by N. Nguyen, G. Papadopoulos, P. Jedrzejowicz, B. Trawiński, and G. Vossen, Vol. 10449, 76–86. Cham: Springer. doi:10.1007/978-3-319-67077-5_8.
   Google Scholar
• Talbi, E. 2009. Metaheuristics: From Design to Implementation. Hoboken, NJ: John Wiley & Sons, Inc.
   Google Scholar
• van Laarhoven, P., E. Aarts, and J. Lenstra. 1992. “Job Shop Scheduling by Simulated Annealing.” Operations Research 40 (1): 113–125. doi:10.1287/opre.40.1.113.
   Web of Science ®Google Scholar
• Wang, J., and A. Kusiak. 2000. Computational Intelligence In Manufacturing Handbook. Handbook Series for Mechanical Engineering. Boca Raton: CRC Press.
   Google Scholar
• Weckman, G. R., C. V. Ganduri, and D. A. Koonce. 2008. “A Neural Network Job-Shop Scheduler.” Journal of Intelligent Manufacturing 19 (2): 191–201. doi:10.1007/s10845-008-0073-9.
   Web of Science ®Google Scholar
• Werner, F. 2011. “A Survey of Genetic Algorithms for Shop Scheduling Problems.” Preprint. Vol. 11(31), 1–66.
   Google Scholar
• Wolpert, D. H., and W. G. Macready. 1997. “No Free Lunch Theorems for Optimization.” IEEE Transactions on Evolutionary Computation 1 (1): 67–82. doi:10.1109/4235.585893.
   Google Scholar
• Yuan, Y., and H. Xu. 2015. “Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms.” IEEE Transactions on Automation Science and Engineering 12 (1): 336–353. doi:10.1109/TASE.2013.2274517.
   Web of Science ®Google Scholar