• Title/Summary/Keyword: Profit allocation

Search Result 75, Processing Time 0.028 seconds

Efficiency and Fairness in Information System Chargeback (정보시스템 Chargeback에 있어서의 효율성과 공평성의 관계)

  • Yu, Yeong-Jin;An, Jung-Ho
    • Asia pacific journal of information systems
    • /
    • v.1 no.1
    • /
    • pp.117-145
    • /
    • 1991
  • IS changeback is regarded as an offective way to control the usage of computers and communication systems which are very much limited resources and whose costs are very high, In this paper, the problem of combining the optimal chargeback system which guarantees the efficiency with the Rawls'(1971) concept of fairness. Primary conclusion of this paper is that if the value function which represents the contributions of IS user to the firm's profit is evidit and there is no uncertainty about this contribution information, optimality can be achived without any loss of fairness using full cost allocation pricing. But if there is no significant differences among contribution of each user and there is no significant differences among users because of the managerial arbitrariness, From this point of view contingent chargeback system with which manager can find the golden middle between optimality and fairness by adjusting the 'efficiency coefficient' according to his/her organizational characterisics and environments is proposed. A heuristic of finding the appropriate efficiency coefficient is also suggested.

  • PDF

A Case Study on Costing Management of a Logistics Warehouse in Port Distri-park by Time-Driven ABC and Contribution Margin Analysis (TDABC와 공헌이익분석을 통한 항만배후단지 물류센터 원가관리 사례연구)

  • Jeong, Ji-Young;Ahn, Ki-Myung
    • Journal of Korea Port Economic Association
    • /
    • v.31 no.3
    • /
    • pp.167-186
    • /
    • 2015
  • The purpose of this case study is to verify the usefulness of three costing models and a minimum profit management model that can support the logistics warehouse companies in the Busan Newport Distri-park. This case study investigated traditional costing, activity-based costing (ABC), and time-driven ABC (TDABC); and suggested that an appropriate minimum profit management model is contribution margin analysis. Accordingly, in order to verify the usefulness of models, this case study surveyed the actual cost management conditions of companies, applied the three costing models to the "K" warehouse company in the Busan Newport Distri-park, and undertook a comparative study of the results. This case study produced two main findings. First, TDABC was verified as the most useful and advanced of the three costing models tested. Second, contribution margin analysis was confirmed to be the most suitable model to manage minimum profits for port warehouse companies in the Busan Newport Distri-park.

Game Theoretic Cache Allocation Scheme in Wireless Networks (게임이론 기반 무선 통신에서의 캐시 할당 기법)

  • Le, Tra Huong Thi;Kim, Do Hyeon;Hong, Choong Seon
    • Journal of KIISE
    • /
    • v.44 no.8
    • /
    • pp.854-859
    • /
    • 2017
  • Caching popular videos in the storage of base stations is an efficient method to reduce the transmission latency. This paper proposes an incentive proactive cache mechanism in the wireless network to motivate the content providers (CPs) to participate in the caching procedure. The system consists of one/many Infrastructure Provider (InP) and many CPs. The InP aims to define the price it charges the CPs to maximize its revenue while the CPs compete to determine the number of files they cache at the InP's base stations (BSs). We conceive this system within the framework of Stackelberg game where InP is considered as the leader and CPs are the followers. By using backward induction, we show closed form of the amount of cache space that each CP renting on each base station and then solve the optimization problem to calculate the price that InP leases each CP. This is different from the existing works in that we consider the non-uniform pricing scheme. The numerical results show that InP's profit in the proposed scheme is higher than in the uniform pricing.

Optimal Supply Chain formation using Agent Negotiation in SET Model based Make-To-Order (최적 공급사슬 구성을 위한 에이전트 협상방법론 개발)

  • Kim Hyun-Soo;Cho Jae-Hyung;Choi Hyung-Rim;Hong Soon-Goo
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.2
    • /
    • pp.99-123
    • /
    • 2006
  • In an effect to composite an optimal supply chain, this study has introduced an agent-based negotiation as a method to assign a lot of orders to a large number of participants. As a resources allocation mechanism to form a strategic cooperation based on information sharing between supply chain members(buyers, manufacturers, suppliers), this agent negotiation provides coordination functions allowing all participants to make a profit and accomplishing Pareto optimum solution from the viewpoint of a whole supply chain. A SET model-based scheduling takes into consideration both earliness production cost and tardiness production cost, along with a competitive relationship between multiple participants. This study has tried to prove that the result of an agent-based negotiation is a Pareto optimal solution under the dynamic supply chain environment, establishing the mathematical formulation for a performance test, and making a comparison with the heuristic Branch & Bound method.

  • PDF

