• Korean Management Science Review
• /
• v.4
• /
• pp.76-83
• /
• 1987

The machine-part group formation(MPGF) problem arises frequently in FMS planning. By viewing the problem as one of finding good assignments, a powerful solution algorithm is presented. The new algorithm solves the threshold dilemma found in previous solution procedures employing similarity coefficients. It also compared favorably with other existing MPGF algorithms by finding minimum exceptional elements for the tested problems. Furthermore the new algorithm can solve dynamic and more realistic MPGF problems by considering production volumes or costs. Such diverse machine-part relationship values were not considered in previous MPGF studies, which included only 0,1 incidence values. An example problem is solved where production volumes are the elements of MPGF incidence matrix.

• Journal of Intelligence and Information Systems
• /
• v.4 no.1
• /
• pp.1-10
• /
• 1998

Process planning is a very complex task and requires the dynamic informatioon of shop foor and market situations. Process plan selection is one of the main problems in the process planning. In this paper, we propose a new process plan selection model considering operation flexibility for the computer aided process planing. The model is formulated as a 0-1 integer programming considering realistic shop factors such as production volume, machining time, machine capacity, transportation time and capacity of tractors such as production volume, machining time, machine capacity, transportation time capacity of transfer device. The objective of the model is to minimize the sum of the processing and transportation time for all parts. A genetic algorithm a, pp.oach is developed to solve the model. The efficiency of the proposed a, pp.oach is verified with numerical examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.4
• /
• pp.110-117
• /
• 2012

The demand for facility used in producing multi-products is changed dynamically for discrete and finite time periods. The excess or the shortage for facility is occurred according to difference of the facility capacity size and demand for facility through given time periods. The shortage facility is met through the outsourcing production. The excess facility cost is considered for the periods that the facility capacity is greater than the demand for the facility, and the outsourcing production cost is considered for the periods that the demand for facility is greater than the facility capacity. This paper addresses to determine the facility capacity size, outsourcing production products and amount that minimizes the sum of the facility capacity cost, the excess facility cost and the outsourcing production cost. The characteristics of the optimal solution are analyzed, and an algorithm applying them is developed. A numerical example is shown to explain the problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.221-231
• /
• 1996

Applying JIT(Just-In-Time) production system to strength competitiveness power and renovate managent has problems. This study is proposed to solve one of the problems, that mother company has different production system with subcontractor, in order to connect production system of mother company with subcontractor. In the view of the Pull System, production system of mother company, it is possible that the more smoothed production planning is established by developing the algorithm the smoothed production planning preserving the LOTproduction system and comparing the existing research. Also, in the view of subcontractor taking Push System, the possibility of keeping delivery and improving productivity is proved using simulation technique by changing Job shop to GT Cell production system because demand is fluctuating.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.133-141
• /
• 2001

Rapid development in computer and network technology these days has created in environment in which decisions for manufacturing companies can be made in a much broader perspective. Especially, better decisions on production and distribution planning(PDP) problems can be made laking advantage of real time information from all the parties concerned. However, since the PDP problem-a core part of the supply chain management- is known to be the so-called NP-hard problem, so heuristic methods are dominantly used to find out solutions in a reasonable time. As one of those heuristic techniques, many previous studios considered genetic a1gorithms. A standard genetic a1gorithm applies rules of reproduction, gene crossover, and mutation to the pseudo-organisms so the organisms can pass along beneficial and survival-enhancing trails to a new generation. When it comes to representing a chromosome on the problem, it is hard to guarantee an evolution of solutions through classic a1gorithm operations alone, for there exists a strong epitasis among genes. To resolve this problem, we propose a hybrid genetic a1gorithm based on Silver-Meal heuristic. Using IMS-TB(Intelligent Manufacturing System Test-bed) problem sets. the good performance of the proposed a1gorithm is demonstrated.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.506-512
• /
• 2006

In this paper, we propose a lot-sizing and scheduling problem that seeks to minimize the sum of production cost and inventory cost over a given planning horizon while considering idle state of a machine in a batch production system. For this problem, we develop an integer programming model. And, we develop an efficient 2-phase heuristic algorithm to find a high quality feasible solution within reasonable time bounds. In the first phase, we seek to minimize the production cost by assigning batches to machines. Then, in the second phase, we find a production sequence of batches that reduces the inventory cost, while considering adding or deleting idle states between batches. Computational results show that the developed heuristic algorithm finds excellent feasible solutions within reasonable time bounds. Also, we could significantly reduce the total cost consisting of production cost and inventory cost by using the developed heuristic algorithm at a real manufacturing system that produces zinc alloys.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.2
• /
• pp.141-151
• /
• 2013

Process planning can be defined as determining detailed methods by which parts can be manufactured from the initial to the finished stage. Process planning starts with determining the manufacturing process based on the geometric shape of the part and the machines and tools required for performing this process. Distributed process planning enables production planning to be performed easily by combining the extracted process and various manufacturing resources such as operations and tools. This study proposes an algorithm to determine the process for a feature-based model and to combine manufacturing resources for the process and implements a distributed process planning system.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.113-116
• /
• 1995

In this study, we formulate production costing problem with environmental and operational constraints into an optimization problem of LP form. In the process of formulation, auxiliary constraints on which reflect unit loading order are constructed to reduce the size of optimization problem by economic operation rules. As a solution of the optimization problem in LP form, we use Karmarkar's method which performs much faster than simplex method in solving large scale LP problem. The proposed production costing algorithm is applied to IEEE Reliability Test System, and performs production simulation under environmental and operational constraints. Test and computer results are given to show the accuracy and usefulness of the proposed algorithm in the field of power system planning.

• Journal of the Korea Safety Management & Science
• /
• v.22 no.4
• /
• pp.45-52
• /
• 2020

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Network(SCN). One of keys issues in the current SCN research area involves minimizing both production and distribution costs. This study deals with finding an optimal solution for minimizing the total cost of production and distribution problems in supply chain network. First, we presented an integrated mathematical model that satisfies the minimum cost in the supply chain. To solve the presented mathematical model, we used a genetic algorithm with an excellent searching ability for complicated solution space. To represent the given model effectively, the matrix based real-number coding schema is used. The difference rate of the objective function value for the termination condition is applied. Computational experimental results show that the real size problems we encountered can be solved within a reasonable time.

• Journal of Power System Engineering
• /
• v.3 no.4
• /
• pp.63-68
• /
• 1999

The determination of the optimal machining parameters in metal cutting, such as cutting speed, feed rate, and depth of cut, is an important aspect in an economic manufacturing process. The main objective in general is either to minimize the production cost or to maximize the production rate. Also there are constraints on all the machining operations which put restrictions on the choice of the machining parameters. In this paper as an objective function the production cost is considered with two constraints, surface finish and cutting power. Genetic Algorithm is applied to determine the optimum machining parameters, and the effectiveness of the applied algorithm is demonstrated by means of an example, turning operation.