• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.147-161
• /
• 1996

Generally the Multiprocessor Scheduling (MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm (GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and GP/MISF (Critical Path/Most Immediate Successors First). An efficient genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with GA to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• Journal of Korea Technology Innovation Society
• /
• v.2 no.3
• /
• pp.118-128
• /
• 1999

This study attempts to provide an efficient method for managing the Nuclear R&D projects. It should be noted that the technology and experiences to develop a well-balanced plan and mon-itoring for the R&D project are not yet well established when compared with the commercial con-structionand engineering projects. This study recommends that the R&D project manager utilize the scheduling techniques to establish an integral management system taking in to account the un-certainties in the research environment. Based upon the results of a case study for the Liquid Metal Reactor Design Technology Development Project which is led by the KAERI this study also con-firms that it is possible to run the national nuclear R&D projects with the Scheduling & Planning.

• Industrial Engineering and Management Systems
• /
• v.7 no.3
• /
• pp.204-213
• /
• 2008

Companies that produce capital goods need to schedule the production of products that have complex product structures with components that require many operations on different machines. A feasible schedule must satisfy operation and assembly precedence constraints. It is also important to avoid deadlock situations. In this paper a Genetic Algorithm (GA) has been developed that includes a new repair process that rectifies infeasible schedules that are produced during the evolution process. The algorithm was designed to minimise the combination of earliness and tardiness penalties and took into account finite capacity constraints. Three different sized problems were obtained from a collaborating capital goods company. A design of experimental approach was used to systematically identify that the best genetic operators and GA parameters for each size of problem.

• Journal of Distribution Science
• /
• v.3 no.2
• /
• pp.77-99
• /
• 2005

In the business environment which enclosed the domestic small and d medium distribution industry, and a business sign of recovery, reduction of income, job insecurity, and a national pension an aging society - positive exhibition of the large-sized store in comparison with the low personal consumption depended uneasy and deregulation, and consumer needs progress of individualization diversification it is ultimately faced with a difficult situation. Therefore the seen research examine the various range of a circulation policy through precedence research. It is going to consider and see the influence which the circulation regulation means of the purpose of large-sized store regulation and a major power is compared, and regulation.

• Architectural research
• /
• v.11 no.2
• /
• pp.43-49
• /
• 2009

Since the late 1980s, the schedule technique applied to the construction industry around the world has rapidly changed from the traditional ADM (Arrow Diagramming Method) to the PDM (Precedence Diagramming Method) technique. The main reason for this change is to overcome the limits and inconveniences of the traditional ADM technique. The time-cost trade-off is one of the core scheduling techniques to establish the best optimized combination plan in terms of a relationship between the cost and schedule. However, most of the schedule-related textbooks and research papers have discussed and proposed applications of a time-cost trade-off technique based only on the Finish to Start relationship. Therefore, there are almost no consideration and discussion of problems or restrictions that emerge when the time-cost trade-off technique is applied to the PDM network that has overlapping relationships. This paper proposes the lead-time adjustment method as a methodology for overcoming some restrictions that are encountered when the time-cost trade-off technique is applied to the overlapping relationships of the PDM network.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.220-229
• /
• 1995

Generally the Multiprocessor Scheduling(MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm(GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and CP/MISF(Critical Path/Most Immediate Successors First). A new genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with Ga to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• The Journal of the Korea Contents Association
• /
• v.1 no.1
• /
• pp.24-31
• /
• 2001

In The AV system, to produce a realistic sound effect is very difficult because the distance between stereo speakers is very narrow. Many signal processing method of widening the sound image for spatial impression have been studied. Most of the typical methods of widening the sound image are related to the phase shifting. but this method was not effective in the concrete wall structure with high reflectivity. In this paper, we proposed an effective method of extending stereo sound image using Precedence Effect and reflected sound. In experiments we confirmed the usefulness of the method for extending stereo sound image of a conventional AV system in wider listening area of a room.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.4
• /
• pp.23-30
• /
• 2013

Reliability Centered Maintenance(RCM) is one of most widely used methods in the modern power system to schedule a maintenance cycle and determine the priority of inspection. A precedence study for the new structure of rearranged system should be performed due to introduction of additional installation. This paper proposes a new method to evaluate the priority of maintenance and inspection of the power system facilities. In order to calculate that risk index, it is required that the reliability block diagram should be analyzed for the power system. Additionally, a fault cause analysis is also performed through the event-tree analysis.

• Journal of Korean Library and Information Science Society
• /
• v.40 no.2
• /
• pp.5-26
• /
• 2009

The purpose of this study aims to provide possible suggestions for the improvement KDC 5th ed. as a system. After analyzing and evaluating various devices of KDC 5th ed. such as schedules, common auxiliary tables, internal tables(omitted), notes, relative index, precedence order(omitted), alternatives, manual(omitted) and relocated table(omitted), suggestions for the improvement were proposed. If above suggestions are adopted, effective literature classification scheme which is suited to domestic circumstances will be certainly prepared.

• Journal of the Korea Society for Simulation
• /
• v.3 no.1
• /
• pp.43-53
• /
• 1994

With remarkable progress of hardware technologies, multiprocessor systems equipped with thousands of processors will be available in near future. In order to increase the performance of these systems, many processor allocation algorithms have been proposed. However, few studies have been conducted in order to compare the performance of these algorithms. In this paper, simulation techniques are used in order to compare the performance of the processor allocation algorithms proved to be useful. These are: an algorithm using equipartion, an algorithm using average parallelism, an algorithm using execution signatures, and an algorithm using the number of tasks in a task precedence graph. Simulation shows that the algorithm using execution signatures performs best while the algorithm using average parallelism performs worst with small allocated processors. Surprisingly, the algorithm using equipartition performs well despite the fact that it has smallest overhead. Overall, it can be recommended that the algorithm using equipartition be used without any execution history and that the algorithm using execution signatures be used with some execution history.