| Project/Area Number |
13650121
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
機械工作・生産工学
|
|---|
| Research Institution | Kobe University |
|---|
Principal Investigator |
FUJII Susumu Kobe University, Faculty of Engineering, Professor, 工学部, 教授 (00031112)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KUMAMOTO Etsuko Kobe University, Faculty of Engineering Research Associate, 工学部, 助手 (00221383)
KAIHARA Toshiya Kobe University, Graduate School of Science and Technology, Associate Professor, 大学院・自然科学研究科, 助教授 (70289114)
|
|---|
| Project Period (FY) |
2001 – 2002
|
| Project Status |
Completed (Fiscal Year 2002)
|
| Budget Amount *help |
¥3,100,000 (Direct Cost: ¥3,100,000)
Fiscal Year 2002: ¥1,200,000 (Direct Cost: ¥1,200,000)
Fiscal Year 2001: ¥1,900,000 (Direct Cost: ¥1,900,000)
|
|---|
| Keywords | 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 |
|---|
| Research Abstract |
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.
|
