Abstract
In this paper we develop an optimal and a heuristic algorithm for the problem of designing a flexible assembly line when several equipment alternatives are available. The design problem addresses the questions of selecting the equipment and assigning tasks to workstations, when precedence constraints exist among tasks. The objective is to minimize total equipment costs, given a pre-determined cycle time (derived from the required production rate). We develop an exact branch and bound algorithm which is capable of solving practical problems of moderate size. The algorithm's efficiency is enhanced due to the development of good lower bounds, as well as the use of some dominance rules to reduce the size of the branch and bound tree. We also suggest the use of a branch-and-bound-based heuristic procedure for large problems, and analyze the design and performance of this heuristic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baybars, I. (1986) A survey of exact algorithm for the simple assembly line balancing problem. Management Science, 32, 909-932.
Ghosh, S. and Gagnon, R.J. (1989) A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. International Journal of Production Research, 27, 637-670.
Scholl, A. (1999) Balancing and Sequencing of Assembly Lines, 2nd edition. Physica-Verlag, Heidelberg, New York.
Sarin, S.C. and Erel, E. (1990) Development of cost model for the single-model stochastic assembly line balancing problem. International Journal of Production Research, 28, 1305-1316.
Karp, R.M. (1972) Reducibility among combinatorial problems, in Complexity of Computer Computation, Miller, R.E. and Thatcher, J.W. (eds.), Plenum Press, New York, pp. 85-103.
Graves, S.C. and Holmes Redfield, C. (1988) Equipment selection and task assignment for multiproduct assembly system design. The International Journal of Flexible Manufacturing Systems, 1, 31-50.
Graves, S.C. and Whitney, D.E. (1979) A mathematical programming procedure for the equipment selection and system evaluation in programmable assembly, in Proceedings of the Eighteenth IEEE Conference on Decision and Control, Ft Lauderdale, FL. pp. 531-536.
Graves, S.C. and Lamar, B.W. (1983) An integer programming procedure for assembly design problems. Operations Research, 31(3), 522-545.
Pinto, P.A., Dannenbring, D.G. and Khumawala, B.M. (1983) Assembly line balancing with processing alternatives: an application. Management Science, 29, 817-830.
Rubinovitz, J. and Bukchin, J. (1993) RALB-a heuristic algorithm for design and balancing of robotic assembly lines. Annals of the CIRP, 42, 497-500.
Tsai, D.M. and Yao, M.J. (1993) A line-balanced-base capacity planning procedure for series-type robotic assembly line. International Journal of Production Research, 31, 1901-1920.
Johnson, J.R. (1988) Optimally balancing large assembly lines with FABLE. Management Science, 34, 240.
Mansoor, E.M. and Yadin, M. (1971) On the problem of assembly line balancing, in Developments in Operations Research, Avi-Itzhak, B. (ed), Gordon and Breach, New York, p. 361.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bukchin, J., Tzur, M. Design of flexible assembly line to minimize equipment cost. IIE Transactions 32, 585–598 (2000). https://doi.org/10.1023/A:1007646714909
Issue Date:
DOI: https://doi.org/10.1023/A:1007646714909