• Title/Summary/Keyword: Cost Allocation

Search Result 605, Processing Time 0.022 seconds

Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

  • Choi, Su-Il;Huh, Jae-Doo
    • ETRI Journal
    • /
    • v.24 no.6
    • /
    • pp.465-468
    • /
    • 2002
  • Ethernet passive optical networks (PONs) are an emerging access network technology that provides a low-cost method of deploying optical access lines between a carrier's central office and a customer site. In this paper, we propose a new algorithm of dynamic bandwidth allocation for multimedia services over Ethernet PONs. To implement the suggested dynamic bandwidth allocation algorithm, we present control message formats that handle classified bandwidths in a multi-point control protocol of Ethernet PONs.

  • PDF

An Allocation Problem in a Certain Class of Flexible Manufacturing Systems

  • Kim, Sung-Chul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.1
    • /
    • pp.24-30
    • /
    • 1988
  • We study the optimal allocation of machines and pallets in a class of manufacturing systems. The FMS is modeled as a closed queueing network with balanced loading of the stations. An Algorithm is developed, which exploits the properties of the throughput function and solves the allocation problem for increasing concave profit and convex cost. We also study the more general case of allocating machines and pallets among a set of FMSs. A dynamic programming approach is developed, which solves the problem with O(M$^{3}$N$^{2}$) operations.

  • PDF

Quality Characteristic Choice and Resources Allocation under Consideration of Safety (안전성을 고려한 품질특성 선정 및 자원배분)

  • Kim Jong-Gurl;Jung Jin-Ho
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2004.11a
    • /
    • pp.245-252
    • /
    • 2004
  • This paper presents a method for choosing quality characteristics to consider safety by integrating QFD based on quality requirements and AHP based on safety requirements, also shows resources allocation method to maximize customer satisfaction by ranking the index of technical importance to cost.

  • PDF

Rationality Review of Cost Allocation Methodology at CHP (열병합발전에서 비용배분 방법론의 합리성 검토)

  • Kim, Deokjin;Choi, Byungryeal
    • Journal of Energy Engineering
    • /
    • v.29 no.2
    • /
    • pp.40-60
    • /
    • 2020
  • When various kinds of products are produced from a single energy system, the methodology which allocates the common cost to each product cost is very important because it is directly related with the profit and loss of producer and purchaser. In the cost allocation methodology of electricity and heat for CHP, there are heat method, work method, benefit distribution method, exergy method, and so on. Benefit distribution method is the most widely known worldwide, and exergy method is widely recognized among thermal engineers. As a result of review, it is judged that the rationality of benefit distribution method is low because the result deviates from common sense, and the rationality of exergy method is high because the result consistent with common sense. In accounting, it is calculated as merit methodology and the result is used for negotiations between producer and buyer, but In thermal engineering, the rationality of exergy methodology is described only as a thesis. The purpose of this study is to compare and examine the rationality of merit methodology and exergy methodology, and the aim is to describe in detail in order that producer and buyer can understand the rationality of each methodology.

Intelligent Allocation of Transporting Resources in Logistics using Genetic Algorithm (유전자 알고리즘을 이용한 물류에서의 지능적 운송 자원 할당)

  • Kim, Ju-Won;Cha, Yeong-Pil;Jeong, Mu-Yeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.23-26
    • /
    • 2004
  • Recently, most of countries in the world are investing huge amount of capital for the infrastructure of logistics and trying to gain dominating position in logistics. To play the role of important hub in logistics, an efficient, flexible, and fault-tolerant transportation process should be developed. Minimization of transportation cost and timely deliveries in the unpredictable environment are a few of the important issues in logistics. This study suggests a way of transporting goods to destinations at the minimal cost and with the minimal delay by optimally allocating transporting resources. Various attributes in transportation such as due date, priority etc. are also considered. Appropriate transporting resources for each work item is selected by calculating the weighted sum of the cost factor and the delay factor assuming that initial sequences of work items are given. A policy to reallocate transporting resources is also suggested when work items or transporting resources are added or deleted because of accidents or disturbances. This policy provides adaptability to the allocation methodology which enables the system to cope with changing environment by controlling various attributes in transportation. Genetic algorithm is used for this approach.

  • PDF

