• Journal of Digital Convergence
• /
• v.18 no.10
• /
• pp.137-146
• /
• 2020

The purpose of this study is to confirm the moderating effect of the 'IRrelevance Processing'(IRP) on the relationship between decision maker's openness and business problem solving creativity (BPSC). In order to confirm the psychological mechanism of BPSC and openness, we developed the irrelevance processing. In particular, the creativity in this study is different from the general creativity studied in psychology. BPSC is a study with practical value applied in the management environment. The results showed that openness of the decision maker was correlated with the BPSC, and that the irrelevance processing was a psychological mechanism to moderating effects relationship between openness of decision makers and BPSC. This paper proved the correlation between the propensity of decision makers and BPSC, and contributed to the study of corporate creativity by identifying the psychological mechanisms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.548-574
• /
• 2009

Personal information (hereinafter referred to as "PI") infringement has recently emerged as a serious social problem in Korea. PI infringement in the public and private sector is common. There were 182,666 cases of PI in 2,624 public organizations during the last three years. Online infringement cases have increased. PI leakage causes moral and economic damage and is an impediment to public confidence in public organizations seeking to manage e-government and maintain open and aboveboard administration. Thus, it is an important matter. Most cases of PI leakage result from unsatisfactory management of security, errors in home page design and insufficient system protection management. Protection management, such as encryption or management of access logs should be reinforced urgently. However, it is difficult to comprehend the scope of practical technology management satisfied legislation and regulations. Substantial protective countermeasures, such as access control, certification, log management and encryption need to be established. It is hard to deal with the massive leakage of PI and its security management. Therefore, in this study, we analyzed the conditions for the technical protection measures during the processing phase of PI. In addition, we classified the standard control items of protective measures suited to public circumstances. Therefore, this study provides a standard and checklist by which staff in public organizations can protect PI via technical management activities appropriate to laws and ordinances. In addition, this can lead to more detailed and clearer instructions on how to carry out technical protection measures and to evaluate the current status.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.25-42
• /
• 2013

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time. Unless each milestone is completed on time, some penalty cost may be imposed. However, the penalty costs can be avoided by compressing the processing times of some jobs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time. We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.

• 한국디지털정책학회:학술대회논문집
• /
• 2005.06a
• /
• pp.517-530
• /
• 2005

Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However, Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets showed that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also showed that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

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

Tool costs can comprise a significant part of the total operating costs of Flexible Manufacturing Systems. We address the problem of determining the optimal processing times of individual operations and routing mix in FMSs with multiple routes for each part type in order to minimize tool cost, subject to meeting a throughput constraint for each part type. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. Numerical examples reveal the potential of our approach for significant saving in tool costs.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.163-163
• /
• 1988

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.166-169
• /
• 1997

For parallel processing, the compiler partitions a loaded program into a set of tasks and makes a schedule for the tasks that will minimize parallel processing time for the loaded program. Building an optimal schedule for a given set of partitioned tasks of a program has known to be NP-complete. In this paper we introduce a GA(Genetic Algorithm)-based scheduling method in which a chromosome consists of two parts of a string which decide the number and order of tasks on each processor. An additional computation is used for feasibility constraint in the chromosome. By granularity theory, a partitioned program is categorized into coarse-grain or fine-grain types. There exist good heuristic algorithms for coarse-grain type partitioning. We suggested another GA adaptive to the coarse-grain type partitioning. The infeasibility of chromosome is overcome by the encoding and operators. The number of processors are decided while the GA find the minimum parallel processing time.

• Proceedings of the Safety Management and Science Conference
• /
• 2001.05a
• /
• pp.189-193
• /
• 2001

This paper analyses the tool switching problem in the dynamic environment, where parts to be processed on a flexible machine arrive randomly. As the total number of tools required to Process a set of parts on the machine is generally larger than the available magazine storage capacity, tool switches between parts are usually necessary. We assume that tool switching must be made just before the processing of the parts. Since the time required for tool switches can be significant relative to processing time and cause the processing of parts to be delayed, it is desirable to minimize the number of tool switches. Therefore, we present one heuristic algorithm to minimize the total number of tool switches and the t)reposed heuristic is compared with the KTNS (Keep Tool Needed Soonest) policy on randomly generated problems.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.163-175
• /
• 1996

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.143-153
• /
• 2001

In this study we develop a computer simulation model to evaluate the effects of various production and order processing policies measured in terms of on-time delivery rate and average waiting time of job orders. Policies considered include : eliminating inflated due date, lot splitting, loss time reduction, attaining full flexibility in production lines, and selective order promising scheme. Actual order-production data from a chemical company were used in the simulation model. Based on the simulation results, we make several suggestions that can significantly reduce the production lead time and increase the on-time delivery rate.