A Study on Functions for Self-oiganized Layout and Autonomous Operation in Agile Manufacturing System

在这项研究中，我们研究一个具有加工中心(MC)的制造系统，它可以高效地生产各种不同体积的产品。提出了一种基于拍卖的MC正方形阵列布局方法，作为串并行布局的扩展。对于给定的生产计划，估计的给定MC数量位于正方形网格点上。每个MC拥有用于所有产品的所有流程的工具集。应用基于拍卖的方法来选择MC用于托盘更换站的下一次处理。通过应用用于拍卖的各种投标类型，可以观察到当应用适当的投标类型时在系统中产生工作流和/或形成生产特定产品的MC组。然后，我们开发了一个专门化算法，它通过删除利用率低的工具集来将MC限制在特殊产品的特殊工艺中，以及当MC利用率变得太低或PCS上的队列变得太长时，通过添加工具集来放松处理能力的泛化算法。通过这些算法，可以大大减少系统所需的工具集。为了扩展自组织布局的功能，我们首先考虑具有足够多MC的MC布局，然后考虑它们的利用率来减少MC和工具集。该算法成功地应用于实际生产中，得到了一种在给定产品组合的情况下，能够产生给定总产量的布局。工具集的专门化和泛化算法可以有效地适应产品组合的变化，但加入MC以应对生产量的增加的泛化算法还有待进一步研究。

In this study we investigate a manufacturing system with machining centers (MC) that can produce the variety of products with varying volume efficiently. A square arrayed layout of MCs is proposed with an auction based method for the operation as an extension of a serial-parallel layout. The given number of MCs, which is estimated for a given production plan are located on square grid points. Each MC holds toolsets for all processes of all products. An auction based method is applied to select an MC for the next processing of a pallet at the pallet changing station.By applying various bid types for the auction, it is observed that it is possible to generate a work flow in the system and/or to form a group of MCs producing a specific product when appropriate bid types are applied. We then developed a specialization algorithm which confines an MC to special processes of special products by deleting toolsets with low utilization and a generalization algorithm which relaxes the processing capability by adding toolsets when the utilization of an MC becomes too low or the queue at a PCS becomes too long. By these algorithms, the toolsets required for the system can be reduced considerably. To extend the function for the self organized layout, we consider an MC layout with sufficiently large number of MCs initially and then reduce MCs and toolsets considering their utilization. The proposed algorithm successfully applied yielding a layout which can produce the given total production volume with a given product mix. Algorithms for the specialization and generalization regarding to the toolsets are effectively applicable adapting the varying product mix, but a generalization algorithm adding MCs to cope with the increase of production volume is left to the further study.