KaydedilenlerDerginizi ekleyin

Dergiler / Erciyes Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi / 1991 / Sayı: 9

AN INTEGER PROGRAMMING FORMULATION FOR THE LINE BALANCING PROBLEMS

Osman Unutulmaz
Cemal Özgüven
Sayfa
42–56
Yayın Tarihi
1990-09-18
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

İt manages to determine the line with minimum balance delay vvithout having to fix either of them.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:The 0-1 programming formulations developed so far to deal with the simple assembly line balancing problems fix either the cycle time or the number of stations along the line.
📊
Temel Bulgular & Veri:The integer programming formulation suggested in this paper allows simultaneous consideration of the cycle time and the number of stations.
💡
Sonuç & Katkı:İt manages to determine the line with minimum balance delay vvithout having to fix either of them.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:LINE BALANCING PROBLEMS · AN INTEGER PROGRAMMING FORMULATION · AN INTEGER PROGRAMMING FORMULATION

Özet

The 0-1 programming formulations developed so far to deal with the simple assembly line balancing problems fix either the cycle time or the number of stations along the line. The integer programming formulation suggested in this paper allows simultaneous consideration of the cycle time and the number of stations. İt manages to determine the line with minimum balance delay vvithout having to fix either of them.

Abstract

The 0-1 programming formulations developed so far to deal with the simple assembly line balancing problems fix either the cycle time or the number of stations along the line. The integer programming formulation suggested in this paper allows simultaneous consideration of the cycle time and the number of stations. İt manages to determine the line with minimum balance delay vvithout having to fix either of them. (PROGRAMMING-INTEGER, LİNE BALANCİNG, PRODUCTION SCHEDULING)

🔖

Bu Makaleye Atıf Yap

Unutulmaz, O., Özgüven, C. (1990). AN INTEGER PROGRAMMING FORMULATION FOR THE LINE BALANCING PROBLEMS. Erciyes Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, Sayı: 9, 42–56. https://ajindex.com/articles/119452

📄 Tam Metin PDF Okuyucu

📄

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

Kaynakça (4)

  1. Baybars, İlker, "A Survey of Exact Algorithms For Simple Assembly üne Balancing Problems" Management Science, Volüme 32, Number, 8, Pages 909-932, August 1986.
  2. Talbot, F.Brian and Patterson, James H., “An Integer Programming Algorithm With Netvvork Cuts For Solving The Assembly Line Balancing Problem" Management Science, volüme 30, Number 1, January 1984.
  3. Patterson J.H. and Albrach J.J., “Assembly Line Balancing: 0-1 Programming With Fibonacci Search “Operations Research, 23(1975).
  4. Baybars, İlker, "A Survey of Exact Algorithms For Simple Assembly üne Balancing Problems" Management Science, Volüme 32, Number, 8, Pages 909-932, August 1986.