Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem

  • Wojciech Bożejko
  • Andrzej Gnatowski
  • Teodor Niżyński
  • Mieczysław Wodecki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9693)

Abstract

In the work there is a NP-hard cyclic job shop problem of tasks scheduling considered. To its solution there was tabu search algorithm implemented using neural mechanism to prevent looping of the algorithm. There were computational experiments conducted that showed statistically significant efficacy of the proposed tabu method as compared to classical list of forbidden moves.

Keywords

Discrete optimization Tabu search Scheduling 

References

  1. 1.
    Battaïa, O., Dolgui, A.: A taxonomy of line balancing problems and their solution approaches. Int. J. Prod. Econ. 142(2), 259–277 (2013)CrossRefGoogle Scholar
  2. 2.
    Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)CrossRefGoogle Scholar
  3. 3.
    Ben-Daya, M., Al-Fawzan, M.: A tabu search approach for the flow shop scheduling problem. Eur. J. Oper. Res. 109(1), 88–95 (1998)CrossRefMATHGoogle Scholar
  4. 4.
    Bożejko, W., Gnatowski, A., Pempera, J., Wodecki, M.: Parallel tabu search metaheuristics for the cyclic job shop scheduling problem. Computers and Industrial Engineering (2015, Submitted)Google Scholar
  5. 5.
    Bożejko, W., Gniewkowski, U., Pempera, J., Wodecki, M.: Cyclic hybrid flowshop scheduling problem with machine setups. Procedia Comput. Sci. 29, 2127–2136 (2014)CrossRefGoogle Scholar
  6. 6.
    Bożejko, W., Pempera, J., Wodecki, M.: Parallel simulated annealing algorithm for cyclic flexible job shop scheduling problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing. LNCS, vol. 9120, pp. 603–612. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  7. 7.
    Bożejko, W., Uchroski, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)CrossRefGoogle Scholar
  8. 8.
    Bożejko, W., Wodecki, M.: On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2), 227–231 (2007)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Bożejko, W., Hejducki, Z., Uchroński, M., Wodecki, M.: Solving the flexible job shop problem on Multi-GPU. Procedia Computer Science, 9, 2020–2023 (2012). Proceedings of the International Conference on Computational Science, ICCS (2012)Google Scholar
  10. 10.
    Bożejko, W., Uchroński, M.: A neuro-tabu search algorithm for the job shop problem. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010, Part II. LNCS, vol. 6114, pp. 387–394. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  11. 11.
    Bożejko, W., Uchroński, M., Wodecki, M.: The new golf neighborhood for the exible job shop problem. Procedia Comput. Sci. 1(1), 289–296 (2010). ICCSCrossRefGoogle Scholar
  12. 12.
    Bożejko, W., Uchroński, M., Wodecki, M.: Parallel neuro-tabu search algorithm for the job shop scheduling problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2013, Part II. LNCS, vol. 7895, pp. 489–499. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  13. 13.
    Bożejko, W., Uchroński, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)CrossRefGoogle Scholar
  14. 14.
    Brucker, P., Heitmann, S., Hurink, J.: Flow-shop problems with intermediate buffers. OR Spectrum 25(4), 549–574 (2003)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Hasegawa, M., Ikeguchi, T., Aihara, K.: Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Phys. Rev. Lett. 79(12), 2344 (1997)CrossRefGoogle Scholar
  17. 17.
    Levner, E., Kats, V., de Pablo, D.A.L., Cheng, T.E.: Complexity of cyclic scheduling problems: a state-of-the-art survey. Comput. Ind. Eng. 59(2), 352–361 (2010)CrossRefGoogle Scholar
  18. 18.
    Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 797–813 (1996)CrossRefMATHGoogle Scholar
  19. 19.
    Solimanpur, M., Vrat, P., Shankar, R.: A neuro-tabu search heuristic for the flow shop scheduling problem. Comput. Oper. Res. 31(13), 2151–2164 (2004)CrossRefMATHGoogle Scholar
  20. 20.
    Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47(1), 65–74 (1990)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Wojciech Bożejko
    • 1
  • Andrzej Gnatowski
    • 1
  • Teodor Niżyński
    • 1
  • Mieczysław Wodecki
    • 2
  1. 1.Department of Automatics, Mechatronics and Control Systems, Faculty of ElectronicsWrocław University of TechnologyWrocławPoland
  2. 2.Institute of Computer ScienceUniversity of WrocławWrocławPoland

Personalised recommendations