权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

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

敏捷制造系统自组织布局和自主运行功能研究

基本信息

批准号：
13650121
负责人：
FUJII Susumu
金额：
$ 1.98万
依托单位：
Kobe University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2001
资助国家：
日本
起止时间：
2001 至 2002
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-13650121/
关键词：
Agile manufacturing Production of a variety of products with varying volume Machine layout Self-organization Autonomous operation Serial-parallel machine layout Square arrayed layout Auction based algorithm

项目摘要

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.

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