A survey of exact algorithms for the simple assembly line balancing
A survey of exact algorithms for the simple assembly line balancing
复制标题
DOI：
10.1287/mnsc.32.8.909
复制
发表时间：
1986-08
期刊：
影响因子：
--
通讯作者：
Ilker Baybars
中科院分区：
文献类型：
--
作者：
Ilker Baybars
在这篇调查论文中，我们讨论了简单装配线平衡问题 SALBP 的发展；随着时间的推移进行修改和概括；提出问题的替代 0-1 规划公式和一般整数规划公式；讨论与 SALBP 相关的其他众所周知的问题；描述和评论一些精确的即最优搜索方法；并总结所报告的计算经验。这里讨论的所有模型都是确定性的，即假设所有输入参数都已知并且讨论的所有算法都是精确的。该问题被称为“简单”，因为没有考虑“混合模型”、“子装配线”、“分区限制”等。由于文献丰富，我们在此排除 a 不精确的 SALPB 启发式/近似算法和 b 包括随机模型在内的通用装配线平衡问题的算法。
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.