Abstract Many existing heuristic or algorithmic techniques that address the problem of balancing an assembly line build upon the classical approach to balancing, i.e. the solution procedure requires the “proper organization of work elements.” In some assembly operations, however, particularly an existing operation, a classical-based balancing system may be undesirable. If physical and economic constraints dictate the structure of a line or if excessive delivery delays, backlogs, and/or lost business can result from stopping a line to achieve the proper organization of work elements, then an “unbalanced” line may be a desirable alternative. This is particularly true if the efficiency of the unbalanced line can be improved, i.e. if lost time due to the imbalance condition can be avoided. The goal of this research was to show that a dynamic programming-heuristic procedure can be used to improve the efficiency of an unbalanced line. Specifically, the objective was to demonstrate that an “optimal” allocation of manpower can be made such that an existing flowrate can be achieved with reduced manpower requirements. Reduced in-process storage can also result from use of the technique.
[1]
James R. Jackson,et al.
A Computing Procedure for a Line Balancing Problem
,
1956
.
[2]
E. Koenigsberg.
Production Lines and Internal Storage—A Review
,
1959
.
[3]
Colin L. Moodie,et al.
OPTIMAL BUFFER STORAGE CAPACITY IN PRODUCTION
,
1968
.
[4]
F. Paul Wyman,et al.
AN APPLICATION OF SIMULATION TO THE COMPARISON OF ASSEMBLY LINE CONFIGURATIONS
,
1973
.
[5]
P. Burke.
The Output of a Queuing System
,
1956
.
[6]
Gordon C. Hunt,et al.
Sequential Arrays of Waiting Lines
,
1956
.
[7]
Fred M. Tonge,et al.
Summary of a Heuristic Line Balancing Procedure
,
1960
.