Optimization Algorithm for k-opt Swap of Generalized Assignment Problem (일반화된 배정 문제의 k-opt 교환 최적화 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.5
    • /
    • pp.151-158
    • /
    • 2023
  • The researchers entirely focused on meta-heuristic method for generalized assignment problem(GAP) that is known as NP-hard problem because of the optimal solution within polynomial time algorithm is unknown yet. On the other hand, this paper proposes a heuristic greedy algorithm with rules for finding solutions. Firstly, this paper reduces the weight matrix of original data to wij ≤ bi/l in order to n jobs(items) pack m machines(bins) with l = n/m. The maximum profit of each job was assigned to the machine for the reduced data. Secondly, the allocation was adjusted so that the sum of the weights assigned to each machine did not exceed the machine capacity. Finally, the k-opt swap optimization was performed to maximize the profit. The proposed algorithm is applied to 50 benchmarking data, and the best known solution for about 1/3 data is to solve the problem. The remaining 2/3 data showed comparable results to metaheuristic techniques. Therefore, the proposed algorithm shows the possibility that rules for finding solutions in polynomial time exist for GAP. Experiments demonstrate that it can be a P-problem from an NP-hard.

A Simple Method for Solving Type-2 and Type-4 Fuzzy Transportation Problems

  • Senthil Kumar, P.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.225-237
    • /
    • 2016
  • In conventional transportation problem (TP), all the parameters are always certain. But, many of the real life situations in industry or organization, the parameters (supply, demand and cost) of the TP are not precise which are imprecise in nature in different factors like the market condition, variations in rates of diesel, traffic jams, weather in hilly areas, capacity of men and machine, long power cut, labourer's over time work, unexpected failures in machine, seasonal changes and many more. To counter these problems, depending on the nature of the parameters, the TP is classified into two categories namely type-2 and type-4 fuzzy transportation problems (FTPs) under uncertain environment and formulates the problem and utilizes the trapezoidal fuzzy number (TrFN) to solve the TP. The existing ranking procedure of Liou and Wang (1992) is used to transform the type-2 and type-4 FTPs into a crisp one so that the conventional method may be applied to solve the TP. Moreover, the solution procedure differs from TP to type-2 and type-4 FTPs in allocation step only. Therefore a simple and efficient method denoted by PSK (P. Senthil Kumar) method is proposed to obtain an optimal solution in terms of TrFNs. From this fuzzy solution, the decision maker (DM) can decide the level of acceptance for the transportation cost or profit. Thus, the major applications of fuzzy set theory are widely used in areas such as inventory control, communication network, aggregate planning, employment scheduling, and personnel assignment and so on.

Hierarchical Cellular Network Design with Channel Allocation Using Genetic Algorithm (유전자 알고리즘을 이용한 다중계층 채널할당 셀룰러 네트워크 설계)

  • Lee, Sang-Heon;Park, Hyun-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.321-333
    • /
    • 2005
  • With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.

  • PDF

SLA-Aware Scheduling Scheme for Market-based Computational Grid (마켓 기반 계산 그리드를 위한 SLA 인지형 스케줄링 기법)

  • Han, Young-Joo;Ye, Ren;Youn, Chan-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.220-223
    • /
    • 2011
  • For successfully commercialized grid systems, it is required to provide an efficient scheduling scheme which is able to optimize benefits for three participants such as consumers, brokers, and providers so that every participant has sufficient benefit to maintain a sustainable market. In this paper, we define this job scheduling problem as an objective optimization problem for three participants. The three objectives are to maximize the success rate of job execution, total achieved profit, and the system utilization. To address the scheduling problem, we propose heuristics referred to as SLA-aware scheduling scheme (SA) for optimal resource allocation. The simulation results show that the improvement and the effectiveness of the proposed scheme and the proposed scheme can outperform well-known scheduling schemes such as first come first serve (FCFS), shortest job first (SJF), and earliest deadline first (EDF).

Economic Considerations on the Allocation of Limitted Amount of Fertilizers(Nitrogen) to Different Crops (제한량(制限量)의 비료(肥料)를 작물별(作物別)로 분배(分配)함에 있어서의 경제적(經濟的) 고찰(考察))

  • Oh, Wang Keun;Choi, Young Sun
    • Korean Journal of Soil Science and Fertilizer
    • /
    • v.4 no.1
    • /
    • pp.75-78
    • /
    • 1971
  • A theory and method on the economic allocation of a limitted amount of fertilizer to different crops which show different responses to the application of fertilizers was discussed. If the amount of fertilizer is not enough for all the crops which a farmer plans to grow, the fertilizer should be shared among the crops so as to maximize his profit from all his crops. According to the theory and method discussed here 9.14, 7.11 and 8.75kg per ha./10 of nitrogen should be allocated to rice, barley and wheat instead of 10, 7.5 and 7.5kg per ha./10 which were the amount allocated by the Government of Korea in 1968. The theory could also be with advantage applied to the planning of national fertilizer allocation.

  • PDF

Application of Activity-Based Costing(ABC) for Modular Building Construction Indirect Costs Calculation at the Manufacturing Stage (활동기준원가계산법(Actvitiy-Based Costing)에 의한 모듈러 건축물 공장제작단계 간접비 산정 방안)

  • Lee, JeongHoon;Park, Moonseo;Lee, Hyun-Soo;Lee, Kwang-Pyo;Hyun, Hosang
    • Korean Journal of Construction Engineering and Management
    • /
    • v.16 no.4
    • /
    • pp.139-145
    • /
    • 2015
  • Modular construction is combined with manufacturing production process and conventional construction industry technique. Considering characteristic of modular construction production process, manufacturing facilities require indirect costs for utilities, equipment, and overall maintenance, which can affect modular units pricing. However, current modular construction cost classification is inadvertent to reflect the manufacturing overhead costs, because it is generally added as a percentage to sum of labor, material and equipment as it called in single cost pool used. This process is easy to estimate the total construction cost at the project starting points, but it brings on misunderstanding of project profit estimations by "cross subsidization phenomenon". To prevent this situation, in this research aims to provide modular construction overhead cost handling process at the detailed indirect cost calculation for manufacturing stage using Activity-Based Costing as one of the powerful method for overhead costs estimation and allocation. Using this research results, modular construction cost estimators have more detailed cost information of modular units and prevent to misallocate indirect costs. Also, it can be utilized to aid the understanding of the company's profit structure.