SavedAdd your journal

Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2015 / Cilt: 30 - Sayı: 1

MIXED-MODEL ASSEMBLY LINE BALANCING WITH SMOOTHING APPROACH BASED ON TABU SEARCH ALGORITHM

YASAK ARAMA ALGORİTMASINA DAYALI PÜRÜZSÜZLEŞTİRME YAKLAŞIMI İÇEREN KARIŞIKMODELLİ MONTAJ HATTI DENGELEME

Erdal EMEL
Betül YAĞMAHAN
Pages
57–69
Publication Date
2022-10-18
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)

The proposed algorithm further reduces time discrepancies among stations due to differences in times for common operations of different models by using a smoothing approach which is based on the tabu search algorithm.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Mixed-model assembly lines are needed for the assembly of products with a variety of models at comparatively lower costs.
📊
Key Findings & Data:The design of such lines requires the work to be done at stations well balanced, satisfying the constraints such as time, space and location for optimal productivity and efficiency.
💡
Conclusion & Impact:The proposed algorithm further reduces time discrepancies among stations due to differences in times for common operations of different models by using a smoothing approach which is based on the tabu search algorithm.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Mixed-model assembly lines are needed for the assembly of products with a variety of models at comparatively lower costs. The design of such lines requires the work to be done at stations well balanced, satisfying the constraints such as time, space and location for optimal productivity and efficiency. This paper presents a heuristic algorithm for the mixed-model assembly line balancing problem to minimize the number of stations for a given cycle time. The proposed algorithm further reduces time discrepancies among stations due to differences in times for common operations of different models by using a smoothing approach which is based on the tabu search algorithm.

Özet

Karışık-modelli montaj hatları, çeşitli modellerde talep edilen ürünlerin daha ucuz olacak şekilde montajı için kullanılır. Bu tür hatlar tasarlandığında, montaj hattının zaman, yer, konum vb. kısıtlar altında daha verimli ve düzenli bir şekilde çalışabilmesi için, istasyonlardaki işlemlerin dengelenmesi gerekir. Bu makalede, karışıkmodelli montaj hattı dengeleme problemi için belli bir çevrim süresine karşılık istasyon sayısının minimizasyonunu amaçlayan bir sezgisel algoritma geliştirilmiştir. Ayrıca önerilen bir yasak arama algoritmasına dayalı pürüzsüzleştirme yaklaşımı ile istasyonlarda modellere ait ortak işlemlerdeki süre farklılıklarından kaynaklanan dengesizlikler giderilmeye çalışılmıştır.

🔖

Cite This Article

EMEL, E., YAĞMAHAN, B. (2022). MIXED-MODEL ASSEMBLY LINE BALANCING WITH SMOOTHING APPROACH BASED ON TABU SEARCH ALGORITHM. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 30 - Sayı: 1, 57–69. https://ajindex.com/articles/523661

📄 Full Text PDF Viewer

📄

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

References (15)

  1. Scholl, A. ve Becker, C., “State-of-the-art Exact and Heuristic Solution Procedures for Simple Assembly Line Balancing”, European Journal of Operations Research, Cilt 168, 666–693, 2006
  2. Becker, C. ve Scholl, A., “A Survey on Problems and Methods in Generalized Assembly Line Balancing”, European Journal of Operational Research, Cilt 168, 694–715, 2006
  3. Boysen, N., Fliedner, M. ve Scholl, A., “A Classification of Assembly Line Balancing Problems”, European Journal of Operational Research, Cilt 183, 674–693, 2007
  4. Kalender, F.Y., Yılmaz, M.M. ve Türkbey, O., “Montaj Hattı Dengeleme Problemine Bulanık Bir Yaklaşım”, Journal of The Faculty of Engineering and Architecture of Gazi University, Cilt 23, No 1, 129–138, 2008
  5. Thomopoulos, N.T., “Line Balancing-Sequencing for Mixed-Model Assembly”, Management Science, Cilt 14, No 2, B59–B75, 1967
  6. Thomopoulos, N.T., “Mixed Model Line Balancing with Smoothed Station Assignments”, Management Science, Cilt 16, No 9, 563–603, 1970
  7. Macaskill, J.L.C., “Production Line Balances for Mixed-model Lines”, Management Science, Cilt 19, No 4, 423–434, 1972
  8. Chakravarty, A.K. ve Shtub, A., “Balancing Mixed-model Lines with In-process Inventories”, Management Science, Cilt 31, No 9, 1161–1174, 1985
  9. Chakravarty, A.K. ve Shtub, A., “A Cost Minimization Procedure for Mixed-model Production Lines with Normally Distributed Task Times”, European Journal of Operational Research, Cilt 23, 25–36, 1986
  10. Gökçen, H. ve Erel, E., “Karışık Modelli Montaj Hattı Dengeleme Problemi için bir Sezgisel Yöntem”, Verimlilik Dergisi, Cilt 2, 131–140, 1995
  11. Askin, R.G. ve Zhou, M., “A Parallel Station Heuristic for the Mixed-model Production Line Balancing problem”, International Journal of Production Research, Cilt 35, No 11, 3095– 3105, 1997
  12. Gokcen, H. ve Erel, E., “A Goal Programming Approach to Mixed-Model Assembly Line Balancing Problem”, International Journal of Production Economics, Cilt 48, 177–185, 1997
  13. Gokcen, H. ve Erel, E., “Binary Integer Formulation for Mixed-Model Assembly Line Balancing Problem”, Computers and Industrial Engineering, Cilt 34, 451–461, 1998
  14. McMullen, P.R. ve Frazier, G.V., “A Heuristic for Solving Mixed-Model Line Balancing Problems with Stochastic Task Durations and Parallel Stations”, International Journal of Production Economics, Cilt 51, 177–190, 1997
  15. McMullen, P.R. ve Frazier, G.V., “Using Simulated Annealing to Solve a Multiobjective Assembly Line Balancing Probl