A new bidirectional heuristic for the assembly line balancing problem

Authors:
Din-Horng Yeh;Hsiu-Hsueh Kao
Affiliations:
Department of Business Administration, National Chung Cheng University, Min-Hsiung, Chia-Yi, Taiwan;Department of Finance, Yuanpei University, 306, Yuanpei St., Hsin-Chu, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 1
Cited 2

A dynamic programming approach to stochastic assembly line balancing

Management Science

A solution procedure for type E simple assembly line balancing problem

Computers and Industrial Engineering
A heuristic approach for U-shaped assembly line balancing to improve labor productivity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Assembly line balancing problem (ALBP) is one of the well-known NP-hard layout planning problems for mass production systems. Many exact solution approaches have been developed, including 0-1 integer programming model, branch and bound algorithm, dynamic programming model, etc.; however, all optimal approaches are computationally inefficient in solving large-scale problems, which makes heuristic approaches a necessity in practice. In this paper we propose a new efficient heuristic, based on a recent bidirectional approach and the famous critical path method (CPM) widely used in project management, to resolve the issue of task assignment for ALBP. An example is given for illustration, and numerical results of sample problems selected from the literature are also given to show the effectiveness of the proposed heuristic.