• Title/Summary/Keyword: allocation cost

Search Result 605, Processing Time 0.027 seconds

Integrated Model of Cost Management for Human Resources Development Institutes (직업능력개발기관의 원가관리를 위한 통합모형)

  • Ghang, Bong-Jun
    • The Journal of Korean Institute for Practical Engineering Education
    • /
    • v.2 no.1
    • /
    • pp.106-114
    • /
    • 2010
  • HRDI(Human Resources Development Institute) has not performed the efficient costing model because of it's variety types of institutes, courses and vocational education and training techniques. This study proposed the integrated costing model using job costing, activity based costing and standard costing methods to meet needs of HRDI. And the model will be used in two-phased approach including adoptable model and ideal model. The integrated model includes costing techniques, cost elements, indirect cost allocation bases and cost analysis methods using a contribution margin model to calculate and analyse cost information in HRDI. The proposed integrated costing model of HRDI has some limitation of no relationship with the performance management. But this model will prepare valuable information by using detailed data and costing techniques. And then this model will be developed as a advanced costing model using standard costing to relate with the performance model.

  • PDF

A Study on the Requirements Allocation and Tracking by Implementing Functional Analysis (기능분석을 이용한 항공기 설계요구의 할당 및 추적에 관한 연구)

  • 이재우
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.2 no.2
    • /
    • pp.52-60
    • /
    • 1999
  • By implementing the Systems Engineering process for the aircraft preliminary design, functional analysis study is performed, hence Functional Interface Data Flow(FIDF) and Functional Flow Block Diagram(FFBD) are generated. Based on FIDF and FFBD, allocable and non-allocable design/performance/RM&S requirements are allocated to the appropriate levels. Weight and cost tracking and design margin management methodologies are studied and implemented for the balanced aircraft design.

  • PDF

Optimal Tolerance Design within Limited Costs using Genetic Algorithm (유전 알고리즘을 이용한 한계비용내의 최적 공차 설계)

  • 장현수;이병기;김선호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.49
    • /
    • pp.33-41
    • /
    • 1999
  • The original tolerances, which are assigned by designers on the basis of handbooks and experience, cannot always be expected to be optimal or feasible, because they may yield an unacceptable manufacturing costs. So the systematic tolerance design considering manufacturing costs should be done. Therefore, this research analyzes the tolerance within the tolerance design using Monte-Carlo simulation method and sensitivity analysis and using genetic algorithm by tolerance allocation method. The genetic algorithm was developed for allocation of the optimal tolerance under the manufacturing limitation cost.

  • PDF

Transmit Power Allocation for Soft Frequency Reuse in Coordinated Cellular Systems (인접셀간 협력하는 셀룰라 시스템에서 소프트 주차수 재사용을 위한 송신전력할당 기법)

  • Kim, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4A
    • /
    • pp.316-323
    • /
    • 2009
  • Power allocation of soft frequency reuse(SFR) to increase cell edge user throughput by reducing inter-cell interference is proposed for coordinated cellular systems. SFR is the effective technique to increase cell edge user throughput, however, it costs the degradation of total system throughput. The cost increases when SFR operated in distributed resource controlled systems fails to be fast adaptive in the change of user distribution. The proposed scheme enables coordinated cells to control transmit power adaptively depending on user distribution so that it minimizes the loss of system throughput introduced from SFR while it guarantees enhancement of cell edge user throughput. Through system level simulation considering neighboring two cells, evaluation result for adaptive power allocation is shown compared with static power allocation.

Dynamic File Allocation Problems In Distributed Systems (분산 시스템의 동적 파일 할당 연구)

  • Seo, Pil-Kyo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1681-1693
    • /
    • 1997
  • In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.

  • PDF

