http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Study on the Comparison of Storage Sharing Schemes in Queueing System with Finite Capacity Buffer
권수태(Soo-Tae Kwon) 한국산업경영시스템학회 2004 한국산업경영시스템학회지 Vol.27 No.4
본 논문의 목적은 유한 저장공간을 가지는 대기행렬 시스템에서 완전공유 (Complete Sharing), 완전분할 (Complete Partitioning), 최소할당공유 (Sharing with Minimum Allocation) 와 같은 다양한 저장공간 공유방안들을 비교ㆍ분석하는 것으로, 이를 위하여 먼저 각각의 공유방안에서의 대기행렬 안정상태확률을 효율적으로 구할 수 있는 방법이 제시되었다. 다음으로 각각의 저장공간 공유방안을 특징짓는데 필요한 몇 가지 성질들이 규명되었으며, 이를 토대로 각각의 저장공간 공유방안에 대하여 시스템 성능척도인 생산률들을 도출하는 한편, 이들의 대소관계를 파악하고, 수치실험을 통하여 이를 입증하였다.
정소영(So Young Chung),권수태(Soo Tae Kwon) 한국산업경영시스템학회 2008 한국산업경영시스템학회지 Vol.31 No.2
A process mining is considered to support the discovery of business process for unstructured process model, and a process mining algorithm by using the associated rule and sequence pattern of data mining is developed to extract information about processes from event-log, and to discover process of alternative, concurrent and hidden activities. Some numerical examples are presented to show the effectiveness and efficiency of the algorithm.
정소영(Chung So Young),권수태(Kwon Soo Tae) 한국산업경영시스템학회 2008 한국산업경영시스템학회 학술대회 Vol.2008 No.하계
A process mining is considered to support the discovery of business process for unstructured process model, and a process mining algorithm by using the associated rule, sequence pattern of data mining and a characteristic of loopback process is developed to extract information about processes from event-log, and to discover process of alternative, concurrent, hidden and loopback activities. Some numerical examples are presented to show the effectiveness of the algorithm.
윤상흠(Sang-Hum Yoon),김호준(Ho-Joon Kim),권수태(Soo-Tae Kwon) 한국산업경영시스템학회 2004 한국산업경영시스템학회지 Vol.27 No.2
This paper considers a scheduling problem concerned with an assembly system where two components are first treated in their own parallel machines and then pulled to be assembled into a final product at a single assembly machine. The objective measure is the mean completion time of jobs(a finite number of products). Through characterizing solution properties, we obtain the worst case error bounds of an arbitrary permutation and a SPT based heuristic.
Optimal Allocation of Buffer Space in a Flexible Manufacturing System
Kwon, Soo Tae 전주대학교 공학기술종합연구소 1999 전주대학교 공학기술종합연구소 학술논문집 Vol.5 No.-
This paper considers a buffer allocation problem of flexible manufacturing system composed of several parallel workstations each with both limited input and output buffers, where machine blocking is allowed and a single automated guided vehicle (AGV) is used for handling input and output materials. Some interesting properties are drived that are useful for characterizing optimal allocation of buffer spaces for the given performance evaluation model. By using the properties, a solution algorithm is exploited to solve the optimal buffer allocation problem. A variety of differently-sized decision parameters are numerically tested to show the efficiency of the algorithm.
An Analysis of Finite Capacity Queues with Common or Reserved Waiting Areas
Kwon, Soo Tae 전주대학교 공학기술종합연구소 1999 전주대학교 공학기술종합연구소 학술논문집 Vol.5 No.-
The purpose of this paper is to analyze and compare storage sharing schemes which are complete sharing (CS), complete patitioning (CP), and sharing with minimum allocation (SMA). An efficient method for computing the steady state probabilities of a finite capacity queue with exponential service is exploited. By using the results, the system performance measures (throughput, queue lengths) are obtained for the storage sharing schemes. Some interesting properties are derived that are useful for characterizing the storage sharing schemes, and then numerical results are presented. These results can be of significant practical use in the design and control of related system.
권수태,엄용호 전주대학교 공학기술종합연구소 2003 전주대학교 공학기술종합연구소 학술논문집 Vol.9 No.1
Recently, many company endeavor to gain competitive advantage so as quickly to satisfy customer demand and effectively reduce operating costs. An approach is to integrate supply chain which is the link that moves products between suppliers, manufactures, wholesalers, distributions, retailers and ended consumers. This paper is concerned with the integrated production planning problem including not only the production cost but also the transportation cost in supply chains, and an efficient algorithm using genetic algorithm and quickest path method is exploited to solve the problem.
권수태,정소영,윤상흠,김호준 전주대학교 공학기술종합연구소 2003 전주대학교 공학기술종합연구소 학술논문집 Vol.9 No.1
The paper considers a cell allocation problem in the Mobile Wireless Communication Network with limited capacity of Base Switching Center(BSC) and Mobile Switching Center(MSC), and the aim is assigning cells to BSC and MSC for supporting an efficient handoff and reducing the cabling cost. The cell assignment problem is formulated as a mixed integer programming, and a genetic algorithm is developed to derive the optimal solution. A verity of numerical problems are presented and then some interesting properties are exploited that are useful for charactering the problem.