SavedAdd your journal

Journals / 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
Pages
42–56
Publication Date
1990-09-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)

İ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)

📌 3 Key Takeaways

🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:The integer programming formulation suggested in this paper allows simultaneous consideration of the cycle time and the number of stations.
💡
Conclusion & Impact:İ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)
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:LINE BALANCING PROBLEMS · AN INTEGER PROGRAMMING FORMULATION · AN INTEGER PROGRAMMING FORMULATION

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)

Ö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.

🔖

Cite This Article

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

📄 Full Text PDF Viewer

📄

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

References (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.