• Industrial Engineering and Management Systems
• /
• 제7권2호
• /
• pp.113-125
• /
• 2008

This paper presents a model for designing cellular manufacturing systems (CMS) by integrating system cost, machine reliability, and preventive maintenance (PM) planning. In a CMS, a part is processed using alternative process routes, each consisting of a sequence of visits to machines. Thus, a level of 'system reliability' is associated with the machines along the process route assigned to a part type. Assuming machine reliabilities to follow the Weibull distribution, the model assigns the machines to cells, and selects, for each part type, a process route which maximizes the overall system reliability and minimizes the total costs of manufacturing operations, machine underutilization, and inter-cell material handling. The model also incorporates a reliability based PM plan and an algorithm to implement the plan. The algorithm determines effective PM intervals for the CMS machines based on a group maintenance policy and thus minimizes the maintenance costs subject to acceptable machine reliability thresholds. The model is a large mixed integer linear program, and is solved using LINGO. The results point out that integrating PM in the CMS design improves the overall system reliability markedly, and reduces the total costs significantly.

• 산업경영시스템학회지
• /
• 제33권1호
• /
• pp.71-79
• /
• 2010

This paper addresses capacity expansion planning model of distribution center under usability of public distribution center. For discrete and finite time periods, demands for distribution center increase dynamically. The capacity expansion planning is to determine the capacity expansion size of private distribution center and usage size of public distribution center for each period through the time periods. The capacity expansion of private distribution center or lease usage of public distribution center must be done to satisfy demand increase for distribution center. The costs are capacity expansion cost and excess capacity holding cost of private distribution center, lease usage cost of public distribution center. Capacity expansion planning of minimizing the total costs is mathematically modelled. The properties of optimal solution are characterized and a dynamic programming algorithm is developed. A numerical example is shown to explain the problem.

• 한국건축시공학회지
• /
• 제13권5호
• /
• pp.506-512
• /
• 2013

Since the amendment of the law on the private sector investment in social infrastructure in January of 2005, the government has been actively promoting Build-Transfer-Lease (BTL) projects. Notably, most new educational facilities have been built as BTL projects. For these facilities, the unit cost per unit area has been applied to predict construction costs. However, since construction costs are mostly managed after the detailed design phase, the costs can be estimated incorrectly. For this reason, cost management is needed in the planning phase, with a sound approximate estimate to prevent the wasteful use of funds. To address this shortcoming, this study aims to develop a quantity prediction model for education facilities using regression analysis in the planning phase. The developed model is focused on the required quantities of reinforced concrete and bricks. In order to achieve the objective, the data of 44 educational facility projects collected from Gyeonggi-do was used in the regression model. This study can be utilized by major stakeholders to accurately predict construction costs by estimating the appropriate quantities of reinforced concrete and bricks in the planning design phase.

• 경영과학
• /
• 제29권3호
• /
• pp.121-134
• /
• 2012

In this study, we consider a component procurement planning problem where the procurement amounts of components are determined under assemble-to-order systems with demand uncertainty. In the problem, procurement amount of each component is decided before the demands of finished products are known and after the demands are identified the assembly amounts of the finished products are decided. In this study, the objective function of the problem is minimizing the total costs which are composed of purchase and inventory costs of the components and the backorder costs of the finished products. We assume that the uncertain demand information is given as multiple scenarios of the demands, and we propose procurement planning methods based on stochastic models which considering the multiple demand scenarios. To evaluate the performances of the proposed methods, computational experiments were carried out on the proposed methods as well as benchmarks including a method based on deterministic mathematical model and a heuristic. From the results of the computational tests, the superiorities of the proposed methods were shown.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.363-370
• /
• 2002

This paper presents a production planning algorithm for minimizing the costs of production and subcontracting in SCM (supply chain management) environment. In our SCM environment, the several local plants that aye dispersed geographically produce parts and products. In this environment, we have to decide the production volumes of both parts and products considering the BOM (bill-of-material) structure to meet the fixed order quantity or forecasted demand quantity. Each plant produces the specified parts of product with finite production capacity. There exist subcontracting decisions relevant to the production capacity of each plant except the core process plant, and when we use the subcontractor's capacities we should be charged for the fixed subcontracting fees. The objective of this study is to solve the production planning problem, which minimizes the total costs of production, inventory, setup, and subcontracting under constraints of production and subcontracting capacity. For this problem, an integrated production planning model based on the multi-level capacitated lot sizing problem was formulated, and efficient decomposition algorithm was proposed. The experimental investigation shows that the proposed heuristic generates quite good solutions at very low computational costs.

• 한국ITS학회 논문지
• /
• 제4권2호
• /
• pp.45-52
• /
• 2005

ITS에 대한 사업효과분석은 기존의 전통적인 계획모형을 통해서 산정하기 어려운 문제점을 안고 있다. 이는 전통적인 교통계획 모형이 교통정보와 ITS기술 도입에 따른 영향에 대해 민감하지 못할 뿐만 아니라, ITS기술의 비용, 편익 값에 대한 입력자료가 부재하기 때문이다. Sketch-planning 기법은 전통적인 4단계수요모형을 기반으로 ITS구축에 따른 여행자 패턴 변화를 추정하여 입력 자료로 활용한다. 구축할 ITS시스템의 대안을 수립하고 이때 기본 사례(Do Nothing Case)와 실행사례(Do Case)를 비교하여 이에 대한 비용 편익을 산출하는 과정으로 구성되어 있다. Sketch-planning기법은 입출력 인터페이스, 대안발생 모듈, 편익모듈, 비용모듈, 대안비교 모듈의 5개 모듈로 구성되어 있다. 본 논문에서는 대전광역시 첨단교통모델도시를 사례로 Sketch-planning기법을 이용하여 분석하였다.

• 한국경영과학회지
• /
• 제10권2호
• /
• pp.15-23
• /
• 1985

A multi-product multi=facility production planning model is in which known demands must be satisfied. The model considers concave production costs and piecewise concave inventory costs in the introduction of production capacity constraints. Backlogging of unsatisfied demand is permitted. The structure of optimal production schedules is characterized and then used to solve an illustrative numerical problem.

• 산업공학
• /
• 제18권1호
• /
• pp.63-72
• /
• 2005

In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.

• 한국경영과학회지
• /
• 제34권3호
• /
• pp.71-84
• /
• 2009

This paper considers a remanufacturing and purchasing planning problem, in which either used products(or wastes) are remanufactured or remanufactured products(or final products) are purchased to satisfy dynamic demands of remanufactured products over a discrete and finite time horizon. Also, as remanufactured products are purchased more than or equal to a special quantity Q, a discount price policy is applied. The problem assumes that the related cost(remanufacturing and inventory holding costs of used products, and the purchasing and inventory holding costs of remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to determine the optimal remanufacturing and purchasing policy that minimizes the total cost to satisfy dynamic demands of remanufactured products. This paper characterizes the properties of the optimal policy and then, based on these properties, presents a dynamic programming algorithm to find the optimal policy. Also, a network-based procedure is proposed for the case of a large quantity of low cost used products. A numerical example is then presented to demonstrate the procedure of the proposed algorithm.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권2호
• /
• pp.58-66
• /
• 2001

This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.