• 한국시뮬레이션학회논문지
• /
• 제22권1호
• /
• pp.31-40
• /
• 2013

과학기술의 발전으로 대한민국 해군의 함정 등의 무기체계는 첨단화, 과학화 되면서, 무기체계를 도입 및 운영, 유지하는 비용도 크게 증가한 반면, 이를 위한 국방비는 한정되어 있다. 따라서, 최적화된 예산을 사용하면서 적절한 가용도를 유지하기 위해 함정 가동에 영향을 주는 수리부속에 대한 효율적이고 과학적인 관리가 필요하다. 이를 위해 본 연구에서는 복구성 수리부속의 재고수준에 따른 가용도를 산출하는 시물레이션 재고관리 모형을 제시하였다. 제시된 모델은 기존의 복구성 수리부속의 다단계 재고관리모형인 METRIC 모형을 바탕으로 계획정비, 재생율, 전환보급, 동류전용 등의 현실적인 개념을 순차적으로 반영한 5개의 모델로 구성되어 있다. 실험은 각 모델에 같은 재고수준량을 입력하여 가용도의 결과값을 산출하도록 진행하였으며, 추가적인 민감도 분석을 실시하였다. 실험결과 각 모델별 가용도의 차이가 있었으며, 따라서, 해군의 운영특성을 반영한 재고관리 모델의 개발이 필요함을 확인하였다.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.15-42
• /
• 1998

A joint problem of order delivery, setup reduction, and cost-sharing in a two-echelon inventory system in which a vendor supplies multiple products to a group of buyers is studied here. The basic premise is that buyers have independently implemented setup reduction programs to acquire benefits from small order sizes. Doing so, however, causes the buyers' individually optimal order cycles to be differ from that of the vendor. In conjunction with this, two models are considered. In the first model, a multi-buyers single product situation is considered in which the vendor implements a joint supply cycle policy. However, buyers, as the dominant party, insist after implementing the individually optimal setup reduction that the vendor accept their individually optimal order schedules. In the second model. a multi-products, single buyer situation is considered in which the buyer implements a joint order policy. Here, the vendor, as the dominant party, refuses to cooperate fully with the buyer's individually reduced joint order schedule, and designs his own individually optimal setup reduction mix for each product under a given budget constraint. This led to a study of an integrated Setup Reduction/Break-even Pricing Policy for each situation to eliminate mismatches in individually optimal cycle times.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.715-722
• /
• 2005

Disassembly scheduling is the problem of determining the quantity and timing of disassembling used products while satisfying the demand of their parts or components over a planning horizon. The case of single product type with assembly structure is considered for the objective of minimizing the sum of disassembly operation and inventory holding costs. In particular, the resource capacity constraint is explicitly considered. The problem is formulated as an integer programming model, and a two-stage heuristic with construction and improvement algorithms is suggested in this paper. To show the performance of the heuristic, computational experiments are done on a number of randomly generated problems, and the test results show that the algorithm can give near optimal solutions within a very short amount of computation time.

• 대한산업공학회지
• /
• 제26권1호
• /
• pp.17-26
• /
• 2000

This paper presents an integrated order scheduling method with the improved DRP concept for multi-echelon distribution system that has the constraint of limited production capacity of producers. The proposed method reflects the dynamic characteristics of inventory level changes in the regional and central distribution center. The simulation is done with two models : the traditional DRP method and the proposed method presented in this paper. From the results, the latter is more efficient than the former in cost, customer's service level as well as balanced production load on each producer.

• Industrial Engineering and Management Systems
• /
• 제6권2호
• /
• pp.106-118
• /
• 2007

This paper present a new optimization model to generate aggregate production planning by considering electric cost. The new Time Of Switching (TOS) electric type is introduced by switching over Time Of Day (TOD) and Time Of Use (TOU) electric types to minimize the electric cost. The fuzzy demand and Dynamic inventory tracking with multiple plant capacity are modeled to cover the uncertain demand of customer. The constraint for minimum hour limitation of plant running per one start up event is introduced to minimize plants idle time. Furthermore; the Optimal Weight Moving Average Factor for customer demand forecasting is introduced by monthly factors to reduce forecasting error. Application is illustrated for multiple cement mill plants. The mathematical model was formulated in spreadsheet format. Then the spreadsheet-solver technique was used as a tool to solve the model. A simulation running on part of the system in a test for six months shows the optimal solution could save 60% of the actual cost.

