Single Row Equidistant Facility Layout Problem SREFLP is with an NP-Hard nature to mimic material handling costs along with equally spaced straight-line facilities layout. Based on literature, it is obvious that efforts of researchers for solving SREFLP turn from exact methods into release the running time tracing the principle of the approximate methods in time race, regardless searching their time complexity release in conjunction with a provable quality of solutions. This study focuses on Lower bounding LB techniques as an independent potential solution tool for SREFLP. In particular, Best-known SREFLP LBs are reported from literature and significantly LBs optimum scenarios are highlighted. Initially, one gap of the SREFLP bidirectional LB is enhanced. From the integration between the enhanced LB and the best-known Gilmore-Lawler GL bounding, a new SREFLP optimum scenario is provided. Further improvements to GLB lead to guarantee an exact Shipping/Receiving Facility assignment and propose a conjecture of at most 4/3 approximation scheme for SREFLP.
翻译:根据文献,很明显,研究人员解决SREFLP双向定位LB的努力从精确的方法转变为释放时间追踪近似方法在时间竞赛中的原则,而不管在寻找时间复杂性释放和可辨的解决方案质量时,该研究的重点是将低约束LB技术作为SREFLP的一个独立的潜在解决方案工具。特别是,从文献中报告最著名的SREFLP LBLB, 并突出显著的LB最佳情景。最初,SREFLP双向定位LB的一个差距得到了加强。从增强的LB与最著名的Gilmore-Lawler GLL捆绑定之间的整合中,提供了一个新的SREFLP最佳情景。对GLB的进一步改进保证精确的航运/接收设施分配,并提出在最接近的4/3的SREFLP计划上进行预测。