• 한국항해학회지
• /
• 제13권3호
• /
• pp.37-44
• /
• 1989

Recently recognize the labor productivity of port physical distribution system in the port and shipping areas, Much Efforts for evaluating this productivity has been made continuously. BUt still there is little study, so far, on a systematic research for the management of port labor gangs, and even those were mainly depended on a rule of thumb. Especially the object of this study is to introduce the method of optimal allocation and assignment for the labor gangs per pier unit in the multiple ships berthed at an arbitary pier or port. In case the multiple ships have a homogeneous cargoes or do not have sufficient labor gangs to be assigned. The problem of optimal allocation and assignment of the labor gangs to be i) formalized with multi-state decision process in form of difference equation as the pattern which converted the independent multiple ships into a single ship with the intra-multiple ships, and ii) the optimal size of labor gangs could be obtained through the simple mathematical method instead of complicated dynamic programming, and iii) In case of shortage of labor gangs available the evaluation function considering the labor gangs available and total shift times was introduced, and iv) the optimal allocation and assignment of labor gangs was dealt at the point of minimizing the summation of the total shift times and at the point of minimizing the total cost charged for the extra waiting time except PHI time during port times for the multiple ships combinations.

• 한국경영과학회지
• /
• 제13권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.

• 품질경영학회지
• /
• 제33권4호
• /
• pp.21-41
• /
• 2005

This study analyzes the Internet utilization pattern of customer by comprehensively investigating the previous studies on the behavior pattern of customer in terms of Internet business. Based on the analysis, this study develops research framework that supports strategic decision-making for resource allocation in Internet business. Such research framework would be helpful for providing the typology of Internet business model that can be specialized by each industry. As a result of the simulation analysis, it was found that the optimal resource allocation portfolio providing maximum profits to the Internet bookstore involves large-scale investment on delivery service and customer support service which are the key factors for post-purchase customer satisfaction, regardless of the growth pattern or size of Internet bookstore market. Consequently, from the above analysis, the investment ratio of resources for the profit maximization of Internet bookstore was drawn. Conclusively, based on the comprehensive examination of the results, this study provided a framework for dynamic resource allocation decision-making, and proposed a management strategy which allows consumers to shop under more favorable environment, and simultaneously enables the Internet bookstore to accomplish management objectives such as continuous growth and profit maximization.

• 한국정보과학회논문지:시스템및이론
• /
• 제27권6호
• /
• pp.592-598
• /
• 2000

분산 공유 메모리(Distributed Shared Memory) 시스템에서 데이타 참조의 지역성은 시스템 성능에 중요한 영향을 미친다. 데이타 참조의 지역성을 고려하여 적절하게 데이타를 배치할 경우 전체적인 시스템 성능 향상을 가질 수 있다. 본 논문에서는 데이타 배치 방식을 효과적으로 적용할 수 있는 동적제한 디렉터리 기법에서 성능을 평가한다. 데이타 배치 방식 정보는 동적 제한 디렉터리 기법에서 존재 비트를 효과적으로 이용할 수 있다. 그리고 적절한 존재 비트의 사용은 메모리 오버헤드를 줄이고 디렉터리 풀을 효율적으로 사용하므로 성능을 향상시킬 수 있다. 성능 평가를 위해 서로 다른 공유 특성을 가진 3개의 응용 프로그램으로 모의 실험하였다. 모의 실험 결과 최적 배치 방식은 3.6 배의 성능을 향상시킬 수 있다.

• 한국국방경영분석학회지
• /
• 제9권1호
• /
• pp.29-49
• /
• 1983

The algorithm developed in this paper utilized kettelle's [1] idea of the undominated allocation sequence and his way of tableau computation to solve the more general spares allocation problem in the system availability optimization. The algorithm is to optimally allocate resources to the independent modules which are connected to be series/parallel/mixed system configurations. It has advantages over the standard dynamic programming algorithm by eliminating the need for backtracking and by solving the allocation problem for any budget size. By careful heuristic inspection the algorithm can be made very efficient for manual calculations because large blocks of cells can be eliminated from computation. A numerical example is provided to illustrate the allocation algorithm.

• 대한전자공학회논문지
• /
• 제27권4호
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.288-307
• /
• 2013

This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

• Journal of Communications and Networks
• /
• 제4권2호
• /
• pp.136-147
• /
• 2002

In this paper, the maximal capacity of the data network link has attempted to be exploited by using the dynamic allocation strategy. We propose a new methodology based on the economic models for competing traffic classes (classes of sessions) in packet networks. As the demand for network services accelerates, users' satisfaction to the service level might decrease due to the congestion at the network nodes. To prevent this, efficient allocation of a networks resources, such as available bandwidth and switch capacity, is needed. By using the so-called user profile as well as the utility (e.g., data rate) functions, it is possible to allocate data rates and other utilities using the arbitrary number of QoS classes, say $0.01,...,$10.

• ETRI Journal
• /
• 제44권6호
• /
• pp.945-954
• /
• 2022

The 5G mobile network is promising to handle the dynamic traffic demands of user equipment (UE). Unmanned aerial vehicles (UAVs) equipped with wireless transceivers can act as flying base stations in heterogeneous networks to ensure the quality of service of UE. However, it is challenging to efficiently allocate limited bandwidth to UE due to dynamic traffic demands and low network coverage. In this study, a blockchain-enabled bandwidth allocation framework is proposed for secure bandwidth trading. Furthermore, the proposed framework is based on the Cournot oligopoly game theoretical model to provide the optimal solution; that is, bandwidth is allocated to different UE based on the available bandwidth at UAV-assisted-based stations (UBSs) with optimal profit. The Cournot oligopoly game is performed between UBSs and cellular base stations (CBSs). Utility functions for both UBSs and CBSs are introduced on the basis of the available bandwidth, total demand of CSBs, and cost of providing cellular services. The proposed framework prevents security attacks and maximizes the utility functions of UBSs and CBSs.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1645-1654
• /
• 2007

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.