• 제목/요약/키워드: Planning Costs

검색결과 541건 처리시간 0.04초

Rolling Horizon 환경하에서 다단계 재고 모형의 분배계획 수립에 관한 연구 (Distribution Planning in a Multi-Echelon Inventory Model under Rolling Horizon Environment)

  • 안재성;권익현;김성식
    • 산업공학
    • /
    • 제16권4호
    • /
    • pp.441-449
    • /
    • 2003
  • In this paper we propose a distribution planning method aiming the use in the real-life situations. The assumed form of the distribution network is arborescence. At every node in the distribution network, orders are placed periodically. At each renewal of planning horizon, demand informations of periods in the horizon are updated. The objective of the problem is to minimize the total cost, which is the sum of holding and backorder costs of all sites during planning horizon. For such a situation, this study addressed an effective distribution plan when demands for demand-sites are provided for a given planning horizon.

A Fuzzy Multi-Objective Linear Programming Model: A Case Study of an LPG Distribution Network

  • Ozyoruk, Bahar;Donmez, Nilay
    • Industrial Engineering and Management Systems
    • /
    • 제13권3호
    • /
    • pp.319-329
    • /
    • 2014
  • Supply chain management is a subject that has an increasing importance due to the developments in the global markets and technology. In this paper, a fuzzy multi-objective linear programming model is developed for the supply chain of a company dealing with procurement, storage, filling, and distribution of liquefied petroleum gas (LPG) in Turkey. The model intends to determine the quantities of LPG to be procured, stored, filled to cylinders, and transported between the plants and demand centers for six planning periods. In this model, which aims to minimize both total costs (sum of procurement, storage, filling, and transportation costs) and total transportation distances, demand quantities of the main demand centers and decision maker's aspiration levels about objective functions are fuzzy. After comparing the results obtained from the model with those obtained by using different methods, it is concluded that the proposed method can be applied to real world problems practically and it may be used in this type of problems in order to generate an efficient solution.

해면 간척 사업과 기술의 정립 (Tideland Reclamation Projects and Establishment of Technology)

  • 정두희
    • 기술사
    • /
    • 제28권4호
    • /
    • pp.21-32
    • /
    • 1995
  • Tideland Reclamation Projects, which have played a significant role in selfsuffficieny of food in Korea, are being greatly restricted nowadays in their implementation due to their demands of big amount of construction costs and their severe malfunctioning of contaminat-ing the marine environment. Under the situation, this paper was prepared not only to stimulate the Government to continue the imlementation of new tideland reclamation projects, but also to contribute to the development of tideland reclamation technology by which the construction costs and rnalfunctionings could be minimized. Eventhough, the functioning of filters is considered to be important for the safety of seadikes, their planning and design are being made unreasonably In view point of construc-tion cost and strutural safety. Therefore, a reliable planning and design method for filters is presented in this paper on the basis of filter theory. In this way, we professional engineers corncerned should endeavor to develop more ad-vanced technology, by which the Government would implement the tideland reclamation projects continuously to supply the land and water more steadily in time.

  • PDF

설계평가를 위한 제조비용산정 시스템 (Cost Estimation System for Design Evalution)

  • 박홍석;이규봉
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2000년도 추계학술대회 논문집
    • /
    • pp.281-284
    • /
    • 2000
  • For estimation manufacturing cost during the early design stage, desingers have to know compositon of manufacturmg cost. Manufacturing cost is summalion of material cost and processmg cost. To be able to control the manufacturmg cost, it is necessary to estimate the costs adequately and to store the cost data in a generic way. a generic system, which is the basis for the control of the production costs, takes into account geometric information, material information, process information and production planning information Manufacturing cost is summation of material cost and processing cost.

  • PDF

기기 수명을 고려한 배전계통 커패시터의 설치 계획 (Optimal Capacitor Placement in a Distribution System Considering Lifetimes of Devices)

  • 박종영;박종근
    • 전기학회논문지
    • /
    • 제57권2호
    • /
    • pp.164-171
    • /
    • 2008
  • This paper proposes the planning method for placement of capacitors in a distribution system. The main objectives in the planning for capacitor allocation are the reduction of installation costs and electric power loss. In the proposed method, the life time of each device is considered in calculating installation costs, and the optimal operation status of devices is found by genetic algorithm. Then, the optimal numbers and locations are determined based on the optimal operation status. Simulation results in the 69-bus distribution system show that the proposed method performs better than conventional methods.