• 대한안전경영과학회지
• /
• 제8권5호
• /
• pp.139-150
• /
• 2006

The aim of this study is to establish an efficient distribution planning for a capacitated multi-stage supply chain. We assume that the demand information during planning horizon is given a deterministic form using a certain forecasting method. Under such a condition, we present a cost effective heuristic method for minimizing chain-wide supply chain inventory cost that is the sum of holding and backorder costs by using look-ahead technique. We cope with the capacity restriction constraints through look-ahead technique that considers not only the current demand information but also future demand information. To evaluate performance of the proposed heuristic method, we compared it with the extant research that utilizes echelon stock concept, under various supply chain settings.

• 한국시뮬레이션학회논문지
• /
• 제29권2호
• /
• pp.83-93
• /
• 2020

BMORE(Bivariate measure of risk and error) 도표는 본래 확률적 시뮬레이션에서의 이변량 성과 데이터와, 그와 관계된 표본 평균, 중앙값, 이상점, 특정 백분위 내의 결과 데이터의 범위 등과 같은 통계량들을 시각화하기 위해 설계되었으며, 정적인 정보들만 제공하는 것에 비해 사용자들이 시뮬레이션 결과 데이터에 담긴 가변성을 더욱 직관적으로 쉽게 이해할 수 있도록 돕는다. 본 연구에서는 BMORE 도표를 단순히 한 시스템의 가변성을 시각화하기 위한 것이 아닌, 특정 확률적 제약 아래 대상 시스템들의 실행 가능성을 타진하고, 통계적 배경 아래 여러 시스템들의 성과 비교를 행하며, 매개변수들의 민감도 분석을 실시하기 위한 의사결정 도구로써 활용할 수 있음을 보이고 이를 위한 여러 방안을 제안한다. 그 활용 예시를 보이고자 본 연구에서는 간단한 재고 관리 문제를 차용하였으나, 제시된 방안들 자체는 이변량 성과 척도를 가지는 시뮬레이션/실험 데이터를 근거로하여 여러 시스템들을 비교하는 문제라면 어디든 사용될 수 있음을 밝혀둔다.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.40-48
• /
• 2009

In this article, scheduling of a casting sequence is studied in a casting foundry which must deliver products according to the Just-in-time(JIT) production policy of a customer. When a foundry manufactures a variety of casts with an identical alloy simultaneously, it frequently faces the task of production scheduling. An optimal casting schedule should be emphasized in order to maximize the production rate and raw material efficiency under the constraints of limited resources; melting furnaces and operation time for a casting machine. To solve this practical problem-fulfilling the objectives of casting the assigned mixed orders for the highest raw material efficiency in a way specified by the customer's JIT schedule, we implement simple integer programming. A simulation to solve a real production problem in a typical casting plant proves that the proposed method provides a feasible solution with a high accuracy for a complex, multi-variable and multi-constraint optimization problem. Employing this simple methodology, a casting foundry having an automated casting machine can produce a mixed order of casts with a maximum furnace utilization within the due date, and provide them according to their customer's JIT inventory policy.

• 제어로봇시스템학회논문지
• /
• 제5권6호
• /
• pp.714-723
• /
• 1999

This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

• 융합정보논문지
• /
• 제11권8호
• /
• pp.8-13
• /
• 2021

스마트공장 제조 환경에서 조직성과를 평가하는 지표 중의 하나인 원가지표를 측정하기 위한 성과측정도구로서 초변동원가회계시스템을 제안하고자 함이 본 연구의 목적이다. 설문조사에 의한 경험적 연구를 수행하였으며 가설 검증을 위하여 60명의 전문가를 대상으로 조사하였다. 조사결과 초변동원가를 기반으로 제공하는 정보가 원가측정과 조직성과 효율성 및 효과를 평가하는데 도움이 된다는 결론을 도출하였으며 이러한 방법은 계획 및 통제 프로세스를 지원하는 유용성이 있다는 점이 확인되었다. 제조공정에서의 처리량을 최대화하고 재고수준을 최적화할 수 있는 제약이론에 의한 초변동원가계산을 이용하면 조직성과의 효율성과 효과에 영향을 미치는 병목현상에 대한 해결책을 찾을 수 있음을 제안한다.