论文标题
手推车优化用于加载印刷电路板组件
Trolley Optimisation for Loading Printed Circuit Board Components
论文作者
论文摘要
手推车是用于加载印刷电路板（PCB）组件的容器，手推车优化问题（TOP）是将PCB组件分配给手推车，用于在装配线中生产一组PCB的手推车。在本文中，我们介绍了Top Top，这是一个新型的操作研究应用程序。为了制定顶部，我们得出了垃圾箱堆积问题的新型扩展。我们利用问题结构将顶部分解为两个较小，相同和独立的问题。此外，我们开发了一个混合整数线性编程模型来解决顶部并证明顶部是NP完整问题。使用航空航天制造公司的案例研究来说明顶部成功地自动化了该公司的手动流程，并在建筑过程中大大降低了成本和灵活性。
A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an NP-complete problem. A case study of an aerospace manufacturing company is used to illustrate the TOP which successfully automated the manual process in the company and resulted in significant cost reductions and flexibility in the building process.
