SavedAdd your journal

Journals / Erciyes Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi / 2020 / Sayı: 1

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

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

Fatma Selen MADENOĞLU
Pages
436–450
Publication Date
2020-12-25
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)

Computational experiments are carried out to examine the change in the performance of heuristic approaches due to missing operations

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, hybrid flow type scheduling problem is discussed in order to minimize the total completion time in dynamic production environment.
📊
Key Findings & Data:More specifically, this study also handled transportation time, sequence dependent setup times, missing operations and new order arrivals.
💡
Conclusion & Impact:Computational experiments are carried out to examine the change in the performance of heuristic approaches due to missing operations
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Kombinatoryal Optimizasyon · Dinamik Çizelgeleme · Sezgiseller

Abstract

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

Özet

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

🔖

Cite This Article

MADENOĞLU, F. S. (2020). HEURISTIC APPROACHES FOR HYBRID FLOW TYPE SCHEDULING PROBLEM WITH MISSING OPERATIONS IN DYNAMIC ENVIRONMENT. Erciyes Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, Sayı: 1, 436–450. https://ajindex.com/articles/118805

📄 Full Text PDF Viewer

📄

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

References (13)

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. Gupta, J. N. (1988). Two-stage, hybrid flowshop scheduling problem. Journal of the operational Research Society, 39(4), 359-364.
  6. Kurz, M. E., & Askin, R. G. (2003). Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85(3): 371-388.
  7. 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.
  8. 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.
  9. Madenoğlu, F. S. (2020). Dinamik hibrit Akış Tipi Çizelgeleme Problemi İçin Sezgisel Algoritmalar. 19. Uluslararası İşletmecilik Kongresi Bildiriler Kitabı, 1216-1223.
  10. 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.
  11. 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.
  12. 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.
  13. Naderi, B., Ruiz, R., & Zandieh, M. (2010). Algorithms for a realistic variant of flowshop scheduling. Computers & Operations Research, 37(2): 236-24