일반화된 2단계 재고체계에서의 최적주문정책 (The Optimal Ordering Policy for the Generalized Two-Stage Inventory System)

  • 정남기;차동원
    • 한국경영과학회지
    • /
    • 제4권1호
    • /
    • pp.25-31
    • /
    • 1979
  • We consider the optimal ordering policy for a single-product two-stage inventory system where the main assumptions are as follows: (i) constant continuous demand only at stage 2, (ii) constant input (production) rate at stage 1, (iii) instantaneous delivery (transportation) from stage 1 to stage 2, (iv) backlogging is allowed only at stage 2, (v) an infinite planning horizon. Costs considered are ordering and linear holding costs at both stages, and linear shortage cost only at stages 2. By solving 9 different case problems, we have observed the general from of the optimal ordering policies for our model which minimizes the total cost per unit time. It is noticeable from this observation that the questionable but more often than not adopted assumption by many authors in determining the optimal potimal policy for multistage inventory systems, that the ordering (lot) sizes at each stage remain constant thruout the planning horizon, is not valid.

  • PDF

다수의 도전장비 존재시 설비의 경제적 수명과 최적 대체결정을 위한 동적 계획모형 (Dynamic Programming Model for Optimal Replacement Policy with Multiple Challengers)

  • 김태현;김승권
    • 대한산업공학회지
    • /
    • 제25권4호
    • /
    • pp.466-475
    • /
    • 1999
  • A backward Dynamic Programming(DP) model for the optimal facility replacement decision problem during a finite planning horizon is presented. Multiple alternative challengers to a current defender are considered. All facilities are assumed to have finite service lives. The objective of the DP model is to maximize the profit over a finite planning horizon. As for the cost elements, purchasing cost, maintenance costs and repair costs as well as salvage value are considered. The time to failure is assumed to follow a weibull distribution and the maximum likelihood estimation of Weibull parameters is used to evaluate the expected cost of repair. To evaluate the revenue, the rate of operation during a specified period is employed. The cash flow component of each challenger can vary independently according to the time of occurrence and the item can be extended easily. The effects of inflation and the time value of money are considered. The algorithm is illustrated with a numerical example. A MATLAB implementation of the model is used to identify the optimal sequence and timing of the replacement.

  • PDF

상습관(商習慣)에 의한 재고금리(在庫金利)를 고려한 단일제조(單一製造)라인의 복수제품(複數製品) 생산계획(生産計劃) (A Single-Line Multi-Product Planning Problem Considering Inventory Interest Based on the Business Custom)

  • 박승헌
    • 대한산업공학회지
    • /
    • 제13권1호
    • /
    • pp.1-10
    • /
    • 1987
  • This paper deals with a single-facility multiproduct lot-size model requiring consideration of setup costs. Each product is demanded at the constant rate per unit time in the next particular period. Due to the limitation of the production capacity, some productions of total demand requirement in that period must be pre-produced. The aim of this project is to determine when and how much of each product to make in order to minimize the total setup costs and inventory carrying-costs of all products. Also this paper contains the further realistic treatment of inventory carrying-costs.

  • PDF

최적 조류 계산을 이용한 경제주체별 혼잡 및 손실비용 산정 (Congestion and Loss cost for economic subject using Optimal Power Flow)

  • 서철수;윤기갑;박상호;최영도;이재걸;손현일;김진오
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2011년도 제42회 하계학술대회
    • /
    • pp.430-431
    • /
    • 2011
  • Recently the power system consists of the more complicated structure, due to increase of power demands. In this circumstance, the congestion and loss capacity in transmission line is also increased. Accordingly, the investment planning of transmission system is required to reduce the congestion and loss of the transmission line. In study of the planning of domestic and international transmission expansion, the reliability of transmission planning and minimizing Investment cost is focused. However, the study has not been performed systematically in economic aspects. Typically, the congestion and loss costs have been individually calculated. It is not consider the mutual relationship between the congestion cost and the loss cost. This paper proposes a method to compute concurrently the congestion and loss costs. This purpose is to calculate the more exact value for economic assessment of the power system operation.

  • PDF

비선형공정계획에서 가공순서 결정을 위한 시뮬레이티드 어닐링 알고리듬 (Simulated Annealing Algorithms for Operation Sequencing in Nonlinear Process Planning)

  • 이동호
    • 대한산업공학회지
    • /
    • 제27권3호
    • /
    • pp.315-327
    • /
    • 2001
  • This paper considers the problem of operation sequencing in nonlinear process planning, which is the problem of selecting and sequencing operations required to produce a part with the objective of minimizing the sum of operation processing costs and machine, setup and tool change costs. Main constraints are the precedence relations among operations. The problem can be decomposed into two subproblems: operation selection and operation sequencing. We suggest four simulated annealing algorithms, which solve the two subproblems iteratively until a good solution is obtained. Here, the operation selection problem can be solved using a shortest path algorithm. Application of the algorithms is illustrated using an example. Also, to show the performances of the suggested algorithms, computational experiments were done on randomly generated test problems and the results are reported. In particular, one of the suggested algorithms outperforms an existing simulated annealing algorithm.

  • PDF