• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2294-2314
• /
• 2011

The key issue in providing fast and reliable access on cloud services is the effective management of resources in a cloud system. However, the high variation in cloud service access rates affects the system performance considerably when there are no default routines to handle this type of occurrence. Adaptive techniques are used in resource management to support robust systems and maintain well-balanced loads within the servers. This paper presents an adaptive resource management for cloud systems which supports the integration of intelligent methods to promote quality of service (QoS) in provisioning of cloud services. A technique of dynamically assigning cloud services to a group of cloud servers is proposed for the adaptive resource management. Initially, cloud services are collected based on the excess cloud services load and then these are deployed to the assigned cloud servers. The assignment function uses the proposed proportional ordering which efficiently assigns cloud services based on its resource consumption. The difference in resource consumption rate in all nodes is analyzed periodically which decides the execution of service assignment. Performance evaluation showed that the proposed dynamic service assignment (DSA) performed best in throughput performance compared to other resource allocation algorithms.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.7 no.3 s.18
• /
• pp.77-83
• /
• 2004

This paper focuses on a scheduling problem of military training. Repetitive and identical training over multiple serials is a common type of military education. A simple but systematic method is suggested to determine a training schedule for small groups divided from each serial. A satisfactory training schedule and the number of such small groups can be determined by iteratively solving assignment problems with additional constraints. With this method, loads of instructors can also be balanced without violating constraints associated with precedence and continuity relationships among lectures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1514-1523
• /
• 2009

It is well known that the current wireless sensor networks addressing methods do not work efficiently in networks more than a few hundred nodes. A standard protocol in ZigBee-Standard feature in ZigBee 2007 gives balanced tree based address assignment method with distributed manner. However, it was limited to cover less than hundreds of sensor nodes due to the wasteful use of available address space, because composed sensor networks usually make an unbalanced tree topology in the real deployment. In this paper, we proposed the hierarchical cluster tree based address assignment method to support large and scalable networks. This method provides unique address for each node with distributed manner and supports hierarchical cluster tree on-demand. Simulation results show that the proposed method reduces orphan nodes due to the address exhaustion and supports larger network with limited address space compared with the ZigBee distributed address assignment method defined in ZigBee-Standard feature in ZigBee 2007.

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.6
• /
• pp.55-65
• /
• 2019

With the advent of the Fourth Industrial Revolution and changes in the educational environment, team-based assignments are increasing in university classes. Effective team formation in team-based class is an important issue that affects students' satisfaction and the effectiveness of education. However, previous studies mostly focused on post analysis on the results of team formation, which makes it difficult to use them in actual classes. In this paper, we present a mathematical model of how to create a balanced team that reflects students' abilities and other characteristics. Characteristic values for assignment may be scores, such as students' proficiency, binary values such as gender, and multi-values, such as grade or department. This problem is a type of equitable partitioning problem, which takes the form of 0-1 integer programming, and the objective function is linear or nonlinear, depending on how balance is achieved. The basic model or the extended model presented can be applied to the situation where teams are balanced in consideration of various factors in actual class.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.4
• /
• pp.330-337
• /
• 2015

A bucket-brigade is a way of transporting items where items are passed from one person to the next. The operation of the bucket brigade imitates the cooperative behavior of ants when brood, food or other resources are moved. Koo (2009) presented a bucket brigade-based assembly cell where each worker follows a simple rule: perform assembly operations on a product until the next worker downstream takes it over; then go back to the previous worker upstream to take over a new assembly job. In this way, the flow line is self-balanced without any predetermined job assignment. However, there are some productivity losses related to hand-off and blocking. This paper examines the hand-off and blocking losses and presents a new bucket brigade-based assembly cell where working areas for each assembler is restricted with the help of buffer interfaces. Simulation experiments are used to validate the performance of the new assembly system.

• IE interfaces
• /
• v.22 no.2
• /
• pp.144-152
• /
• 2009

