TY - GEN
T1 - Comparison of techniques for mixed model assembly line balancing problem
AU - Gümüssoy, Çigdem Altin
AU - Kabak, Özgür
PY - 2005
Y1 - 2005
N2 - In recent years, with the increasing competition and customer demand qualifications, companies search new ways to supply customer demands in a growing competition environment. Manufacturing systems as well as assembly lines are also being modified to achieve high productivity, low costs and higher flexibility. Mixed model assembly line balancing is one of the earliest approaches used for these purposes. There are various methods proposed for balancing mixed model assembly lines. However what about the applicability of the methods to real life problems. In this paper four methods (shortest route formulation, binary integer formulation, ranked positional weight technique and Bukchin et al.'s heuristic methodology) are applied to a real world case and the performances are compared. The results show that Bukchin et al.'s heuristic methodology gives the highest performance in terms of applicability and balancing performance, while in two of the methods even a solution could not be obtained.
AB - In recent years, with the increasing competition and customer demand qualifications, companies search new ways to supply customer demands in a growing competition environment. Manufacturing systems as well as assembly lines are also being modified to achieve high productivity, low costs and higher flexibility. Mixed model assembly line balancing is one of the earliest approaches used for these purposes. There are various methods proposed for balancing mixed model assembly lines. However what about the applicability of the methods to real life problems. In this paper four methods (shortest route formulation, binary integer formulation, ranked positional weight technique and Bukchin et al.'s heuristic methodology) are applied to a real world case and the performances are compared. The results show that Bukchin et al.'s heuristic methodology gives the highest performance in terms of applicability and balancing performance, while in two of the methods even a solution could not be obtained.
KW - Assembly line balancing
KW - Binary integer programming
KW - Ranked positional weight technique
KW - Shortest path
UR - http://www.scopus.com/inward/record.url?scp=53349140315&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:53349140315
SN - 9755612653
SN - 9789755612652
T3 - Proceedings of the 35th International Conference on Computers and Industrial Engineering, ICC and IE 2005
SP - 831
EP - 838
BT - Proceedings of the 35th International Conference on Computers and Industrial Engineering, ICC and IE 2005
T2 - 35th International Conference on Computers and Industrial Engineering, ICC and IE 2005
Y2 - 19 June 2005 through 22 June 2005
ER -