Dergiler / Textile and Apparel / 2022 / Cilt: 32 Sayı: 1

A Novel Approach for Optimum Planning of Bobbin Boilers in Textile Industry

Sayfa
24–36
Yayın Tarihi
2022-03-29
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

According to the manual sorting, 17% improvement has been achieved in terms of the number of boiler washes and 13% in terms of total tardiness.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:As in all sectors, fierce competition across the world deeply affects the textile industry.
📊
Temel Bulgular & Veri:Developed integer linear model and iterative greedy based heuristics were first tested with randomly generated test problems.
💡
Sonuç & Katkı:According to the manual sorting, 17% improvement has been achieved in terms of the number of boiler washes and 13% in terms of total tardiness.
🔬Tür:Modelleme & Sayısal Simülasyon
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Bobbin (package) yard dyeing · sequencing · integer linear programming

Abstract

As in all sectors, fierce competition across the world deeply affects the textile industry. With the addition of new players to the market day by day, the competition is getting more and more intense. In today's world, where the price is determined by the customer, not by the manufacturer, it is an inevitable necessity for companies to reduce their costs in order to survive by maintaining their profitability. This only depends on the efficient use of resources. In this article, a productivity study has been carried out for the bobbin (package) dyeing process, which is one of the important elements of the textile industry. In this study, which was carried out practically in Bursalı Tekstil LTD. ŞTİ, the problem of sequencing the batches waiting to be dyed in dye boilers is discussed. It is necessary to wash the boilers between batches of different colors that are dyed consecutively within certain constraints. In addition, the due dates of these yarn batches must be respected. With the solution methods presented, it is aimed to sequence the batches in a way that requires the least washing and minimizes the total tardiness. Developed integer linear model and iterative greedy based heuristics were first tested with randomly generated test problems. In addition, it has been tested with six months of actual data of the bobbin dyeing department of the relevant company. According to the manual sorting, 17% improvement has been achieved in terms of the number of boiler washes and 13% in terms of total tardiness.

🔖

Bu Makaleye Atıf Yap

DEMİR, Y., İNAN, K. (2022). A Novel Approach for Optimum Planning of Bobbin Boilers in Textile Industry. Textile and Apparel, Cilt: 32 Sayı: 1, 24–36. https://ajindex.com/articles/943439

📄 Tam Metin PDF Okuyucu

📄

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

Kaynakça (11)

  1. Abdallah, K. S., & Jang, J. (2019). Famıly Splıttıng Algorıthm For A Sıngle Machıne Total Tardıness Schedulıng Problem Wıth Job Famıly Setup Tımes. International Journal of Industrial Engineering, 26(4). A. Allahverdi, “The third comprehensive survey on scheduling problems with setup times/costs,” European Journal of Operational Research, vol. 246, no. 2, pp. 345–378, 2015.
  2. Allahverdi, A. and Soroush, H.M. (2008). The significance of reducing setup times/setup costs. European Journal of Operational Research, 187(3):978-984. Altıntaş M., 2010. Patron Yapısının Bobin Boyamaya Etkisinin Araştırılması. Pamukkale Üniversitesi Fen Bilimleri Enstitüsü Yüksek Lisans Tezi, Denizli. Crauwels, H. A. J., Potts, C. N., & Van Wassenhove, L. N. (1996). Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs. European Journal of Operational Research, 90(2), 200-213.
  3. Deliktas, D., Torkul, O., & Ustun, O. (2019). A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method. International Transactions in Operational Research, 26(6), 2410-2431.
  4. Ebrahimi, M., Ghomi, S. F., & Karimi, B. (2014). Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Applied Mathematical Modelling, 38(9-10), 2490-2504.
  5. Feng, J., Shiji, S., & Cheng, W. (2009). Dominance property based tabu search for single machine scheduling problems with family setups. Journal of Systems Engineering and Electronics, 20(6), 1233-1238.
  6. Gupta, J. N., & Chantaravarapan, S. (2008). Single machine group scheduling with family setups to minimize total tardiness. International Journal of Production Research, 46(6), 1707-1722.
  7. Hariri, A. M. A., & Potts, C. N. (1997). Single machine scheduling with batch set-up times to minimize maximum lateness. Annals of Operations Research, 70, 75-92.
  8. Jacobs, L. W., & Brusco, M. J. (1995). A local search heuristic for large set-covering problems. Naval Research Logistics Quarterly, 42(7), 1129–1140.
  9. Jin, F., Gupta, J. N., Song, S., & Wu, C. (2010). Single machine scheduling with sequence-dependent family setups to minimize maximum lateness. Journal of the Operational Research Society, 61(7), 1181-1189.
  10. Jin, F., Song, S., & Wu, C. (2009). A simulated annealing algorithm for single machine scheduling problems with family setups. Computers & Operations Research, 36(7), 2133-2138.
  11. Kacem, I. (2006, October). Lower b