• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.92-106
• /
• 2004

This is a case study which establishes effective ammo issue plan and determines ammo support capability by linking various situations about ammo issue with wargame simulation. Ammo function simulation model has been developed for this matter and it has been proven that the model has significant impact on type of round, parking space for magazine, number of workers and capacity of equipment, etc. during establishing ammo issue plan and determining ammo supply capability. Also, ammo support capability varies significantly depending on tactical damage and MOPP status, etc. ASP's tactical situation, such as magazine damage, MOPP status, type of issuing round, parking space for magazine, number of workers and capacity of equipment, can be reflected when preparing an effective wartime ammo working hour issuing plan for supplying ammo to units through studies results, so that the issuing plan can be realistic and actual.

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

PCB assembly is a complicated and difficult process to optimize due to the necessity of simultaneous consideration of rack assignment and board mounting sequencing. An efficient component mounting method is developed using component gathering phenomenon. It is found that same components are located closely each other by checking PCBs in field and interviewing PCB designers. A new method counting this phenomenon is developed and it is performed better with more number of total components and more number of gathered components cases. Simulation models are developed using Visual C++ for performance evaluation of the heuristic.

• 한국경영과학회지
• /
• 제18권3호
• /
• pp.35-49
• /
• 1993

The node coloring problem is a problem to color the nodes of a graph using the minimum number of colors possible so that any two adjacent nodes are colored differently. This problem, along with the edge coloring problem, has a variety of practical applications particularly in item loading, resource allocation, exam timetabling, and channel assignment. The node coloring problem is an NP-hard problem, and thus many researchers develop a number of heuristic algorithms. In this paper, we survey and classify those heuristics with the emphasis on how an algorithm orders the nodes and colors the nodes using a determined ordering.

• 한국경영과학회지
• /
• 제21권3호
• /
• pp.143-157
• /
• 1996

This paper addresses the effects of an imperfect production process on the optimal production quantity and quality inspection policies. The system is assumed to deteriorate during the production process. The result are either the production of a number of defective items or the breakdown of the production meachine. A simple rule has been suggested to determine whether multiple quality in spection is workth or not. Furthermore, when multiple inspection policy is adopted, the optimal in spection schedule is shown to be equally spaced throughout the production cycle. Exact solution and approximation of the optimal production quantity and approximation of the optimal number of inspection are provided. Finally , to better understand the model of this paper, comparisons between this model and classical EMQ model are provided.

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

The objective of this study is to develop the simulation model of transport vehicle to analyze the required number of transport vehicle and to design the traffic pattern at automated container terminal. To model the transport vehicle, we defined the vehicle model and the traffic model using the state transition model of transport vehicle. An application of a simulation to simulate an automated container terminal with perpendicular layout is developed and described. From the results of simulation experiment, we obtained the vehicle speed and the number of vehicle under given productivity of container cranes, and analyzed the saving effect by cycle time.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.89-92
• /
• 1996

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in B-ISDN. We consider a hierarchical two level network architecture for VOD service. The first level consists of connected Local Video Servers(LVSs) in which a limited number of high vision programs are stored. The second level has one Central Video Server(CVS) containing all the programs served in the network. The purpose of this paper is to analyze the network traffic and to propose the storage policy for LVSs. For this purpose, we present an analysis of program storage amount in each LVS, transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

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

This paper considers a hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. The hybrid flow shop consists of two stages in series, each of which has multiple identical parallel machines, and the problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also derived to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• 한국국방경영분석학회지
• /
• 제24권1호
• /
• pp.176-188
• /
• 1998

In this paper, it is identified that the optimal level of each performance measures (service and inventory level) is not sensitive to an uncertain environment under JIT Kanban system designed by Moeeni. Moreover, it is proposed that the optimal design method considering multiple performance characteristics is the optimal level decision method according to the relative importance differences of each performance when there exist multiple performance characteristics. The result from the simulation analysis shows that the number of Kanban for stage 3 (final process) and stage 2 is increased at the service level. It is found that the expected loss is minimal when the cycle time decreases and the container size increases. However, the stage 1 is not affected by the number and cycle time of Kanban. It is thus important to consider carefully the cycle time and the container size of the Kanban to satisfy the demand in right time. In case of inventory level, the working inventory level decreases when the container size is decreased and the working inventory level also decreases slightly when the cycle time of the Kankban is increased in stage 1 and 2.

• 한국국방경영분석학회지
• /
• 제22권2호
• /
• pp.182-199
• /
• 1996

Many vehicle routing methods have been suggested, which minimize the routing distances of vehicles to reduce the total transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to develop a vehicle distribution planning system using heuristic algorithms and simulation techniques for home electronics companies. The vehicle distribution planning system developed by this study involve so complicated and stochastic conditions such as one depot, multiple nodes(demand points), multiple vehicle types, multiple order items, and other many restrictions for operating vehicles. The proposed system is compared with the nearest neighbor method and the savings method in terms of total logistics cost and driving time. This heuristic algorithm and simulation based distribution planning system is efficient in computational complexity, and give improved solutions with respect to the cost as well as the time. This method constructs a route with a minimum number of vehicles for a given demand.

• 한국경영과학회지
• /
• 제31권4호
• /
• pp.105-123
• /
• 2006

Previous research on two-sided markets has, for the most part, concentrated on indirect network externalities between buyers alto sellers. This paper considers direct competition effect among sellers and among buyers as well as indirect network externalities. We develop an analytic model of C2C e-marketplaces and examine whether a monopolistic incumbent could successfully deter new entry into its market. We find that the effect of the number of sellers or buyers on the price of goods depends on whether sellers have decided to sell the goods using an auction or fixed pricing rule and on the characteristics of the goods. We argue that when the effect of the number of sellers on the price of goods is significantly larger than that of buyers, there is a high possibility of entry. In particular, we show that entry becomes more difficult to deter as fixed-price format is adopted more frequently or the proportion of collectables is relatively low.