Abstract
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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.