• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.97-109
• /
• 2001

This research is concerned with jobshop scheduling problem for an advanced manufacturing system like flexible manufacturing which consists of two machine centers and a single automated guided vehicle(AGV). The objective is to develop and evaluate heuristic scheduling procedures that minimize makespan to be included travel time of AGV. A new heuristic algorithm is proposed and illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions in reduction ratio and frequency than the previous algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.81-89
• /
• 1997

This study is concerned with the scheduling problems in flexible manufacturing systems(FMSs). The scheduling problem in FMSs is a complex one when the number of machines and jobs are increased. Thus, a heuristic method is recommended in order to gain near-optimal solutions in a practically acceptable time. The purpose of this study is to develope a machine and AGV dispatching algorithm. The proposed dispatching algorithm is a on-line scheduling algorithm considering the due date of parts and the status of the system in the scheduling process. In the new machine and AGV dispatching algorithm, a job priority is determined by LPT/LQS rules considering job tardiness. The proposed heuristic dispatching algorithm is evaluated by comparison with the existing dispatching rules such as LPT/LQS, SPT/LQS, EDD/LQS and MOD/LQS. The new dispatching algorithm is predominant to existing dispatching rules in 100 cases out of 100 for the mean tardiness and 89 cases out of 100 for the number of tardy jobs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.1
• /
• pp.99-106
• /
• 1990

With two-class-based storage assignment policy and dual command cycle in Automated Storage/Retrieval Systems(AS/RS), the problem of determining the region dedicated for class-one item is considered. First, the expected travel time of the S/R machine is derived when the boundary of the class-one region is square. Secondly, a heuristic procedure is proposed which determines sequentially the class-one region in a discrete rack. An application of the procedure generates leaf shape region which confirms that the L-shape partition is not necessarily optimal.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.107-112
• /
• 2006

This study presents the new dispatching rules for improving performance measures of job shop scheduling related to completion time and due dates. The proposed dispatching rule considers information, which includes the comparison value of job workload, work remaining, operation time, and operation due dates. Through computer experiments, the performance of the new dispatching rules is compared and analyzed with the existing rules. The results provide a guidance for the researchers to develop new dispatching rules and for practitioners to choose rules of job shop scheduling.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.379-382
• /
• 1999

모든 문장에는 '새로운' 정보를 전달하기 위한 초점이 있고 높낮돋들림을 포함하는 초점범위는 다시 정보 초점을 필수 요소로 갖는 정보 구조 경계를 갖는다. 모호성이 없는 적절한 초점 구조를 결정하기 위해 '국어 초점 원리'를 도입함으로써 초점 성분의 영역이 확인되고 화맥에 의한 초점 해석이 가능해진다. 초점 성분을 설명하고 높낮돋들림과 초점 돋들림의 관계를 기술하는 '기본초점규칙'이 필요하며 '정보 구조 원리'에 의해 '새로운' 정보가 선택되어 초점 범위는 화맥에 의해 구체화된다. 정보 구조가 문법 체계의 모든 의미 계층과 관계를 가지며 정보 구조의 경계 안에 정보 초점으로 실현되는 초점 돋들림이 있게 되므로 기본 초점 규칙은 '초점 돋들림 원리'로 수정되어 초점 범위 내의 음절에 초점 돋들림이 할당된다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.216-219
• /
• 1998

This study proposes JPT(Job-Pair Tardiness) that choose operation to be expected to generate better schedule consequence in comparing schedulable operation sets in pair to minimize total tardiness evaluation function in performing scheduling. In result of comparison with existing assignment rules. JPT generates better solution than most other rules in all kinds of problems. So it is anticipated that this is used for initial solution of heuristic and is used for finding more improved solution.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.6
• /
• pp.1085-1091
• /
• 2012

Phase I clinical trials are designed to identify an appropriate dose; the maximum tolerated dose, which assures safety of a new drug by evaluating the toxicity at each dose-level. The adjusted maximum tolerated dose estimation is presented by stopping rule in phase I clinical trial on this research. The suggested maximum tolerated dose estimation is compared to the standard method3 and NM method using a Monte Carlo simulation study.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.5
• /
• pp.409-416
• /
• 2000

In the shared-memory mutiprocessor systems, shared processing techniques such as time-sharing, space¬sharing, and gang-scheduling are used to improve the overall system utilization for the parallel operations. Recently, LLPC(Loop-Level Process Control) allocation technique was proposed. It dynamically adjusts the needed number of processors for the execution of the parallel code portions based on the current system load in the given job. This method allocates as many available processors as possible, and does not save any processors for the parallel sections of other later-arriving applications. To solve this problem, in this paper, we propose a new processor allocation technique called FPA(Fuzzy Processor Allocation) that dynamically adjusts the number of processors by fuzzifYing the amounts ofueeded number of processors, loads, and estimated execution times of job. The proposed method provides the maximum possibility of the parallism of each job without system overload. We compare the performances of our approaches with the conventional results. The experiments show that the proposed method provides a better performance.

• Journal of The Korean Association of Information Education
• /
• v.25 no.4
• /
• pp.633-640
• /
• 2021

Education related issues are social problems in which various groups and situations are intricately linked to each other. It is difficult to find issues by analyzing social phenomena related to education. Korean based text analysis can be analyzed in a quantitative. With the development of text analysis techniques, research results have been recently achieved, and it can be fully utilized to derive educational issues from text data in Korean. In this study, petition articles in the field of childcare/education were collected on the online-board of the Blue House National Petition website, and text analysis was used to derive issues in the education world. The analysis derived 6 topics through Latent Dirichlet Allocation(LDA) among topic modeling techniques. The association rules of major keywords were analyzed and visualized as graphs. In addition to deriving educational issues through the existing questionnaire, it can provide implications for future research directions and policies in that issues can be sufficiently discovered through text-based analysis methods.

• Journal of Navigation and Port Research
• /
• v.30 no.3 s.109
• /
• pp.235-240
• /
• 2006

This study analyzed equipment operation strategy of ATC(Automated Transfer Crane) in order to development efficiency ATC operation logic for apply to domestic ACT(Automated Container Terminal). Improving productivity of ACT developed dynamic operation logic and established dispatching rule. As a result of simulation experiment reduced waiting time and interference time of ATC. Thus, we can improve productivity of ACT using dynamic operation logic and interference avoidance strategy.