1. A modified iterated greedy algorithm for flexible job shop scheduling problem;Al Aqel;Chin. J. Mech. Eng.,2019
2. Routing and scheduling in a flexible job shop by tabu search;Brandimarte;Ann. Oper. Res.,1993
3. Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems;Buddala;J. Ind. Eng. Int.,2018
4. Solving the flexible job shop scheduling problem using an improved Jaya algorithm;Caldeira;Comput. Ind. Eng.,2019
5. Chambers, J.B., Barnes, J.W. 1996. Tabu search for the flexible-routing job shop problem. The University of Texas, Austin, TX, Technical Report Series ORP96-10, Graduate Program in Operations Research and Industrial Engineering, 1–11. Retrieved from http://neo.lcc.uma.es/EAWebSite/SKELETON/TABU/ORP9610.PDF.gz.