Çok Amaçlı Esnek Atölye Tipi Çizelgeleme Problemlerinin Çözümünde Meta Sezgisel Yöntemlerin Kullanımı

Esnek atölye tipi çizelgeleme problemleri işlerin makinelere atanması ve sıralanması alt problemlerinden oluşmaktadır. Bu tür problemlerin çözümü için literatürde hiyerarşik ve bütünleşik olmak üzere iki tür çözüm yaklaşımı geliştirilmiştir. Hiyerarşik çözüm yaklaşımında işlerin atama ve sıralama alt problemleri birbirinden bağımsız gerçekleştirilirken, bütünleşik yaklaşımda bu iki alt problem eş zamanlı çözülmektedir. Çok amaçlı Esnek atölye tipi çizelgeleme problemleri üzerine literatürde sınırlı sayıda çalışma vardır. Bu tür problemleri yüksek hesaplama karmaşasından dolayı geleneksel optimizasyon yöntemleriyle çözmek, optimal sonuçlarını elde etmek oldukça zordur. Bu tür problemlerin çözümünde sıklıkla meta sezgisel yöntemlere başvurulmaktadır. Bu çalışmada çizelgeleme alanının en zor problem sınıfından olan esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik önerilerde bulunulmuştur. Meta sezgisel yöntemlere en kısa işlem zamanı gibi basit sıralama kuralları ve yerel arama algoritmalarının melezlenmesi uygulamalı olarak verilmiştir.

Anahtar Kelimeler:

Esnek Atölye tipi çizelgeleme, Meta Sezgisel Yöntemler, Yerel Arama, Çok Amaçlı Optimizasyon

PDF

___

