job shop scheduling problem:literature review
Article Sidebar
Main Article Content
Abstract
As an extension of the Job Shop Scheduling (JSP), Flexible job-shop Scheduling Problem (FJSP), can be defined as one of the most significant problems in up-to-date manufacturing systems, recently a lot of studies have been conducted to address FJSP. Initially, the problem can be defined, after that, literature can be categorized based on different methods that have used from the year 2010 for the resolution of this problem. Lastly, certain conclusions have been provided based on the results of the conducted survey.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
References
[1] Elgendy, A. E., Hussein, M. and Elhakeem, A. (2017). Optimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm. International Journal of Current Engineering and Technology, 7(2):368-373.
[2] Effatparvar, M., et al. (2016). Swarm Intelligence Algorithm for Job Scheduling in Computational Grid. 7th International Conference on Intelligent Systems, Modelling and Simulation(ISMS). Bangkok: p. 315-317.
[3] Lee, S., et al. (2012). Flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints. International Journal of Production Research, 50(7):1-23. [4] Hussein, Q. M. and Hasoon, A. N.(2017). Dynamic Process Scheduling Using Genetic Algorithm. Annual Conference on New Trends in Information & Communications Technology Applications-(NTICT'2017) 7 - 9 March 2017: p. 111-115.
[5] Chaudhry, A. I. (2012). Job shop scheduling problem with alternative machines using genetic algorithms. Journal of Central South University of Technology, 19(5):1322−1333.
[6] Tanga, J., et al. (2011). A Hybrid Algorithm for Flexible Job-shop Scheduling Problem. Procedia Engineering, 15(2011):3678-3683.
[7] Song, L. and Xu, X. (2010). Flexible Job Shop Scheduling Problem Solving Based on Genetic Algorithm with Chaotic Local Search. Sixth International Conference on Natural Computation, ICNC 2010, Yantai, Shandong, China, 10-12 August 2010.
[8] Al Aqel, G., Li, X. and Gao, L. (2019). A Modifed Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem. Chinese Journal of Mechanical Engineering, 32(21):1-11.
[9] Huang, S. et al. (2016). Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. SpringerPlus, 5(1432):1-22. [10] Wang, L. et al. (2017). Flexible Job Shop Scheduling Problem Using an Improved Ant Colony Optimization. Hindawi Scientific Programming, 2017(3):1-11.
[11] Weber, R. (1982). Scheduling Jobs with Stochastic Processing Requirements on Parallel Machines to Minimize Makespan or Flowtime. Journal of Applied Probability, 19(1):167-182.
[12] Kacem, I., Hammadi, S. and Borne, P. (2002). Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60(3-5):245–276.
[13] Özgüven, C., et al. (2010). Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied Mathematical Modelling, 34(6):1539–1548.
[14] Li, J, et al. (2011). A Hybrid Artificial Bee Colony Algorithm for Flexible Job Shop Scheduling Problems. Int. J. of Computers, ommunications & Control, 6(2):286-296.
[15] Tanga, J., et al. (2011). A Hybrid Algorithm for Flexible Job-shop Scheduling Problem. advance in control engineering and information science, 15(2011):3678-3683.
[16] Barzegar, B., et al. (2012). Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net. Journal of Applied Mathematics, 2012:1-20.
[17] Dai, M., et al. (2013). Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robotics and Computer-Integrated Manufacturing, 29(5):418-429.
[18] Ziaee, M. (2014). A heuristic algorithm for solving flexible job shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 71:519-528.
[19] Karthikeyan, S., et al. (2015). A hybrid discrete firefly algo-rithm for solving multi-objective flexible job shop scheduling problems. International Journal of BioInspired Computation, 7(6):386-407.
[20] Palacios, J. J. et al. (2015). Genetic tabu search for the fuzzy fexible job shop problem. Computers & Operations Research, 54:74-89.
[21] Chang, H.-C. et al. (2015). Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm. IEEE ACCESS, 3:1740-1754.
[22] Sobeyko, O., Mönch, L. (2016). Heuristic approaches for scheduling jobs in large-scale flexible
job shops. Computers & Operations Research, 68:97-109. [23] Gao, K. Z. et al. (2016). Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowledge-Based Systems, 109:1-16.
[24] Muthiah, A., Rajkumar, A. and Rajkumar, R. (2016). Hybridization of artificial bee colony algorithm with particle swarm optimization algorithm for flexible job shop scheduling. Energy Efficient Technologies for Sustainability (ICEETS), 2016 International Conference on: p. 896-903.
[25] Li, X. and Gao, L. (2016). An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. International Journal of Production Economics, 174:93-110.
[26] Ortiz, M. et al. (2016). Solving Flexible Job-Shop Scheduling Problem with Transfer Batches, Setup Times and Multiple Resources in Apparel Industry. 7th International Conference, ICSI 2016, Bali, Indonesia, June 25-30, 2016, Proceedings, Part II: P. 47-58.
[27] Tochev, A. and Guliashki, V. (2016). A Hybrid Metaheuristic Algorithm for Flexible Job Shop Scheduling "PSO&TS". International Scientific Conference on Information, Communication and Energy Systems and Technologies: p. 231-234.
[28] Wu, J., Wu, G. d. and Wang, J.-l. (2017). Flexible job-shop scheduling problem based on hybrid ACO algorithm. International Journal of Simulation Modelling (IJSIMM), 16(3):497-505.
[29] Xu, H., Bao, Z. R. and Zhang, T. (2017). Solving dual flexible job‐shop scheduling problem using a Bat Algorithm. Advances in Production Engineering & Management, 12 (1):5-16.
[30] Nouri, H. E., Driss. O. B. and Ghédira, K. (2018). Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model. Springer .J Ind Eng Int, 14:1-14.
[31] Gaham, M., Bouzouia, B. and Achour, N. (2018). An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion. Applied Intelligence, 48(6):1423-1441.
[32] Huang, M., Mingxu, W. and Xu, L. (2016). An improved genetic algorithm using opposition-based learning for flexible job-shop scheduling problem. Cloud Computing and Internet of Things (CCIOT), 2016 2nd International Conference on: p. 8-15. [33] Dziurzanski, P. et al. (2019). Solving the Multi-Objective Flexible Job-Shop Scheduling Problem with Alternative Recipes for a Chemical Production Process. Applications of Evolutionary Computation - 22nd International Conference EvoApplications 2019. Lecture Notes in Computer Science: p. 33-48. [34] Gu, X.-L., Huang, M. and Liang, X. (2020). A Discrete Particle Swarm Optimization Algorithm With Adaptive Inertia Weight for Solving Multiobjective Flexible Job - shop Scheduling Problem. IEEE Access, 8:33125 – 33136.