SavedAdd your journal

Journals / Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi / 2004 / Cilt: 6 - Sayı: 2

A PETRI NET APPROACH FOR SOLVING SIMPLE ASSEMBLY LINE BALANCING PROBLEM

BASİT MONTAJ HATTI DENGELEME PROBLEMİ ÇÖZÜMÜ İÇİN BİR PETRİ AĞI YAKLAŞIMI

Özcan KILINÇCI
Pages
1–15
Publication Date
2004-05-01
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 algorithm gave best results for 12 of 13 cycle time

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Assembly line balancing problem is an assignment problem.
📊
Key Findings & Data:If number of work stations on the line is fixed, then cycle time should be reduced (SALBP-1).
💡
Conclusion & Impact:The algorithm gave best results for 12 of 13 cycle time
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Montaj hattı dengeleme problemi · Petri ağları · Montaj üretim

Abstract

Assembly line balancing problem is an assignment problem. Tasks are assigned to work stations on the line by providing the precedence relations between tasks. When the only one product is produced on the line and its tasks have deterministic times, the problem is called simple assembly line balancing problem (SALBP). If number of work stations on the line is fixed, then cycle time should be reduced (SALBP-1). Heuristics based on branch and bound procedures, tabu search metaheuristics, genetic approaches, and etc. have been developed to solve SALBP-1. In this article, Petri nets are represented as a new approach to solve this problem. Petri nets are mathematical and graphical tool to model, design, and analyze discrete event systems. Proposed algorithm based on Petri nets uses the especially reachability analysis to determine available tasks and select task into them. Algorithm is coded in MATLAB 6.0. Proposed algorithm is tested on Tonge’s 70-tasks problem, and then results are compared with existing seven methods’ results. The algorithm gave best results for 12 of 13 cycle time

Özet

Montaj hattı dengeleme problemi bir atama problemidir. İş elemanları, hat üzerindeki iş istasyonlarına birbirleri arasındaki öncelik ilişkileri sağlanarak atanırlar. Hat üzerinde sadece bir ürün işleniyorsa ve bu ürüne ait iş elemanlarının süreleri biliniyor ve sabit ise problem, basit montaj hattı dengeleme problemi olarak adlandırılır. Eğer hat üzerindeki iş istasyonu sayısı belli ise çevrim süresi azaltılmalıdır (BMHDP-1). BMHDP-1’i çözmek için Dal & Sınır algoritmaları, tabu araştırması, genetik algoritmalar vb. Araştırma tekniklerine dayalı sezgisel yöntemler geliştirilmektedir. Bu makalede, bu problemin çözümü için yeni bir yaklaşım olarak Petri ağları sunulmuştur. Petri ağları, kesikli olaylı sistemleri modelleyen, tasarlayan ve analiz eden bir tekniktir. Önerilen Petri ağlarına dayalı algoritma özellikle ulaşılabilirlik analizini kullanır. Algoritma MATLAB 6.0’da kodlanmıştır. Önerilen algoritmanın testi, Tonge’nin 70 iş elemanlı probleminde yapılmış, sonuçlar mevcut yedi yöntemin sonuçları ile karşılaştırılmıştır. Algoritma, 13 çevrim süresinin 12’sinde en iyi sonuçları vermiştir

🔖

Cite This Article

KILINÇCI, Ö. (2004). A PETRI NET APPROACH FOR SOLVING SIMPLE ASSEMBLY LINE BALANCING PROBLEM. Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi, Cilt: 6 - Sayı: 2, 1–15. https://ajindex.com/articles/659440

📄 Full Text PDF Viewer

📄

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

References (13)

  1. Adamou M., Zerhoni S.N., Bourjault A. (1998): “Hierarchical Modeling and Control of Flexible Assembly Systems Using Object-oriented Petri Nets”, International Journal of Computer Integrated Manufacturing. Vol. 11, No. 1, pp. 18-33.
  2. Bautista J., Suarez R., Mateo M., Companys R. (2000): “Local Search Heuristics for Assembly Lien Balancing Problem with Incompatibilities between Tasks”, Proceedings of the 2000 IEEE International Conference on Robotics & Automation, San Francisco, CA., pp. 2404-2409. Baybars I. (1986b): “A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem”, Management Science, Vol. 32, No. 8, pp. 909-932. Baybars I. (1986a): “An Efficient Heuristic Method for the Simple Assembly Line Balancing Problem”, International Journal of Production Research, Vol. 24, No. 1, pp. 149-166.
  3. Cao T., Sanderson A.C. (1994): “Task Decomposition and Analysis of Robotic Assembly Task Plans Using Petri Nets”, IEEE Transactions on Industrial Electronics, Vol. 41, No.6, pp. 620-629.
  4. Chiang W.C. (1998): “The Application of a Tabu search Metaheuristic to the Assembly Line Balancing Problem”, Annals of Operations Research, No. 77, pp. 209-227. D’Souza K.A., Khator S.K. (1997): “System Reconfiguration to Avoid Deadlocks in Automated Manufacturing Systems”, Computers Industrial Engineering, Vol. 32, No.2. pp 455-465.
  5. Desrochers A.A., Al-Jaar R.Y. (1995): “Applications of Petri Nets in Manufacturing Systems, Modeling, Control, and Performance Analysis”, IEEE Press,
  6. New York. Erel E., Sarin S.C. (1998): “A Survey of the Assembly Line Balancing Procedures”, Production Planning and Control, Vol. 9, No. 5, pp. 414-434.
  7. Frey G. (2000): “Assembly Line Sequencing based on Petri Net T-Invariants”, Control Engineering Practice, Vol. 8, pp. 63-69
  8. Hoffmann T.R. (1992): “EUREKA: A Hybrid System for Assembly Line Balancing”, Management Science, Vol. 38, pp. 39-47
  9. Jeng M.D. (1997): “Petri Nets for Modeling Automated Manufacturing Systems with Error Recovery”, IEEE Transaction on Robotics and Automation, Vol. 13, No. 5, pp. 752-760.
  10. Johnson R.V. (1988): “Optimally Balancing Large Assembly Lines with FABLE”, Management Science, Vol. 34, No. 2, pp. 240-253.
  11. Kılınçcı Ö. (2003): “Simple Assembly Line Balancing Problem: A Petri Net Approach”, Doktora Tezi, İzmir,
  12. Dokuz Eylül Üniversitesi,
  13. Fen Bilimleri Enstitüsü. Kim Y.K., Kim Y.J., Kim Y. (1996): “Genetic Algorithms for Assembly Line Balancing with various Objectives”, Computers and Industrial Engineering, Vol. 30, No