• 경영과학
• /
• 제26권1호
• /
• pp.127-136
• /
• 2009

This paper purposes analyzing how task assignments influence on business process efficiency, and improving business process efficiency in Business Process Management (BPM) environments. For this purpose, task assignment is categorized into dynamic assignment and static assignment. Dynamic assignment binds a user to a task at process run-time, whereas static assignments assigns a task to a user at process build-time. So far, the influence of task assignment methods has not been studied. We, in this paper, analyze the business process efficiency using two different assigning rule, in terms of cycle time as a efficiency measure. The comparison result can provide a guideline for a company who wants to employ commercial BPM systems.

• ETRI Journal
• /
• 제25권4호
• /
• pp.211-218
• /
• 2003

This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

• 한국통신학회논문지
• /
• 제37권3B호
• /
• pp.181-188
• /
• 2012

본 논문에서는 요구할당 다중접속 기반의 네트워크에서 다양한 전송주기의 특징을 고려하여 주어진 시간슬롯을 효율적으로 운용할 수 있는 중심국의 시간슬롯 할당 알고리즘을 제안하였다. 제안된 알고리즘의 성능을 검증하기 위해 시뮬레이션으로 제안 알고리즘과 랜덤 할당 알고리즘을 비교하였다. 시뮬레이션 결과, 제안한 알고리즘의 시간슬롯 이용효율이 랜덤 할당 알고리즘 보다 우수함을 확인할 수 있었으며, 이러한 경향은 네트워크 혼잡도가 낮은 환경에서 짧은 전송주기의 시간슬롯 할당에 있어서 더욱 뚜렷하였다.

• Industrial Engineering and Management Systems
• /
• 제14권4호
• /
• pp.372-378
• /
• 2015

In labor-intensive enterprise, such as garment factory, assembly line is widely used as a manufacturing process for reducing costs and production time. However, for the sake of the various working capacity of worker, idle or delay may happen and influence the rear processes. If these unforeseeable delay happened continuously, it may influence the whole manufacturing process and a model, which is called limited-cycle model with multiple periods (LCMwMP), is assumed to evaluate the influence risk. In order to minimize the risk, the assignment of the workers is focused on. In this paper, we deal with an assembly line as LCMwMP model when two kinds of workers exist, whose efficiency is assumed to two different groups. We consider an optimization problem for finding an assignment of workers to the line that minimizes total expected risk, which is exchanged to expected cost by reset model of LCMwMP. First, reset model as a simple model of LCMwMP is introduced. Then, some hypotheses of the rules of the optimal worker assignment are proposed and some numerical experiments are researched assuming the processing time as Erlang distribution. Finally, the other rules on other certain conditions are discussed.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2010년도 춘계학술대회 논문집
• /
• pp.1166-1170
• /
• 2010

In the case of railway freight, there's a lot of process at railway freight terminal. In these days, for operation efficiency improvement, Load/Unload planning is being carried out research. Load/unload problem can be classified as track assignment, container assignment, yard truck route problem, unload equipment scheduling, container yard plan. In this paper, we focus on track assignment and container assignment among the load/unload problem. we analysis information architecture to solve this problem. And we compares two precesses for existing method and optimization method of track/container assignment processes. An contents different analysis of two methods can shows reformation of an information architecture for load/unload process in the railway freight terminal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2035-2049
• /
• 2015

Applications deployed in cloud receive a huge volume of requests from geographically distributed users whose satisfaction with the cloud service is directly proportional to the efficiency with which the requests are handled. Assignment of user requests based on appropriate load balancing principles significantly improves the performance of such cloud-based applications. To study the behavior of such systems, there is a need for simulation tools that will help the designer to set a test bed and evaluate the performance of the system by experimenting with different load balancing principles. In this paper, a novel architecture for cloud called Request Assignment Simulator (RAS) is proposed. It is a customizable, visual tool that simulates the request assignment process based on load balancing principles with a set of parameters that impact resource utilization. This simulator will help to ascertain the best possible resource allocation technique by facilitating the designer to apply and test different load balancing principles for a given scenario.

• 한국항만학회지
• /
• 제9권2호
• /
• pp.1-8
• /
• 1995

Generally, berth assignment problem has conflicting factors according to the interested parties. In the view of shipping company, it is desirable that berth assignment is made according to the order of arrival. But in the view of port operator, it is better to be assigned regardless the order of arrival to promote the efficiency of berth operation. Thus, it is necessary to establish berth assignment planning which reflects both of interests in a practical situation. This paper aims to develop a reasonable berth assignment algorithm in a container terminal by considering the prescribed factors, and suggests three types of models minimizing the objective functions such as total port staying time, total mooring time and total maximum mooring time by using MPS concept. These models are formulated by 0-1 integer programming and min-max type function, but as the number of variables increases, an optimal solution cannot be achieved easily within a desired computational time. Thus, to tackle this problem this paper proposes a heuristic algorithm, and also the heuristic algorithm proposed in this paper is verified through the several examples.

• 한국IT서비스학회지
• /
• 제11권2호
• /
• pp.291-306
• /
• 2012

Recently, Wireless Mesh Network (WMN) technology recently has been used in various industries. Especially, a number of multi-channel assignment schemes have been presented to improve the throughput of IEEE 802.11-based multi-hop WMN. However, performance of the conventional multi-channel assignment schemes is not enough to satisfy the industry requirements. We, thus, should study more about the multi-channel assignment scheme in order to enhance the performance. This paper proposes a novel channel assignment scheme that employs Multi-channel and Multi-Interface in the WMN. The proposed scheme can obtain the traffic information of the network and the efficient channel assignment result without any message exchanges. We verify the efficiency of the proposed scheme through the mathematical modeling and the real-world experiments. The results show that the proposed scheme improves the throughput of the network compared with the conventional schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권1호
• /
• pp.350-364
• /
• 2022

Traditionally, in multi-user multi-carrier systems, the neighboring subband will be gapped by one subcarrier, which is set as guard band to reduce multiple access interference (MAI) between neighboring subbands. The empty subcarrier for guard band will degrade the spectral efficiency of the whole system. In order to enhance the spectral efficiency of multi-user filter bank multiple carrier (FBMC) systems, a new subband allocation method is introduced, in which the neighboring subband is gapped by half subcarrier instead of one subcarrier. Meanwhile, in order to implement the proposed resource allocation scheme, an optimized FBMC prototype filter is designed to decrease the inter-subband interference to the neighboring subband. The detailed simulations about the comparison between the proposed spectrum assignment and traditional FBMC are given, as well as the performance in the different interference scenarios. The simulation results show that the combination of the proposed spectrum assignment scheme and the optimized filter has better performance compared to the traditional scheme. The proposed scheme can be used in the system which serves massive users to get higher spectrum efficiency.

• 한국지능시스템학회논문지
• /
• 제23권6호
• /
• pp.487-493
• /
• 2013

스마트 기기의 보급 확대로 다양한 콘텐츠를 서비스하는 이동 단말기의 한정된 채널 할당 문제가 심화되고 있다. 이동통신망에서는 이동국에서 채널할당 요청이 있을 때 교환국에서 각 기지국에 속한 이동국에 채널을 할당한다. 이 때 한정된 채널을 효과적으로 할당하기 위한 다양한 방식들이 제안되고 있는데, 여기서는 하이브리드 채널 할당에 유전 알고리즘을 이용한 UHGA(Universal Hybrid Channel Assignment using Genetic Algorithm)이 농촌 지역이나 도심 지역과 같은 다양한 환경의 범용 망에 적용되어 효율성이 있음을 시뮬레이션을 통해 검증한다.