• IE interfaces
• /
• v.22 no.1
• /
• pp.10-16
• /
• 2009

In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.

• 한국사회복지학회:학술대회논문집
• /
• 2004.04a
• /
• pp.457-473
• /
• 2004

This study purports to contribute to existing literatures and debates about the future of Korean public pension system by introducing the cases of pension privatization in eight Latin American countries. Following the Chilean reform in 1981, many Latin American nations to a varying degree replaced their public pension system with private one, and the performance of those private systems started to emerge. Overall, pension privatization does not appear to be the panacea that some of its advocates have argued. While it seems to remedy existing problems, it is creating new ones. As an unprecedented policy experiment, the pension privatization in many Latin American countries implies that there are a number of risks in the path of privatization.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.441-445
• /
• 2004

In this paper, we deal with an inventory model of a multi-stage, serial supply chain system where a single product type and nonstationary customer demand pattern are considered. The retailer and suppliers place their orders according to an echelon-stock based replenishment control policy. We assume that the suppliers can access online information on the demand history and use this information when making their replenishment decisions. Using a reinforcement learning technique, the inventory control parameters are designed to adaptively change as the customer demand pattern is altered, in order to maintain a given target service level. Through a simulation based experiment, we verified that our approach is good for maintaining the target service level.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.675-690
• /
• 1999

This study is to answer the following three questions: (1) What is SPICE? (2) Is it flexible enough to be applied to the small projects such as the ones owned by local companies and government agencies. The standards and models which comprise SPICE (Software Process Improvement and Capability dEtermination) or IS0/IEC 15504 were thoroughly reviewed first Based on the standards, we developed a methodology for the assessment of software processes was developed. Then the methodology is applied for the assessment for three projects in Kwangju area. For this experiment, a university, a district office, and a IT company were selected. Both the development application of the methodology was considered to be successful. As we go through the assessment, we can be convinced that the foundation of the SPICE is very sound. As we stick to the principles of SPICE, the assessment methodology that we developed worked well. The study suggests several implications for the policy making.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.978-982
• /
• 2009

This paper proposes a potential-based reinforcement learning, called "RLs-CBDT", which combines multiple RL agents and case-base decision theory designed for decision making in uncertain environment as an expert knowledge in RL. We empirically show that RLs-CBDT converges to an optimal policy faster than pre-existing RL algorithms through a Tetris experiment.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.05a
• /
• pp.229-244
• /
• 2004

The purpose of this paper is to find the method to improve the web accessibility of Korean Government's web sites through the investigation on the evaluation result of visually impaired people and the accessibility evaluation tool. Twenty five Korean Governments' web sites are chosen for this experiment. First, all of the sites are evaluated by accessibility evaluation tool (A-Prompt) based on Priority one of the Web Contents Accessibility Guidelines (WCAG) 1.0 of W3C. Second, three visually impaired people tried to find information or resister for the sites to check the accessibility. All of the sites are failed to conform to WCAG 1.0 and most of those are not accessible to information. The last part of this paper presents the method to improve the web accessibility of the Government's web sites.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.65-71
• /
• 2000

This thesis is what accident in sea have been produced as lost themselves life and property about 500times at every years. Therefore this was induced to experiment on a national basis that the role of communication of ship is to move from lose themselves life and property

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.61-64
• /
• 2000

This paper analyzes a dynamic lot-sizing problem, in which the order size of multiple products and a single container type are simultaneously considered. In the problem, each order (product) placed in a period is immediately shipped immediately by containers in the period and the total freight cost is proportional to the number of each container type employed. Also, it is assumed that backlogging is not allowed. The objective of this study is to determine the lot-sizes and the shipping policy that minimizes the total costs, which consist of ordering costs, inventory holding costs, and freight costs. Because this problem is NP-hard, we propose a heuristic algorithm with an adjustment mechanism, based on the optimal solution properties. The computational results from a set of simulation experiment are also presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2003-2021
• /
• 2020

Today's computer systems are widely integrated with CPU and GPU to achieve considerable performance, but energy consumption of such system directly affects operational cost, maintainability and environmental problem, which has been aroused wide concern by researchers, computer architects, and developers. To cope with energy problem, we propose a task-scheduling framework to reduce energy under performance constraint by rationally allocating the tasks across the CPU and GPU. The framework first collects the estimated energy consumption of programs and performance information. Next, we use above information to formalize the scheduling problem as the 0-1 knapsack problem. Then, we elaborate our experiment on typical platform to verify proposed scheduling framework. The experimental results show that our proposed algorithm saves 14.97% energy compared with that of the time-oriented policy and yields 37.23% performance improvement than that of energy-oriented scheme on average.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.2
• /
• pp.159-165
• /
• 2009

Through the understanding of the change of productivity and the ability of error recovery according to aging and the assessment and analysis of them, we may take this research to contribute to make a design for the road-map to help set up the policy of employment for old generation. For this we have taken an experiment of the coordination tester for 100 person who are chosen randomly and analysed the collected data using SAS, which is one of widely used statistical analysis packages. The main results are as follow: $\circledcirc$ The result of regression between the working speed and the length of the correction of error shows independence. (pr>0.2029). $\circledcirc$ The regression between age and working speed is statistically significant. (pr<0.0001) $\circledcirc$ The relation between age and the length of the correction of error is not significant. (pr>0.9123).