| Article ID: | iaor1991905 |
| Country: | Netherlands |
| Volume: | 18 |
| Issue: | 1 |
| Start Page Number: | 55 |
| End Page Number: | 64 |
| Publication Date: | Oct 1989 |
| Journal: | Engineering Costs and Production Economics |
| Authors: | Betts J., Mahmound K.I. |
| Keywords: | assembly line balancing |
The assembly line balancing problem is a combinatorial problem requiring an assignment of tasks that maximizes labour utilization. This paper presents an approach which can be used to obtain a guaranteed optimum solution. It is a branch and bound algorithm, used in conjunction with the precedence matrix. An example is given to illustrate the approach, and computational effectiveness on a series of test problems taken from the literature is also reported.