http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
金雲植 大田開放大學 1986 論文集 Vol.5 No.-
This thesis considers the vehicle routing problem of the Korea Development Bank. In the routing problem, where each customer is assigned to a bus stop and each vehicle has a fixed capacity, Fisher & Jailumar's heuristic approach is used.
金雲植 大田開放大學 1987 論文集 Vol.7 No.-
This thesis considers the scheduling problem of the Korea Housing Corporation and the Korea Development Bank. In the scheduling problem where the routes have already been formed ant each route has time window, Swersey & Ballard's method is applied.
M/M/C/C Queueing System 適用에 關한 硏究
金雲植 大田工業專門大學 1983 論文集 Vol.33 No.-
In this thesis We Study 3 M/M/C loss system with k types of customers. In the system, the types of customers are classified by the reguiring number of servers. It is assumed that the type of each customer is decided at the moment of its arrival and the probability of an incoming customer belonging to a particular type is known at the same moment. The purpose of this thesis is a application of loss system.
A Syudy On the Limiting Probability of the Regenerative Process
심동희,김운식 大田工業大學 1990 한밭대학교 논문집 Vol.7 No.1
Stochastic process 의 State Transition Diagram 상의 Regeneration Point 를 이용하여 각 State에 대한 Limiting Probability를 구하는 공식과, 또한 Steady State에서 각 State에의 예상방문횟수를 산출하는 공식을 정립하였다.
전송 대역폭을 효율적으로 분산하는 주문형 비디오 서비스 아키텍처
김운식,김상하 충남대학교 기초과학연구소 1995 忠南科學硏究誌 Vol.22 No.1
The paper explores the VOD architecture which is suitable for supporting a lot of subscribers by distributing the computing and communication requirements for the main video server into those for its subordinate servers. The proposed architecture is a hierarchical tree which is composed of the main server in the root, intermediate servers, and leaf servers directly connected to subscribers. This structure will operate efficiently for VOD system because each leaf server could carry almost all video data requested by its subscribers in the long run. This paper also shows, with some reasonable assumptions, that the proposed architecture may process the subscriber's request faster than the Berkeley system by O(log n / n), where n is the number of subscribers.
2個의 連續工程을 갖는 受注生産下의 最適機械 할당에 關한 硏究
金雲植 大田開放大學 1985 論文集 Vol.3 No.-
This thesis is concerned with an n job, m machine scheduling problem in which all iobs have a common due date. The objective is to determine the optimal machine assignment to minimize a total penalty cost in first process and an optimal sequence to minimize a total Idle time in second process. This penalty cost take place under the changing commodity production in machine. We present a D.P. algorithm and PERT-CPM for the solution of this problem along with the proof of optimality and a numerical example.
限定된 容量을 갖는 多數 供給地로부터의 運送問題에 關한 硏究
金雲植 大田開放大學 1984 論文集 Vol.1 No.-
The thesis is concerned with an optimum or near- optimum routing d a fleet of delivery facility between a central depot and a large number of service stations supplied by the depot. It is desired to find a nay to assign stations to delivery facilities in such a manner that the deterministic demands at station are statisfied and total cost covered by He fleet is minimized. For the purpose of solving this problem, an algorithm based on integer programming is developed. To demonstrate the practicability of algorithm, routes for goods delivery in real situation as a case study is illustrated.