Journals / Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi / 2021 / Cilt: 27 - Sayı: 4

Assembly line balancing type-1 problem with assignment restrictions: A constraint programming modeling approach

Atama kısıtlı tip-1 montaj hattı dengeleme problemi: Bir kısıt programlama modeli yaklaşımı

Pages
532–541
Publication Date
2021-08-20
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)

Although assignment restrictions increase the complexity of the problem, numerical experiments demonstrate that CP is an effective and high-quality solution method in solving ALBP.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The assembly line balancing problem (ALBP) contains some constraints which are cycle time/number of stations and precedence relations between tasks.
📊
Key Findings & Data:The objective of the model is to minimize the number of stations for given cycle time (Type-1 problem).
💡
Conclusion & Impact:Although assignment restrictions increase the complexity of the problem, numerical experiments demonstrate that CP is an effective and high-quality solution method in solving ALBP.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Montaj hattı dengeleme · Tip-1 problemi · Atama kısıtları

Abstract

The assembly line balancing problem (ALBP) contains some constraints which are cycle time/number of stations and precedence relations between tasks. However, due to the technological and organizational limitations, several other restrictions, such as linked tasks, incompatible tasks, station, and resource constraints, can be encountered in real production systems. In this study, we evaluate the effect of these restrictions on ALBP. For this purpose, a Constraint Programming (CP) model is proposed. The objective of the model is to minimize the number of stations for given cycle time (Type-1 problem). We investigate the solution quality of the proposed CP model according to the mixed-integer programming (MIP) and ABSALOM in terms of the several performance measurements such as the number of proofing optimal solution, number of the optimal solution, number of the best solution, relative gap between the solution with the optimal solution and average total solution time. Furthermore, the proposed approach is tested on the literature test instances, and the comparison results between models are reported. Although assignment restrictions increase the complexity of the problem, numerical experiments demonstrate that CP is an effective and high-quality solution method in solving ALBP.

Özet

Montaj hattı dengeleme problemi (MHDP) çevrim zamanı/istasyon sayısı ve görevler arasındaki öncelik ilişkileri gibi bazı kısıtlar içerir. Ancak, teknolojik ve organizasyonel kısıtlamalardan dolayı, uyumlu görevler, uyumsuz görevler, istasyon ve kaynak kısıtları gibi bazı diğer kısıtlar ile gerçek hayat üretim sistemlerinde karşılaşılabilmektedir. Bu çalışmada, bu kısıtların MHDP üzerindeki etkileri araştırılacaktır. Bu amaçla, bir kısıt programlama (KP) modeli önerilmiştir. Modelin amacı verilen bir çevrim zamanı değeri için istasyon sayısının en küçüklenmesidir (Tip-1 problemi). Önerilen KP modelinin karışık tamsayılı programlama (KTP) ve ABSALOM yaklaşımına göre kesinleştirilmiş optimal çözüm sayısı, optimal çözüm sayısı, iyi çözüm sayısı, optimal çözüm ile ulaşılan çözüm arasındaki görece fark ve ortalama toplam çözüm zamanı gibi performans ölçütleri açısından çözüm kalitesi araştırılmıştır. Ayrıca, önerilen yaklaşım literatürde yer alan problem örnekleri ile test edilmiştir ve modeller arasındaki karşılaştırmalı sonuçlar rapor edilmiştir. Sayısal deneyler, atama kısıtlarının problemin karmaşıklığını artırmasına rağmen, KP'nin MHDP'nin çözümünde etkin ve kaliteli bir çözüm yöntemi olduğunu göstermiştir.

🔖

Cite This Article

PINARBAŞI, M., ALAKAŞ, H. M. (2021). Assembly line balancing type-1 problem with assignment restrictions: A constraint programming modeling approach. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, Cilt: 27 - Sayı: 4, 532–541. https://ajindex.com/articles/394922

📄 Full Text PDF Viewer

📄

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

References (15)

  1. Salveson ME. “The assembly line balancing problem”. Journal of Industrial Engineering, 6(1), 18-25, 1955
  2. Bowman EH. “Assembly-line balancing by linear programming”. Operations Research, 8(3), 385-389, 1960
  3. Küçükkoç İ. “A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, 24(1), 141-152, 2018
  4. Purnomo HD, Wee HM, Rau H. “Two-sided assembly lines balancing with assignment restrictions”. Mathematical and Computer Modelling, 57(1/2), 189-199, 2013
  5. Tuncel G, Topaloğlu S. “Assembly line balancing with positional constraints task assignment restrictions and station paralleling: A case in an electronics company”. Computers &Industrial Engineering, 64(2), 602-609, 2013
  6. Boysen N, Fliedner M. “A versatile algorithm for assembly line balancing”. European Journal of Operational Research, 184(1), 39-56, 2008
  7. Liu CM, Chen CH. “Multi-section electronic assembly line balancing problems: A case study”. Production Planning & Control, 13(5), 451-461, 2002
  8. Gadidov R, Wilhelm W. “A cutting plane approach for the single-product assembly system design problem”. International Journal of Production Research, 38(8), 1731-1754, 2000
  9. Lapierre SD, Ruiz A, Soriano P. “Balancing assembly lines with tabu search”. European Journal of Operational Research, 168(3), 826-837, 2006
  10. Pastor R, Corominas A. “Assembly line balancing with incompatibilities and bounded workstation loads”. Ricerca Operativa, 30(1), 23-45, 2000
  11. Agpak K, Gökçen H. “Assembly line balancing: two resource constrained cases”. International Journal of Production Economics, 96(1), 129-140, 2005
  12. Deckro RF. “Balancing cycle time and workstations”. IIE Transactions, 21(2), 106-111, 1989
  13. Corominas A, Ferrer L, Pastor R. “Assembly line balancing: general resource-constrained case”. International Journal of Production Research, 49(12), 3527-3542, 2011
  14. Sawik T. “Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line”. European Journal of Operational Research, 143(1), 115-124, 2002. Wilhelm WE, Gadidov R. “A branch-and-cut approach for a generic multiple-product assembly-system design problem”. INFORMS Journal on Computing, 16(1), 39-55, 2004
  15. Sikora CGS, Lopes TC, Magatã L. “Traveling worker assembly line (re)balancing problem: model reduction techniques and real case studies”. European Journ