Öz
Bu çalışmada, tekstil ve konfeksiyon sektöründe hızla değişen sektörel talepleri karşılamak üzere operasyonların esneklik kısıtlarını dikkate alan bir hat dengeleme problemi sunulmuştur. Esneklik kısıtlı yalın üretim hat dengeleme problemi (FCLBP) olarak isimlendirilen bu problem, operasyonların esnekliklerini dikkate alır ve onları esneklik kısıtları çerçevesinde uygun operatörlere atar. Çalışmanın materyali, (1) de olduğu gibi, dikim bölümünde hat dengelemesi yapılacak ürünün operasyon bilgileridir. Çalışmanın metodu, tamsayılı matematiksel programlama ve meta-sezgisel algoritmadır. Bu tamsayılı model kullanılarak, verilen bir üretim miktarı aralığında operatör başına en küçük boş zaman elde edilebilecek, bunun yanında, genetik programlama tekniği kullanılarak farklı hat dengeleme durumlarıyla piyasa taleplerine cevap verilebilecektir. Son olarak, tekstil ve hazırgiyim sektörü için, bu algoritmayı temel alan, C# dilinde programlanmış bir yazılım geliştirilmiştir. Bu yazılım vasıtasıyla da, yüksek verimlilikteki hat dengeleme sonuçları elde edilebilecektir
Anahtar Kelimeler
Hat dengeleme yalın üretim tamsayılı programlama genetik algoritma yazılım
Kaynakça
- 1. Gürsoy, A., 2012, “An Integer Model and a Heuristic Algorithm for the Flexible Line Balancing Problem”, Tekstil ve Konfeksiyon, Vol. 22 (1), 58-63
- 2. Becker, C., Scholl, A., 2006, “A survey on problems and methods in generalized assembly line balancing”, European Journal of Operational Research, Vol. 168 (3), 694-715.
- 3. Güner, M., 2001, “Konfeksiyon İşletmelerinde Dikim Hattının Dengelenmesi”, Konfeksiyon ve Teknik, Temmuz.
- 4. Holweg, M., 2007, “The genealogy of lean production”, Journal of Operations Management, Vol. 25 (2), 420–437. 5. Kara Y., Ozcan U., Peker A., 2007, “Balancing and sequencing mixed-model just-in-time U-lines with multiple objectives”, Applied Mathematics and Computation, Vol. 184 (2), 566-588.
- 6. Keytack H., 1997, “Expert Line Balancing System (ELBS)”, Computers & Industrial Engineering, Vol. 33 (3/4), 303-306.
- 7. Bautista J., Pereira J., 2007, “Ant algorithms for a time and space constrained assembly line balancing problem”, European Journal of Operational Research, Vol. 17 (3), 2016-2032.
- 8. Nuriyev U., Guner M., Gursoy A., 2009, “A model for determination of optimal production quantity for minimum idle time: a case study in agarment industry”, Tekstil, Vol. 58 (5), 214-220.
- 9. Garey, M.R., Johnson, D.S, 1979, Computers and Intractability, W. H. Freeman and Company, San Francisco.
- 10. Gürsoy, A., 2012, “Performance-Based Line Balancing Problem: A New Model and A Greedy Algorithm”, Ege University Journal of the Faculty of Science, Vol. 36 (1-2), 44-53
- 11. Güner, M., Yücel, Ö., Ünal, C., 2013, “Applicability of Different Line Balancing Methods in the Production of Apparel”, Tekstil ve Konfeksiyon, Vol. 23 (1), 77- 84
- 12. Yücel, Ö., Güner, M., 2008, “Analyzing the factors affecting garment sewing times”, Tekstil ve Konfeksiyon, Vol. 18 (1), 41-48.
- 13. Martello, S., Toth, P., 1990, Knapsack Problems, Algorithms and Computer implementations, England, Chichester: John Wiley & Sons.
- 14. Gürsoy A., Nuriyev U.G., 2010, “A Mathematical Model For Assembly Line Balancing Problem With Lean Manufacturing”, Proceeding of the third International Conference Problems of Cybernetics and Informatics, PCI’2010, Vol. III, 156-159
- 15. Nuriyev, U.G., Güner, M., Berberler, M.E., Gürsoy, A., 2008, “Optimum Line Balancing of a Complex Production Process with Consecutive and Parallel Operations in Textile”, International Conference on Control and Optimization with Industrial Applications, p.142
Öz
In this study, a line balancing problem, which considers flexibility constraints of operations, has been presented to respond fast changing sectoral market demands in textile and apparel industry. This problem, called as the flexibility constrained line balancing problem (FCLBP) in lean manufacturing, takes into account operation flexibilities and assigns them to the available operators using the flexibility boundaries. The material of the study is the operation details that will be balanced the line in the sewing department as in (1). The method of the study is integer mathematical programming and meta-heuristic algorithm. Using the integer model, minimum idle time per operator in a given production range will be obtained and, furthermore, using the genetic algorithm, market demands will be responded in different balanced number. Lastly, using the algorithm, software has been programmed in C# to be used in the textile and apparel industry. Also, the high-efficiency balancing results will be obtained by means of the software
Anahtar Kelimeler
Line balancing lean manufacturing integer mathematical programming genetic algorithm software
Kaynakça
- 1. Gürsoy, A., 2012, “An Integer Model and a Heuristic Algorithm for the Flexible Line Balancing Problem”, Tekstil ve Konfeksiyon, Vol. 22 (1), 58-63
- 2. Becker, C., Scholl, A., 2006, “A survey on problems and methods in generalized assembly line balancing”, European Journal of Operational Research, Vol. 168 (3), 694-715.
- 3. Güner, M., 2001, “Konfeksiyon İşletmelerinde Dikim Hattının Dengelenmesi”, Konfeksiyon ve Teknik, Temmuz.
- 4. Holweg, M., 2007, “The genealogy of lean production”, Journal of Operations Management, Vol. 25 (2), 420–437. 5. Kara Y., Ozcan U., Peker A., 2007, “Balancing and sequencing mixed-model just-in-time U-lines with multiple objectives”, Applied Mathematics and Computation, Vol. 184 (2), 566-588.
- 6. Keytack H., 1997, “Expert Line Balancing System (ELBS)”, Computers & Industrial Engineering, Vol. 33 (3/4), 303-306.
- 7. Bautista J., Pereira J., 2007, “Ant algorithms for a time and space constrained assembly line balancing problem”, European Journal of Operational Research, Vol. 17 (3), 2016-2032.
- 8. Nuriyev U., Guner M., Gursoy A., 2009, “A model for determination of optimal production quantity for minimum idle time: a case study in agarment industry”, Tekstil, Vol. 58 (5), 214-220.
- 9. Garey, M.R., Johnson, D.S, 1979, Computers and Intractability, W. H. Freeman and Company, San Francisco.
- 10. Gürsoy, A., 2012, “Performance-Based Line Balancing Problem: A New Model and A Greedy Algorithm”, Ege University Journal of the Faculty of Science, Vol. 36 (1-2), 44-53
- 11. Güner, M., Yücel, Ö., Ünal, C., 2013, “Applicability of Different Line Balancing Methods in the Production of Apparel”, Tekstil ve Konfeksiyon, Vol. 23 (1), 77- 84
- 12. Yücel, Ö., Güner, M., 2008, “Analyzing the factors affecting garment sewing times”, Tekstil ve Konfeksiyon, Vol. 18 (1), 41-48.
- 13. Martello, S., Toth, P., 1990, Knapsack Problems, Algorithms and Computer implementations, England, Chichester: John Wiley & Sons.
- 14. Gürsoy A., Nuriyev U.G., 2010, “A Mathematical Model For Assembly Line Balancing Problem With Lean Manufacturing”, Proceeding of the third International Conference Problems of Cybernetics and Informatics, PCI’2010, Vol. III, 156-159
- 15. Nuriyev, U.G., Güner, M., Berberler, M.E., Gürsoy, A., 2008, “Optimum Line Balancing of a Complex Production Process with Consecutive and Parallel Operations in Textile”, International Conference on Control and Optimization with Industrial Applications, p.142
Ayrıntılar
| Diğer ID | JA89EE37TY |
|---|---|
| Bölüm | Makaleler |
| Yazarlar | |
| Yayımlanma Tarihi | 1 Aralık 2015 |
| Gönderilme Tarihi | 1 Aralık 2015 |
| Yayımlandığı Sayı | Yıl 2015 Cilt: 25 Sayı: 4 |