• Journal of Korean Society for Quality Management
• /
• v.14 no.1
• /
• pp.61-66
• /
• 1986

Many papers have suggested various models how to decide an optimal time for replacing equipment. In this study, Dynamic Programming is applied to establish a model of replacing equipment and a new algorithm is developed for computerization to meet the increased number of variables. It is possible to predict the real situation with higher accuracy by employing the proposed model including more variables such as planning horizon, original cost, salvage value, decreasing rate, operating and maintenance costs, increasing rate, and so on.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.570-573
• /
• 1996

The evaluation test for the operation of rotary type surface mounters which consist of the reel axis, the index table and the X-Y table, has been performed by comparing the new method with the old one in only fields. Because the problem seeking for the optimal operation of rotary type surface mounters, is NP complete, it is almost impossible to get the optimal solutions of large problems. This paper deals with a dynamic network modeling, which can reduce the effort, the cost, and the time used for the performance test of rotary type surface mounters.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.1-11
• /
• 2001

This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.55-69
• /
• 1993

The tests in a battery can be performed in different sequences, and different sequential testing strategies will have exactly the same overall performances for that battery, but at different expected total costs and expected time consumptions. By using a multiobjective dynamic programming model, we are able to find all noninferior testing strategies for a given battery of tests and a stopping rule.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.54-64
• /
• 1985

This paper deals with analysis on complex and dynamic Primary Health Care (PHC) Systems in rural community to increase understanding of the nature of PHC feedback systems. Because Industrial Dynamics can be very useful for the analysis of such complex and dynamic systems. We used that as a basic tool of Modelling and simulation running. Even If PHC system-models require many assumptions, simulations based on these models can lead decision makers to a better way of problem solving.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.276-279
• /
• 1996

This paper deals with the method providing an exact solution to the 3-dimensional guillotine cutting stock problem. We suggest a 3-stage sutting method using the property that cubic material has to be cut into 2-dimensional planes firstly. This method requires more stocks that the general guillotine cutting methods but can save work force. By using the 1-dimensional dynamic programming, we reduce the computational time and the memory requirement in the 3-stage guillotine cutting method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.133-136
• /
• 2006

We consider dynamic lot-sizing model with production time windows where each of n demands has earliest due date and latest due date and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlog n) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest due dates.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.13-26
• /
• 1992

Set-up reduction is an important aspect of the Japanese Just-In-Time (JIT) and Zero Inventory (ZI) concepts. In this paper, we first analyze the effects of set-up cost reduction on tatal inventory, average lot size and forecast horizon in the dynamic lot size model. We also examine the various effects of set-up cost reduction in the EOQ model and explain why many Japanese firms try to cut set-up cost and/or set-up time greatly.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.2
• /
• pp.7-12
• /
• 1986

The problem of strategic R & D investment is formulate as a differential game model and solved explicity for a special case. It is shown that, at equilibrium, an increase in the intensity of market competition or a decrease in the role of technology transfer results in an increase in the initial rate of investment by competing tfirms. The increased initial investment rate may enhance the rate of technology development. This dynamic model can be used to propose non cooperative R & D investment policies in technologically competitive situation.

• 전기의세계
• /
• v.31 no.4
• /
• pp.281-287
• /
• 1982

PASCAL has a recursive nested structure and uses deep binding of identifiers. This paper studies the problems and techniques in storage management for PASCAL on the IBM 370 system, and presents run-time storage administration algorithms which use stack scheme and heap efficiently on the view of storage. The stack-scheme was used to implement the feature of recursive nested structure and the heap was used to implement the feature of the dynamic allocation procedure and pointer variable, allowing an additional dynamic storage recovery procedure.