http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
권수태,정소영,윤상흠,김호준 전주대학교 공학기술종합연구소 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.
권수태,송미현 전주대학교 공학기술종합연구소 2002 전주대학교 공학기술종합연구소 학술논문집 Vol.8 No.1
The world on the verge of entering a new milennium, is experiencing a major transition from an industrial society into a "knowledge and informatization based society". The government policy of converting schools into educational institutes equipped with computer networks and programs focuses for the informatization in the field of education as one of the national informatization. In the other hand, school drop-outs are considered as one of big problems at schools. These teenagers tend to commit crimes and become even a social problem Therefore, it is necessary for the Ministry of Education to enforce the application of those to the educational performance for provision of user-centered services. Data mining, which is a new information technology which processes lots of data and derive meaningful information from them, is applied to the case analysis of high school drop-outs for the first time in this paper. That is, a model is created predicting how many students will drop out of high school by using the analysis such as logistic, decision tree, and neural network Also, a foundation is laid being able to counsel students about quitting school, and a concrete case is provided on how the data mining can be used for the informatization in the field of education.
On the Analysis of Intergrated Prosuction and Transportation Planning in a Supply Chain
권수태,엄용호 한국SCM학회 2006 한국SCM학회지 Vol.6 No.1
This paper considers an integrated production and transportation planning problem for a single-product, single-vendor, multi-buyer and multi-period in supply chain. Some interesting properties are derived that are useful for characterizing optimal transportation planning. By using the properties, a genetic algorithm is developed to solve the integrated production and transportation planning problem. A numerical example is presented and tested to show the effectiveness of the algorithm.
권수태,엄용호 전주대학교 공학기술종합연구소 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.- No.1(1)
Supply chain is the link that moves products between suppliers, manufactures, wholesalers, distribution, retailers and ended consumers. Supply chain management(SCM) is a way to supervise the flow of products, materials and information as they move along the supply chain. In the recent years, Most of the companies are in a hurry the introduction of SCM to obtain international competitiveness. The goal of SCM is to optimize the supply chain, which can not only reduce inventories, but may also create a higher profit margin for finished goods by giving customers exactly what they want. There are four major decision areas (location, production, inventory, transportation) in supply chain management, and there are both strategic and operational elements in each of these decision areas. 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 presented to solve the problem.
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) 와 같은 다양한 저장공간 공유방안들을 비교ㆍ분석하는 것으로, 이를 위하여 먼저 각각의 공유방안에서의 대기행렬 안정상태확률을 효율적으로 구할 수 있는 방법이 제시되었다. 다음으로 각각의 저장공간 공유방안을 특징짓는데 필요한 몇 가지 성질들이 규명되었으며, 이를 토대로 각각의 저장공간 공유방안에 대하여 시스템 성능척도인 생산률들을 도출하는 한편, 이들의 대소관계를 파악하고, 수치실험을 통하여 이를 입증하였다.
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.
Kwon, Sootae 전주대학교 공학기술종합연구소 1998 전주대학교 공학기술종합연구소 학술논문집 Vol.4 No.2
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 AGVs are used for input and output material handling. Some interesting properties are derived 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.