An Study on the Cost Allocation Methods for Mobile Access Network in US (미국의 이동망 액세스 구간 비용 처리 방식에 관한 연구)

  • 조은진
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.305-308
    • /
    • 2003
  • It is widely used that a network termination rate is calculated by using a Long Run Incremental Costing model. Interconnection Order issued Ministry of Information and Communication in Korea on December 2002 has declared that termination charges of local, national, payphone, and mobile calls are going to be determined by LRIC costing models after 2004. There are lots of preceding researches on a fixed network costing model for applying to LRIC method but on a mobile network not pretty much of them. Besides, Most important basis of current calculation models for termination charges are access costs to connect subscribers to network such as a local loop. In this paper, we look into being of access costs in mobile network and show the applicable standards for cost allocation of access costs in implementing LRIC costing model.

  • PDF

A Splitter Location-Allocation Problem in Designing FTTH-PON Access Networks (FTTH-PON 가입자망 설계에서 Splitter Location-Allocation 문제)

  • Park, Chan-Woo;Lee, Young-Ho;Han, Jung-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.36 no.2
    • /
    • pp.1-14
    • /
    • 2011
  • In this paper, we deal with an access network design problem of fiber-to-the-home passive optical network (FTTH-PON). The FTTH-PON network design problem seeks to minimize the total cost of optical splitters and cables that provide optical connectivity between central office and subscribers. We develop a flow-based mixed integer programming (MIP) model with nonlinear link cost. By developing valid inequalities and preprocessing rules, we enhance the strength of the proposed MIP model in generating tight lower bounds for the problem. We develop an effective Tabu Search (TS) heuristic algorithm that provides good quality feasible solutions to the problem. Computational results demonstrate that the valid inequalities and preprocessing rules are effective for improving the LP-relaxation lower bound and TS algorithm finds good quality solutions within reasonable time bounds.

Adaptive Scheduling for QoS-based Virtual Machine Management in Cloud Computing

  • Cao, Yang;Ro, Cheul Woo
    • International Journal of Contents
    • /
    • v.8 no.4
    • /
    • pp.7-11
    • /
    • 2012
  • Cloud Computing can be viewed as a dynamically-scalable pool of resources. Virtualization is one of the key technologies enabling Cloud Computing functionalities. Virtual machines (VMs) scheduling and allocation is essential in Cloud Computing environment. In this paper, two dynamic VMs scheduling and allocating schemes are presented and compared. One dynamically on-demand allocates VMs while the other deploys optimal threshold to control the scheduling and allocating of VMs. The aim is to dynamically allocate the virtual resources among the Cloud Computing applications based on their load changes to improve resource utilization and reduce the user usage cost. The schemes are implemented by using SimPy, and the simulation results show that the proposed adaptive scheme with one threshold can be effectively applied in a Cloud Computing environment both performance-wise and cost-wise.

A Study on Fair Bandwidth Allocation in Core-Stateless Networks: Improved Algorithm and Its Evaluation

  • Kim, Mun-Kyung;Seo, Kyoung-Hyun;Yuk, Dong-Cheol;Park, Seung-Seob
    • Journal of Navigation and Port Research
    • /
    • v.28 no.4
    • /
    • pp.299-303
    • /
    • 2004
  • In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal : implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.

Multimedia traffic management in ATM networks (ATM망에서의 멀티미디어 트래픽 제어)

  • 안병준;이형호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.369-374
    • /
    • 1999
  • The problem of bandwidth allocation and routing in VP based ATM networks was studied. A priori reservation of resources for VP's reduces the statistical multiplexing gain, resulting in increased Call Blocking Probability (CBP). The focus of this study is on how to reduce CBP by the efficient bandwidth allocation and routing algorithms. Equivalent capacity concept was used to calculate the required bandwidth by the call. and the effect of traffic dispersion was explored to achieve more statistical gain. A cost-effective traffic dispersion routing algorithm, CED, was designed. The algorithm finds the optimal number of dispersion paths for a call, where the gain balances the dispersion cost. Simulation study showed that CED could significantly reduce the CBP.

  • PDF