Assembly Line Balancing with Resource Dependent Task Times

Paced assembly lines are widely used in repetitive manufacturing applications. Most previous research on the design of paced lines has assumed that each task along the line can be performed by only one worker (or a fixed number of workers). In many cases, however, task duration times may be reduced by increasing the number of workers or changing the equipment assigned to work stations. Thus, the problem becomes one of assigning resource alternatives (e.g., workers and/or equipment) and tasks to work stations to minimize total cost for a desired production rate. For this problem, we present three procedures. The first formulates the problem as a shortest path problem and guarantees optimality. The second and third are heuristic adaptations of the shortest path procedure that are capable of solving large problems. The procedures are compared in terms of solution quality and computation time on a set of 128 randomly generated problems for which optimal solutions could be found. Our simulation results indicate that the choice of procedure depends on problem complexity and resource costs.

[1]  Michael J. Magazine,et al.  Assembly line balancing as generalized bin packing , 1982, Oper. Res. Lett..

[2]  Peter A. Pinto,et al.  Branch and bound and heuristic procedures for assembly line balancing with paralleling of stations , 1981 .

[3]  Hirokazu Osaki,et al.  A method for assembly line balancing with more than one worker in each station , 1983 .

[4]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[5]  Peter A. Pinto,et al.  A heuristic network procedure for the assembly line balancing problem , 1978 .

[6]  James H. Patterson,et al.  An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem , 1984 .

[7]  Edward P. C. Kao,et al.  On Dynamic Programming Methods for Assembly Line Balancing , 1982, Oper. Res..

[8]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[9]  Peter A. Pinto,et al.  Assembly Line Balancing with Processing Alternatives: An Application , 1983 .

[10]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  G. M. Buxey,et al.  Assembly Line Balancing with Multiple Stations , 1974 .

[13]  Ezey M. Dar-El,et al.  Solving Large Single-Model Assembly Line Balancing Problems—A Comparative Study , 1975 .

[14]  Julian M. Scher,et al.  Assembly Lines with Overlapping Work Stations , 1975 .

[15]  William V. Gehrlein,et al.  A comparative evaluation of heuristic line balancing techniques , 1986 .

[16]  Basheer M. Khumawala,et al.  A branch and bound algorithm for assembly line balancing with paralleling , 1975 .