A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
In this survey paper we discuss the development of the simple assembly line balancing problem (SALBP); modifications and generalizations over time; present alternate 0-1 programming formulations and a general integer programming formulation of the problem; discuss other well-known problems related to SALBP; describe and comment on a number of exact (i.e., optimum-seeking) methods; and present a summary of the reported computational experiences. All models discussed here are deterministic (i.e., all input parameters are assumed to be known with certainty) and all the algorithms discussed are exact. The problem is termed "simple" in the sense that no "mixed-models," "subassembly lines," "zoning restrictions," etc. are considered. Due to the richness of the literature, we exclude from discussion here (a) the inexact (i.e., heuristic/approximate) algorithms for SALPB and (b) the algorithms for the general assembly line balancing problem (including the stochastic models).
Year of publication: |
1986
|
---|---|
Authors: | \.Ilker Baybars |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 32.1986, 8, p. 909-932
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | production/scheduling: line balancing | networks/graphs: applications | programming: integer algorithms |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities
Johnson, Roger V., (1983)
-
A Comparative Evaluation of Heuristic Line Balancing Techniques
Talbot, F. Brian, (1986)
-
Assembly Line Balancing with Processing Alternatives: An Application
Pinto, Peter A., (1983)
- More ...