OPTIMIZING LEAD TIMES WITH TABU SEARCH ALGORITHM IN PACKAGING INDUSTRY


Demirel E., Akman G.

13th International Istanbul Scientific Research Congress on Life, Engineering, and Applied Sciences, İstanbul, Türkiye, 29 - 30 Nisan 2023, cilt.1, ss.23-34

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 1
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.23-34
  • Kocaeli Üniversitesi Adresli: Evet

Özet

In a company engaged in order type production in the packaging sector, customer-specific work is carried out due to the structure of the sector. For this reason, there are many customers and product types. Working on an order basis makes it difficult to give deadlines. Not giving the correct deadlines causes accumulation in the machines or wasted time in the machines on some days, causing inefficient use of machines and workforce. The variability of setup times in transitions between different jobs also increases the importance of ordering the jobs correctly. Poor results may be encountered, such as loss of customers due to poor deadlines and failure to keep promises made to customers, or meeting downtime costs if customer-side downtime has occurred. Due to the complexity of the problems and the many constraints in work scheduling problems, mathematical methods have begun to be insufficient. Over time, different methods have been used in difficult and complex problems. Especially heuristic methods provide convenience in complex problems. Tabu Search algorithm is a heuristic algorithm based on neighborhood structure. It is frequently preferred in combinatorial problems in the literature. In this study, job scheduling was done by using tabu search algorithm in a packaging company that makes order-type production. With the taboo algorithm, the work order of the machines has been determined and the values that reduce the total production time are considered as a better solution. The manual work schedule of the planning team and the work schedule obtained using the tabu search algorithm were compared in terms of total production time.