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

R'||'&'||'D project management is a process of decisions concerned with the achievement of goals of objectives. Especially, defense R'||'&'||'D project planning is the key in the successfull management of defense development. The defense project managers are constantly having to perform "what if\ulcorner" exercise, such as what if the project is extended out for an additional cost\ulcorner In this reserch, we developed a schedule-cost analysis model based upon Critical Path Method(CPM) and Venture Evaluation and Review Technique(VERT) for schedule-cost trade off analysis defense R'||'&'||'D projects. In the first step, a deterministic model is developed as a heuristic which deterministic model is developed as a heuristic which determines the schedule extension and reduction cost as a function desired schedule. In the second step, a stochastic network simulation model is developed to analyse the project risk (sucess and failure). The expected time and cost can be determined for desired schedule under the assumptions of stochastic arc data (time and cost) with a various precedence relationships. This model provides the defense R'||'&'||'D managers with an estimated and expected cost for curtailing or extending a project a given amount of time. The effectiveness and efficiency of the proposed methods, a heuristic and stochastic networks simulations, have been demonstrated through examples.

• Structural Engineering and Mechanics
• /
• v.43 no.1
• /
• pp.31-51
• /
• 2012

This paper presents a computational study that explores the design of rigid steel frames by considering construction related costs. More specifically, two different aspects are investigated in this study focusing on the effects of (a) reducing the number of labor intensive rigid connections within a frame of given geometric layout, and (b) reducing the number of different member section types used in the frame. A genetic algorithm based optimization framework searches design space for these objectives. Unlike some studies that express connection cost as a factor of the entire frame weight, here connections and their associated cost factors are explicitly represented at the member level to evaluate the cost of connections associated with each beam. In addition, because variety in member section types can drive up construction related costs, its effects are evaluated implicitly by generating curves that show the trade off between cost and different numbers of section types used within the frame. Our results show that designs in which all connections are considered to be rigid can be excessively conservative: rigid connections can often be eliminated without any appreciable increase in frame weight, resulting in a reduction in overall cost. Eliminating additional rigid connections leads to further reductions in cost, even as frame weight increases, up to a certain point. These complex relationships between overall cost, rigid connections, and member section types are presented for a representative five-story steel frame.

• Journal of Families and Better Life
• /
• v.24 no.6 s.84
• /
• pp.17-31
• /
• 2006

The purpose of this study was to develop the model of consumer satisfaction with educational services in higher education on the basis of expectation-disconfirmatiom theory. The major findings were as follows : 1. The level of consumer satisfaction with educational services in higher education was low. Among the four dimensions of the educational services in higher education, the level of consumer satisfaction was the highest with 'education' and lowest with cost. 2. In the model of national university, the perceived performance of the core service, the disconfirmation of the core service, the perceived performance of the additional service, the disconfirmation of the additional service had a casual effect. The perceived performance of the additional service had the greatest casual effect among them. 3. In the model of private university, the perceived performance of the core service, the disconfirmation of the core service, the perceived performance of the additional service, the disconfirmation of the additional service had a casual effect. The perceived performance of the core service had the greatest casual effect among them.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.321-327
• /
• 2004

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of toro-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZC-BFS, which needs no additional memory when running SPIHT algorithm. It explicitly performs a breadth first search of the spatial-tree using peano-code and eliminates additional memory as it uses pre-status significant test for encoding and LSB bits of some coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in fast and simple hardware implementation and reduces the cost of production because no lists and additional memory are required.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.25-42
• /
• 2013

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time. Unless each milestone is completed on time, some penalty cost may be imposed. However, the penalty costs can be avoided by compressing the processing times of some jobs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time. We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.15-22
• /
• 2004

Some recent advances in stability and optimality for the nonlinear receding horizon control (NRHC) or the nonlinear model predictive control (NMPC) are assessed. The NRHCs with terminal conditions are surveyed in terms of a terminal state equality constraint, a terminal cost, and a terminal constraint set. Other NRHCs without terminal conditions are surveyed in terms of a control Lyapunov function (CLF) and cost monotonicity. Additional approaches such as output feedback, fuzzy, and neural network are introduced. This paper excludes the results for linear receding horizon controls and concentrates only on the analytical results of NRHCs, not including applications of NRHCs. Stability and optimality are focused on rather than robustness.

• Communications for Statistical Applications and Methods
• /
• v.15 no.1
• /
• pp.117-124
• /
• 2008

The liquidity risk is defined as an additional risk in the market due to the timing and size of a trade. A recent work by Cetin et ai. (2003) proposes a rigorous mathematical model incorporating this liquidity risk into the arbitrage pricing theory. A practical problem arising in a real market application is an estimation problem of a liquidity cost. In this paper, we propose to estimate the liquidity cost function in the context of Cetin et al. (2003) using the constrained least square (LS) method, and illustrate it by analyzing the Kellogg company data.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.25-30
• /
• 1999

This paper covers the development of a highly portable and low cost SPOT image data receiving system. We followed two design approaches. One is the software-based approach by which most of the real-time processing is handled by software. With the complete software-based design, it is simple to add a function for receiving any additional satellite data. Satellite-specific format handlers including error correction, decompression and decryption can easily be accommodated. On the other approach. we used a general hardware platform, IBM-PC and a low cost SCSI RAID (Redundant Away of Independent Disks), and therefore, we can make a low cost system.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.81-86
• /
• 2015

This paper suggests heuristic algorithm with linear time complexity to decide the normal and optimal point at minimum loss/maximum profit maximum shortest scheduling problem with additional loss cost and bonus profit cost. This algorithm computes only the earliest ending time for each node. Therefore, this algorithm can be get the critical path and project duration within O(n) time complexity and reduces the five steps of critical path method to one step. The proposed algorithm can be show the result more visually than linear programming and critical path method. For real experimental data, the proposed algorithm obtains the same solution as linear programming more quickly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.5 no.6
• /
• pp.69-78
• /
• 1982

Traditional CVP (Cost-Volume-Profit) analysis employs linear cost and revenue functions within some specified time period and range of operations. Therefore CVP analysis is assumption of constant labor productivity. The use of linear cost functions implicity assumes, among other things, that firm's labor force is either a homogenous group or a collection homogenous subgroups in a constant mix, and that total production changes in a linear fashion through appropriate increase or decrease of seemingly interchangeable labor unit. But productivity rates in many firms are known to change with additional manufacturing experience in employee skill. Learning curve is intended to subsume the effects of all these resources of productivity. This learning phenomenon is quantifiable in the form of a learning curve, or manufacturing progress function. The purpose d this study is to show how alternative assumptions regarding a firm's labor force may be utilize by integrating conventional CVP analysis with learning curve theory, Explicit consideration of the effect of learning should substantially enrich CVP analysis and improve its use as a tool for planning and control of industry.