HEURISTIC APPROACHES FOR HYBRID FLOW TYPE SCHEDULING PROBLEM WITH MISSING OPERATIONS IN DYNAMIC ENVIRONMENT

Yıl 2020, , 436 - 450, 25.12.2020

Fatma Selen Madenoğlu

https://doi.org/10.18070/erciyesiibd.846574

Öz

In this study, hybrid flow type scheduling problem is discussed in order to minimize the total completion time in dynamic production environment. More specifically, this study also handled transportation time, sequence dependent setup times, missing operations and new order arrivals. Heuristic approaches are proposed to solve the presented problem. Computational experiments are carried out to examine the change in the performance of heuristic approaches due to missing operations

Anahtar Kelimeler

Combinatorial Optimization, Dynamic Scheduling, Heuristics

DİNAMİK ORTAMDA EKSİK OPERASYONLAR HİBRİT AKIŞ TİPİ ÇİZELGELEME PROBLEMİ İÇİN SEZGİSEL YAKLAŞIMLAR

Öz

Bu çalışmada, dinamik üretim ortamında toplam tamamlanma zamanının en küçüklenmesi amacıyla hibrit akış tipi çizelgeleme problemi ele alınmıştır. Daha spesifik olarak, çalışmada taşıma zamanı, sıraya bağlı hazırlık süreleri, eksik operasyonların olması ve dinamik olarak yeni siparişlerin gelişi durumları da ele alınmıştır. Ele alınan problemin çözümüne sezgisel yaklaşımlar önerilmiştir. Deneysel çalışmalar, sezgisel yaklaşımların performanslarının eksik operasyon seviyesi değişimine bağlı olarak incelemek için gerçekleştirilmiştir

Anahtar Kelimeler

Kombinatoryal Optimizasyon, Dinamik Çizelgeleme, Sezgiseller

Kaynakça

• Allahverdi, A., Ng, C. T., Cheng, T. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European journal of operational research, 187(3), 985-1032.
• Baykasoğlu, A., & Karaslan, F. S. (2017). Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach. International Journal of Production Research, 55(11), 3308-3325.
• Dios, M., Fernandez-Viagas, V., & Framinan, J. M. (2018). Efficient heuristics for the hybrid flow shop scheduling problem with missing operations. Computers & Industrial Engineering, 115, 88-99.
• Gholami, M., Zandieh, M., & Alem-Tabriz, A. (2009). Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. The International Journal of Advanced Manufacturing Technology, 42(1-2), 189-201.
• Gupta, J. N. (1988). Two-stage, hybrid flowshop scheduling problem. Journal of the operational Research Society, 39(4), 359-364. Kurz, M. E., & Askin, R. G. (2003). Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85(3): 371-388.
• Leisten, R., & Kolbe, M. (1998). A note on scheduling jobs with missing operations in permutation flow shops. International journal of production research, 36(9): 2627-2630.
• Madenoğlu, F. S. (2019). Solving The Hybrid Flow Shop Scheduling Problem Using Heuristic Algorithms. Business & Management Studies: An International Journal, 7(3), 14-25.
• Madenoğlu, F. S. (2020). Dinamik hibrit Akış Tipi Çizelgeleme Problemi İçin Sezgisel Algoritmalar. 19. Uluslararası İşletmecilik Kongresi Bildiriler Kitabı, 1216-1223.
• Marichelvam, M., & Prabaharan, T. (2014). Performance evaluation of an improved hybrid genetic scatter search (IHGSS) algorithm for multistage hybrid flow shop scheduling problems with missing operations. International Journal of Industrial and Systems Engineering, 16(1): 120-141.
• Mirabi, M., Ghomi, S. F., & Jolai, F. (2013). A two-stage hybrid flowshop scheduling problem in machine breakdown condition. Journal of Intelligent Manufacturing, 24(1), 193-199.
• Naderi, B., Zandieh, M., Balagh, A. K. G., & Roshanaei, V. (2009). An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert systems with Applications, 36(6), 9625-9633.
• Naderi, B., Ruiz, R., & Zandieh, M. (2010). Algorithms for a realistic variant of flowshop scheduling. Computers & Operations Research, 37(2): 236-246.
• Qin, W., Zhang, J., & Song, D. (2018). An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. Journal of Intelligent Manufacturing, 29(4), 891-904.
• Peng, K., Pan, Q. K., Gao, L., Li, X., Das, S., & Zhang, B. (2019). A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling. Swarm and Evolutionary Computation, 45, 92-112.
• Pan, Q. K., Wang, L., Li, J. Q., & Duan, J. H. (2014). A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega, 45, 42-56.
• Pinedo ML (2008). Scheduling: theory, algorithms and systems, 3rd edn. Springer, New York.
• Ribas, I., Leisten, R., & Framiñan, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37(8), 1439-1454.
• Ruiz, R., Şerifoğlu, F. S., & Urlings, T. (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research, 35(4), 1151-1175.
• Ruiz, R., & Vázquez-Rodríguez, J. A. (2010). The hybrid flow shop scheduling problem. European journal of operational research, 205(1), 1-18.
• Saravanan, M., Sridhar, S., & Harikannan, N. (2014). Optimization of realistic multi-stage hybrid flow shop scheduling problems with missing operations using meta-heuristics, International Journal of Engineering and Technology, 6(1): 484-496.
• Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European journal of Operational research, 47(1), 65-74.
• Tang, L., Liu, W., & Liu, J. (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16(3), 361-370.
• Tseng, C. T., Liao, C. J., & Liao, T. X. (2008). A note on two-stage hybrid flowshop scheduling with missing operations, Computers & Industrial Engineering, 54(3), 695-704.
• Yao, F. S., Zhao, M., & Zhang, H. (2012). Two-stage hybrid flow shop scheduling with dynamic job arrivals. Computers & Operations Research, 39(7), 1701-1712.
• Zabihzadeh, S. S., & Rezaeian, J. (2016). Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time. Applied Soft Computing, 40, 319-330.