Optimized Resource Allocation for Utility-Based Routing in Ad Hoc and Sensor Networks

  • Li, Yanjun;Shao, Jianji
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1790-1806
    • /
    • 2015
  • Utility-based routing is a special type of routing approach using a composite utility metric when making routing decisions in ad hoc and sensor networks. Previous studies on the utility-based routing all use fixed retry limit and a very simple distance related energy model, which makes the utility maximization less efficient and the implementation separated from practice. In this paper, we refine the basic utility model by capturing the correlation of the transmit power, the retry limit, the link reliability and the energy cost. A routing algorithm based on the refined utility model with adaptive transmit power and retry limit allocation is proposed. With this algorithm, packets with different priorities will automatically receive utility-optimal delivery. The design of this algorithm is based on the observation that for a given benefit, there exists a utility-maximum route with optimal transmit power and retry limit allocated to intermediate forwarding nodes. Delivery along the utility-optimal route makes a good balance between the energy cost and the reliability according to the value of the packets. Both centralized algorithm and distributed implementations are discussed. Simulations prove the satisfying performance of the proposed algorithm.

The cost allocation of Voice and data traffic in Mobile Telephone Network (이동망 음성 및 데이터 공유설비 비용배분 방안)

  • Jung Choong-young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.8
    • /
    • pp.1802-1809
    • /
    • 2004
  • This paper discusses cost allocation model of common facilities in voice and data traffic of mobile telephone network. There are several methods to be considered including traffic, facility, revenue, Ramsey, and benchmarking in local loop unbundling for High Speed Internet. It is important to investigate the strength and weakness of each method. This paper reviews the theoretical literatures and compares the characteristics of each methodology. Also, case studies are employed to get the implications concerned. As a result, in the beginning, it is desirable to introduce 50:50 allocation method used in local loop unbundling in UK. Then, it is recommendable to apply the ratio allocation method as the quantities of voice and data traffic become equal.

A Part Release considering Status of Tool in FMS (FMS에서 공구 상태를 고려한 부품투입 방법)

  • 이충수;오형술;박경종
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.04a
    • /
    • pp.377-380
    • /
    • 2001
  • A recent trend in flexible manufacturing systems(FMS) is to compose of the identical versatile-machines and to use dynamic tool allocation strategy, sharing tools between machines with fast tool delivery system. Unlike a conventional FMS where parts are fed to the machines with the required tools, tools are acquired from other machines using a tool delivery system and parts can be finished on the same machine in these FMS. Therefore it is more important problem to plan tool flow using tool delivery system in these FMS rather than part flow in conventional FMS. According to existing study, in FMS 20~30 percent of the total management cost is the cost related with tools and it is possible to reduce the tool inventory by 40 percent using efficient tool allocation. In this study, in FMS under dynamic tool allocation strategy, a new method of part release considering tool flow at the stage of part release is proposed. In order to prove the efficiency of the proposed part release it is compared with other part release through simulation experiments. Performance measures in these experiments are the throughput and the number of tardy parts.

  • PDF

Multimedia Service Discrimination Based on Fair Resource Allocation Using Bargaining Solutions

  • Shin, Kwang-Sup;Jung, Jae-Yoon;Suh, Doug-Young;Kang, Suk-Ho
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.341-351
    • /
    • 2012
  • We deal with a resource allocation problem for multimedia service discrimination in wireless networks. We assume that a service provider allocates network resources to users who can choose and access one of the discriminated services. To express the rational service selection of users, the utility function of users is devised to reflect both service quality and cost. Regarding the utility function of a service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between a service provider and a user group, while an inner model is a service selection game among users, which is solved by adopting the Kalai-Smorodinsky bargaining solution. Through simulation experiments, we compare the proposed framework with existing resource allocation methods according to user cost sensitivity. The proposed framework performed better than existing frameworks in terms of total profit and fairness.

An Efficient Mixed-Integer Programming Model for Berth Allocation in Bulk Port (벌크항만의 하역 최적화를 위한 정수계획모형)

  • Tae-Sun, Yu;Yushin, Lee;Hyeongon, Park;Do-Hee, Kim;Hye-Rim, Bae
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.6
    • /
    • pp.105-114
    • /
    • 2022
  • We examine berth allocation problems in tidal bulk ports with an objective of minimizing the demurrage and dispatch associated berthing cost. In the proposed optimization model inventory (or stock) level constraints are considered so as to satisfy the service level requirements in bulk terminals. It is shown that the mathematical programming formulation of this research provides improved schedule resolution and solution accuracy. We also show that the conventional big-M method of standard resource allocation models can be exempted in tidal bulk ports, and thus the computational efficiency can be significantly improved.