Assembly line has been recognized as an efficient production system in mass production. However, the recent production environment characterized as mass customization urges production managers to transform a long assembly line to a number of short assembly cells. To maximize the utilization of resources in an assembly cell, it is important to have the line balanced. This paper presents a bucket brigade-based assembly cell. Bucket brigade is a way of coordinating workers who progressively perform a set of assembly operations on a flow line. Each worker follows a simple rule: perform assembly operations on a product until the next worker downstream takes it over; then go back to the previous worker upstream to take over a new assembly job. In this way, the line balances itself. The bucket brigade assembly cell is analyzed and compared with traditional assembly lines and general assembly cells. The paper also discusses some prerequisite requirements and limitations when the bucket brigade assembly cells are employed.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.330-340
• /
• 2012

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.153-162
• /
• 2013

This paper proposes the most simple method for optimal solution of the transshipment problem. Usually the transshipment problem is solved by direct linear programming or TSM (Transportation Simplex Method). The method using TSM has two steps. First it is to get a initial solution using NCM, LCM, or VAM, second to refine the initial solution using MOD or SSM. However the steps is complex and difficult. The proposed method applies the method that transforms transshipment problem to transportation problem. In the proposed method it simply selects the minimum cost of rows about transportation problem, and then it applies the method that assigns a transported volume as an ascending sort of the costs of rows about the selected costs. Our method makes to be very fast got the initial value. Also we uses the method that controls assignment volume, if a heavy item of cost is assigned to a transported volume and it has a condition to be able to transform to more lower cost. The proposed algorithm simply got the optimal solution with applying to 11 transshipment problem.

• Asia-Pacific Journal of Business
• /
• v.10 no.4
• /
• pp.87-118
• /
• 2019

The purpose of this study is to examine the effects of person-job fit, which consists of educational fit and skill fit, on employees' intrinsic job satisfaction. To the end, the 10-year balanced panel data of the Korean Labor and Income Panel Study(KLIPS) by the Korea Labor Institute (KLI) for 2008-2017 are utilized. This study analyzes 12,730 observations by 1,273 employees by using fixed effect model, random effect model, and pooled OLS estimation method. The empirical results are as follows: First, it is founded that educational fit and skill fit seem affect job satisfaction positively. Second, the negative effects of over-education are clear and the negative effects of under-education are unclear, while the effects of over-skilled and under-skilled are insignificant statistically. Third, the results imply that the size of effect of over-education on intrinsic job satisfaction is larger than that of the effect of over-skilled. Forth, it is shown that the use of fixed effect model is more effective and trustworthy than that of random effect model and pooled OLS estimation method, implying that the effect size of coefficients which are estimated by pooled OLS method and random effect model are likely over-estimated. The empirical results above imply that firms and employees should focus on solving over-education issue before all in order to enhance employees' job satisfaction and it is needed to monitor regularly whether systemic job assignment process is done based on the employees' educational attainment and skill level and to provide more chances for job re-allocation and job rotation.

• Management & Information Systems Review
• /
• v.30 no.1
• /
• pp.71-86
• /
• 2011

The existing tax law provides that alloted resident tax on corporation tax is apportioned in accordance with the number of employees and total building area as of the end of business year. Through a case analysis, however, this study found that such apportionment is not applied to businesses whose operation was already withdrawn as of the end of business year. To solve this problem, the study proposed that the apportionment of alloted resident tax on corporation tax should be made in accordance with the number of employees and total building area in the middle of business year and a standard of corporation tax assessment, that is, sales assessed according to the value-added tax law. This proposal already proved to be reasonable by lots of actual cases that showed the realization of balance in taxation. To make more precise standards of the above mentioned apportionment, then, the study proposed that in the ordinance of the local tax law, 'as of the end of business year' should be replaced by 'in the middle of business year'. In addition, 'in the middle of business year' should be defined as 'in the period of continuous business' from the date of business end in the previous year to the date of business end in the present year and the length of the period should be calculated by month. These moves would bring more transparent and balanced local tax assignment than present under the local tax law.