[1] H. Liu, A. Abraham and Z. Wang, "A Multi-swarm approach to multi-objective flexible Job-shop scheduling problems," Fundamental Informatics, Vol 95, 2009, ppç 465–489.
[2] T. Eren and E. Güner, "A Literature Survey for Multicriteria Scheduling Problems on Single and Parallel Machines," Journal of The Faculty of Engineering and Architecture of Gazi University, Vol 17, No 4, 2002, pp. 37-69.
[3] J. Gao, L. Sun and M. Gen, "A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems," Computers & Operations Research, Vol. 35, 2008, pp. 2892 – 2907.
[4] T.C. Chiang and H.J. Lin, "A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling," International Journal of Production Economics, Vol. 03, 2012, pp. 1-12.
[5] J. Li, Q. Pan and S. Xie, "An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems," Applied Mathematics and Computation, Vol. 218, 2012, pp. 9353-9371.
[6] J. Li and Q. Pan, "Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity," Applied Soft Computing, Vol. 12, 2012, pp. 2896–2912.
[7] L. Wang, G. Zhou, Y. Xu and M. Liu, "An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling," International Journal Advanced Manufacturing Technology, Vol. 60, 2012, pp. 1111–1123.
[8] J.Q. Li, Q.K. Pan and K.Z. Gao, "Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems," International Journal Advanced Manufacturing Technology, Vol. 10, 2011 pp. 1-11.
[9] A. Bagheri, M. Zandieh, I. Mahdavi and M. Yazdani, "An artificial immune algorithm for the flexible job-shop scheduling problem," Future Generation Computer Systems, Vol. 26, 2010, pp. 533-541.
[10] J. Li, Q. Pan and Y.C. Liang, "An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems," Computers & Industrial Engineering, Vol. 59, 2010, pp. 647–662.
[11] M. Rajkumar, P. Asokan and V. Vamsikrishna, "A GRASP algorithm for flexible job-shop scheduling with maintenance constraints," International Journal of Production Research, Vol. 48, No 22, 2010, pp. 6821 – 6836.
[12] S. Wang and J. Yu, "An effective heuristic for flexible job-shop scheduling problem with maintenance activities," Computers & Industrial Engineering, Vol. 59, 2010, pp. 436–447.
[13] G. Zhang, X. Shao, P. Li and L. Gao, "An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem," Computers & Industrial Engineering, Vol. 56, 2009, pp. 1309–1318.
[14] L.N. Xing, Y.W. Chen and K.W. Yang, "Double layer ACO algorithm for the multi-objective FJSSP," New Generation Computing, Vol. 26, 2008, pp. 313-327.
[15] N.B. Ho and J.C. Tay, "Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search," IEEE Transactıons On Systems, Man, And Cybernetics—Part C: Applications And Reviews, Vol. 38, No 5, 2008, pp. 1094-6977.
[16] Z. Jia, H. Chen and J. Tang, "An Improved Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problem," IEEE International Conference on Grey Systems and Intelligent Services, Nanjing, China, 18-20 November 2007, pp. 1587-1592.
[17] W. Xia and Z. Wu, "An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems," Computers & Industrial Engineering, Vol. 48, 2005, pp. 409–425.
[18] M. Amiri, M. Zandieh, M. Yazdani and A. Bagheri, "A variable neighbourhood search algorithm for the flexible job-shop scheduling problem," International Journal of Production Research, Vol. 48, 2010, pp. 5671-5689.
[19] V. Kaplanoğlu, “An object-oriented approach for multi-objective flexible job-shop scheduling problem,” Expert Systems With Applications, Vol. 45, 2016, pp. 71–84.
[20] H. Tamaki, T. Ono, H. Murao and S. Kitamura, "Modeling and genetic solution of a class of flexible job shop scheduling problems," IEEE International Conference, Vol. 01, 2001, pp. 7241-7248.
[21] G. Vilcot and J.C. Billaut, "A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem," European Journal of Operational Research, Vol. 190, 2008, pp. 398–411.
[22] P. Fattahi and A. Fallahi, "Dynamic Scheduling in Flexible Job Shop Systems by Considering Simultaneously Efficiency and Stability," CIRP Journal of Manufacturing Science and Technology, Vol. 2, 2010, pp. 114–123.
[23] M. Gholami and M. Zandieh, "Integrating simulation and genetic algorithm to schedule a dynamic flexible jobs shop”, Journal of Intelligent Manufacturing, Vol. 20, 2009, pp. 481–498.
[24] M.B.S. Sreekara Reddy, Ch. Ratnam, G. Rajyalakshmi, V.K. Manupati, “An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem,” Measurement, vol. 114, 2018, pp. 78–90.
[25] I. Kacem, S. Hammadi and P. Borne, "Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem, IEEE, Vol. 01, 2001, pp. 2599-2604.
[26] I. Kacem, S. Hammadi and P. Borne, "Approach by Localization and Multiobjective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems," IEEE transactions on Systems,Man, and Cybernetics—Part c: Applications and Reviews, Vol. 32, No 1, 2002, pp. 1-13.
[27] I. Kacem, S. Hammadi and P. Borne, "Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic," Mathematics and Computers in Simulation, Vol. 60, 2002, pp. 245–276.
[28] S. Kaya and N. Fığlalı, "Çok Amaçlı Optimizasyon Problemlerinde Pareto Optimal Kullanımı," Social Sciences Research Journal, Vol. 5, 2016, pp. 9-18.
[29] L. Özbakır, "Çok Objektifli Esnek Atölye Çizelgeleme Problemlerinin Sezgisel Yöntemlerle Modellenmesi, Analizi ve Çözümü," Doktora Tezi, Erciyes Üniversitesi, Sosyal Bilimler Enstitüsü, 2004.
[30] J. Kennedy, R.C. Eberhart and Y. Shi, "Swarm intelligence", CA:Morgan Kaufmann Publishers, San Francisco, 2001.
[31] A. Aydın, "Metasezgisel Yöntemlerle Uçak Çizelgeleme Problemi Optimizasyonu", Doktora Tezi, Marmara Üniversitesi, Sosyal Bilimler Enstitüsü, 2009.
[32] F. Pezzella, G. Morganti and G. Ciaschetti, "A genetic algorithm for the flexible job-shop scheduling problem," Computers & Operations Research, Vol. 35, 2008, pp. 3202-3212.
[33] P. Brandimarte, "Routing and scheduling in a flexible job-shop by tabu search," Annals of Operations Research, Vol. 41, 1993, pp. 157-183.
[34] N. Zribi, I. Kacem, A. El Kamel and P. Borne, "Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization," IEEE Transactions On Systems, Man, And Cybernetics—Part C: Applications And Reviews, Vol. 37, No 4, 2007, pp. 652-661.
[35] S. Kaya and N. Fığlalı, "Esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik bir inceleme," Sakarya Üniversitesi, Fen Bilimleri Enstitüsü Dergisi, Vol. 20, No 2, 2016, pp. 223-244.
[36] S. Kaya, "Çok Amaçlı Esnek Atölye Tipi Çizelgeleme Problemlerinin Geliştirilmiş Parçacık Sürü Optimizasyonu ile Çözümüne Yönelik Model Önerileri," Doktora Tezi, Kocaeli Üniversitesi, Fen Bilimleri Enstitüsü, 2014.