An efficient heuristic for solving stochastic assembly line balancing problems

Abstract

This paper investigates the problem of assigning tasks to work stations in assembly lines when there exists variability in processing assembly tasks. For such a stochastic assembly line balancing problem, an efficient heuristic is developed based on the fact that there is a feasible cycle time at which the expected total cost (the sum of normal operating cost and incompletion cost) becomes a minimum. The heuristic provides an optimal task assignment with such a cycle time. The heuristic also searches for a proper work allowance at each work station for any given cycle time and variability, and suggests an appropriate task allocation.