峰值功率约束下简单装配线平衡问题的节拍时间最小化
Cycle time minimization for the simple assembly line balancing problem under peak power constraints
浏览论文内容
中文总结 AI 辅助
本研究针对带峰值功率约束的2型简单装配线平衡问题（SALBP-2），提出SAT方法最小化工位固定的装配线节拍时间，实验显示其求解最优案例数多于Gurobi、CPLEX等商业求解器且速度更优。
中文摘要 AI 辅助
峰值功率限制会限制并行任务，可能增加装配线的节拍时间。据我们所知，本研究首次针对固定工作站数量、固定总瞬时功率限制的2型简单装配线平衡问题（SALBP-2）最小化节拍时间。精确可满足性（SAT）方法用于寻找可行调度、系统搜索更短节拍并尽可能证明最优性。基于标准SALBP库，72个案例通过两个可复现公式定义更宽松和更严格的功率限制，用Gurobi和CPLEX提供商业混合整数规划（MIP）与约束规划（CP）对比。相对于标准SALBP-2最优解，这两个限制使已知最佳节拍时间平均分别增加16.49%和61.02%。性能最佳的SAT配置对每个案例都找到可行解，比各商业求解器求解更多案例至最优，且当两者都证明最优时，在报告设置下几乎总是更快。
英文摘要
Peak power limits restrict concurrent tasks and may increase assembly-line cycle time. To the best of our knowledge, this study is the first to minimize cycle time for the simple assembly line balancing problem type 2 (SALBP-2) with a fixed number of workstations and a fixed limit on total instantaneous power. An exact satisfiability (SAT) method finds feasible schedules, searches systematically for shorter cycles, and proves optimality when possible. Two reproducible formulas define looser and tighter power limits for 72 cases based on the standard SALBP library, with Gurobi and CPLEX providing commercial MIP and CP comparisons. Relative to standard SALBP-2 optima, the two limits increase the best-known cycle time by 16.49% and 61.02% on average. The best-performing SAT configurations find a feasible solution for every case, solve more cases to optimality than each commercial solver, and when both prove optimality, are almost always faster under the reported settings.
