SavedAdd your journal

Journals / Ege Akademik Bakış Dergisi / 2023 / Cilt: 23 Sayı: 2

Minimizing Makespan in a Permutation Flow Shop Environment: Comparison of Scatter Search, Genetic Algorithm and Greedy Randomized Adaptive Search Procedures

Ural Gökay ÇİÇEKLİ
Fatma DEMİRCAN KESKİN
Murat KOCAMAZ
Pages
237–246
Publication Date
2023-05-10
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

From this point of view, SS, GA, and GRASP are employed in this study, and their performances are compared.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Solving scheduling problems enables more efficient use of production capacity.
📊
Key Findings & Data:In this study, the performances of these methods are compared through various test problems in the literature and a real-life problem of a company operating in the automotive sector.
💡
Conclusion & Impact:From this point of view, SS, GA, and GRASP are employed in this study, and their performances are compared.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Scheduling · Permutation Flow Shop Scheduling Problem · Makespan

Abstract

Solving scheduling problems enables more efficient use of production capacity. It involves defining the sequence of operations, determining the capacity of resources, and balancing workloads. Different methods, especially metaheuristics, have been used to solve these problems. This study presents the application of Scatter Search (SS), Genetic Algorithm (GA), and Greedy Randomized Adaptive Search Procedures (GRASP) for minimizing makespan in a permutation flow shop environment. In this study, the performances of these methods are compared through various test problems in the literature and a real-life problem of a company operating in the automotive sector. Study comprises 48 jobs that must be planned within a day for eight consecutive operations. In cellular manufacturing, the sequence in which each job is processed in eight operations is the same. In solving permutation flow shop scheduling problems (PFSP), one of the NP-hard problems, meta-heuristic methods are widely applied due to their successful results. From this point of view, SS, GA, and GRASP are employed in this study, and their performances are compared.

🔖

Cite This Article

ÇİÇEKLİ, U. G., KESKİN, F. D., KOCAMAZ, M. (2023). Minimizing Makespan in a Permutation Flow Shop Environment: Comparison of Scatter Search, Genetic Algorithm and Greedy Randomized Adaptive Search Procedures. Ege Akademik Bakış Dergisi, Cilt: 23 Sayı: 2, 237–246. https://ajindex.com/articles/937267

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (11)

  1. Allahverdi, A. (2003). The two and m-machine flow shop scheduling problem with bi-criteria of makespan and mean flow time. European Journal of Operational Research, 147: 373–396.
  2. Arroyo, J.E.C. and de Souza Pereira, A. A. (2011). A GRASP heuristic for the multi-objective permutation flowshop scheduling problem. International Journal of Advanced Manufacturing Technology, 55(5): 741-753.
  3. Babaei, M., Mohammadi, M., Ghomi, S. M. T. F. and Sobhanallahi, M. A. (2012). Two parameter-tuned metaheuristic algorithms for the multi-level lot sizing and scheduling problem. International Journal of Industrial Engineering Computations, 3(5): 751–766.
  4. Bautista, J., Cano, A., Companys, R., & Ribas, I. (2012). Solving the Fm∣ block∣ Cmax problem using bounded dynamic programming. Engineering Applications of Artificial Intelligence, 25(6), 1235-1245.
  5. Ben-Daya, M. and Al-Fawzan, M. (1998). A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research, l09, 88-95.
  6. Borovska, P. (2006, June). Solving the travelling salesman problem in parallel by genetic algorithm on multicomputer cluster. In International Conference on Computer Systems and Technologies-CompSysTech (Vol. 6, No. 2.11). Bozejko, W. and Wodecki, M. (2008). Parallel Scatter Search Algorithm for the Flow Shop Sequencing Problem. Wyrzykowski, R., Dongarra, J., Karczewski K. and Wasniewski, J. (Eds.). Parallel Processing and Applied Mathematics (pp.180-188). Springer-Verlag Berlin Heidelberg. Campbell, H. G., Dudek, R. A. and Smith, M. L. (1970). A Heuristic Algorithm for the n job, m Machine Sequencing Problem. Management Science, 16(10): B630-B637. Çiçekli, U. G. and Bozkurt, S. (2015). Permütasyon Akış Tipi Çizelgeleme Probleminin Dağınık Arama İle Optimizasyonu. 15. Üretim Araştırmaları Sempozyumu, pp: 443-452, İzmir, 14-16 Ekim, 2015.
  7. Çiçekli, U. G. and Kaymaz, Y. (2016). A Genetic Algorithm For The Allocation of Dangerous Goods Containers In A Storage Yard For Freight Villages and Dry Ports. Gazi University Journal of Faculty of Economics and Administrative Sciences, 18(1): 264-282.
  8. Feo, T. and Resende, M.G.C. (1995). Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6: 109–134.
  9. Festa, P. and Resende, M. G. (2002). GRASP: An annotated bibliography. In Essays and surveys in metaheuristics (pp. 325-367).
  10. Springer, Boston, MA. Goldberg D.E. (1989).
  11. Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, USA. Gupta, J. (1972)