http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
미곡 종합처리장 건조공정의 에니메이션화 시뮬레이션 모델
이준배(Jun Vae Lee) 한국농업경제학회 2001 農業經濟硏究 Vol.42 No.1
Although the RPC systems of the rice industry are widely operated in the national base, it is only recently that the dry planning and scheduling problem in the production process line encountered in these environments have begun to be addressed using agro-mechanical engineering and operations research techniques. These problems have several features that make them difficult and challenging: random arrival and service rate, complex customers flows, and having the most complicated and capital-intensive manufacturing systems. Hence their solution will contribute considerably to the theory and practice of operation planning and control in rice drying process of RPC systems. This study has described a methodology and an empirical analysis for the evaluation of the effect on different alternative schemes in a RPC factory. These manufacturing operations can be represented as a highly structured tandem queueing system. This tandem queueing model has been implemented as a discrete event simulation by using a ARENA. Displaying customers and inventories in the system on the screen provide a symbol of the dynamic behavior of a drying process.
농기계의 적정 예비품 보유를 위한 마코브 재고관리모델 분석 - 콤바인 기종을 대상으로 -
이준배(Jun Vae Lee),우장명(Jang Myeong Woo) 한국농업경제학회 2001 農業經濟硏究 Vol.42 No.3
The problem that we address is to determine the inventory stockage in a system which consists of n different subsystems in series(1-out-of-n: F). When a unit fails, it is required the replacement of spare units to keep the system availability high. The model is developed for an i-subsystem group has m operating i-units and has Ui spare units. The i.i.d. systems have a pool of spare units. With the Markov transitional probability of the i-subsystem, the steady-state system availability is calculated. The model formulates the problem of optimally allocating the spare units during each operating-cycle period, which maximizes the system availability constrained by the total inventory cost. The model is defined as the nonlinear integer prograrmming(NLIP) problem. The solution of this NLIP can be solved by the generalized reduced-gradient and branch-and-bound algorithms.