Approximate Solutions for Assembly Process Formation Problem in Aggregative Production System
スポンサーリンク
概要
- 論文の詳細を見る
As a method to cope with multi-item small lot size production, assembling plants of small products are going to introduce the aggregative production system in which one machine or one worker assembles various products. When a process of this system is organized, a problem of simultaneous determination of the production sequence and parts layout is encountered to minimize the total sum of moving distances of parts in the process. This problem is called the assembly process formation problem, and discussed in this study. First, the problem is formulated as the non-linear 0-1 integer programming problem. Then we propose two algorithms of the problem. One is based on the max-min method which is the algorithm of the quadratic assignment problem. The other is based on the tabu search method. Finally, we verify the effectiveness of the proposed approximate algorithm through some computational experiments.
- 東海大学の論文
著者
-
HADA Takao
Department of Management Engineering
-
Hada Takao
Department Of Management Engineering School Of Engineering
-
KATOH Sadao
Associate Department of Management Engineering, School of Engineering
-
MORIYAMA Hiroumi
Department of Management Engineering, School of Engineering
-
Katoh Sadao
Associate Department Of Management Engineering School Of Engineering
-
Moriyama Hiroumi
Department Of Management Engineering
-
Moriyama Hiroumi
Department Of Management Engineering School Of Engineering
関連論文
- An Algorithm for the Parameters Determination of a Dynamic Priority Discipline in a Central Server Model
- Approximate Solutions for Assembly Process Formation Problem in Aggregative Production System
- A Planning Method of Optical Fiber Cable Routing Based on Integer Programming(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
- A Near-Optimal Solution for the Vehicle Routing Problem with Multiple Use of Vehicles(Production and Logistics)
- Approximate Algorithm For Group Technology Line Formation Problem(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
- A Branch and Bound Algorithm for Precedence Constrained Knapsack Problem
- An Approximate Algorithm for the Resource Constrained Grouping Problem Based on the Lagrangian Relaxation Method