Abstract

Research on single-model assembly line balancing has produced several good algorithms for solving large problems. All these algorithms, however, generate just one solution to the balancing problem. With these, line designers wishing to investigate alternative station combinations of work elements are forced to do so manually. This paper concerns an algorithm (MUST) which generates alternative solutions of equal quality for single-model assembly line balancing problems. The method is based on the Mansoor-Yadin algorithm and in its optimum seeking form, MUST generates all existing optimal balances in a single pass. Three heuristics, used singularly or together, are introduced for solving the larger balancing problems. These are designed to produce about 100 different balance solutions of equal quality at each pass. MUST has been successfully used in balancing assembly lines having up to 140 work elements with widely differing precedence structures. A comparison of this method with MALB, one of the most efficient known heuristic methods, results in MUST dominating or equalling MALB in every case. Reasonable computation times (average 125.4 sec.—IBM 370/168) and core usage are achieved through the use of advanced computation methods. The need to explore alternative station combinations may arise in several ways—for example, the line designer may prefer (but not require) that certain work elements be allocated to a common station either because of: access to materials handling and storage facilities, service availability (e.g., compressed air lines), use of common tools or operator skills, etc. Alternatively, minor adjustments to the line may be required between adjacent stations in order to alleviate conditions at one station which exhibits excessive variability in its performance times. The generation of multiple solutions of equal efficiency adds a new dimension to the quality of balancing effectiveness, enabling the line designer to select the alternative that best suits his requirements.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call