AN INTEGER PROGRAMMING FORMULATION FOR THE LINE BALANCING PROBLEMS

Yıl 1991, Sayı: 9, 42 - 56, 18.09.1990

Osman Unutulmaz Cemal Özgüven

Öz

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)

Anahtar Kelimeler

LINE BALANCING PROBLEMS, AN INTEGER PROGRAMMING FORMULATION

Kaynakça

• 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. .
• 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.
• Patterson J.H. and Albrach J.J., “Assembly Line Balancing: 0-1 Programming With Fibonacci Search “Operations Research, 23(1975).