• East Asian mathematical journal
• /
• 제24권1호
• /
• pp.45-55
• /
• 2008

We consider an M/G/1 queue with $P^M_{\lambda}$-service policy, which is a two-stage service policy. The server starts to serve with rate 1 if a job arrives to the sever in idle state. If the workload of the system upcrosses $\lambda$, then the service rate is changed to M and this rate continues until the system is empty. It costs to change the service rate to M and maintaining the rate. When the expectation of the stationary workload is supposed to be less than a given value, we derive the optimal value of M.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2010년도 추계학술대회
• /
• pp.188-191
• /
• 2010

The study investigated the optimal configuration of SVC (Scalable Video Coding) to apply to the satellite broadcasting service, and compared the performance of the SVC with that of the AVC (Advanced Video Coding). To get the optimal configuration, we analyzed the optimal bit rate allocation between the layers and the optimal scalability which requires the least bit rate for the required PSNR for various kinds of contents using JSVM. As a result of investigation, we found that the optimal bit rate allocation occurs when the bit rate of the base layer is minimum, and the spatial scalability shows the best performance. The performance of SVC is similar to that of AVC for spatial scalability, but it depends on contents.

• 한국시뮬레이션학회논문지
• /
• 제13권1호
• /
• pp.41-50
• /
• 2004

The purpose of this paper is to analyse the manager's policy to maximize the profit in a multiple-server queueing facility with a limited queue capacity. We assume that the level of advertizing effects on the arrival rate of customers to the facility. The model without ‘word of mouth effect’ is assumed that the arrival rate is independent on the qualify of service level. We estimate the service quality by the balking rate of customers from system. We extend this to the model with ‘word of mouth effect’. To achieve the maximum profit, the most important factor is the considerably high utilization of facility for both models. Given service rate, we should maintain an effective arrival rate to some extent. To this end, among the available options, an increase of advertizing effort is more desirable than reducing the fee if the service value of customers remains unchanged. We also investigate whether the variability of service time has a significant impact on determining the optimal policy. The cost of service variability is not so expensive as that in a single server model due to the reduced variability of service times in a multiple-server model.

• 한국항만경제학회지
• /
• 제32권2호
• /
• pp.137-156
• /
• 2016

본 연구 목적은 컨테이너 전용부두의 최적 서비스 수준, 즉 선석 수에 따른 최적의 선석점유율과 선박 대기율을 분석하는 것이다. 연구는 국내 대표항만인 부산신항 P부두의 최근 3년간의 선박 접안 실적 자료를 토대로 시뮬레이션 모델을 개발 및 적용하여 선석 수를 달리하면서 시뮬레이션에서 얻은 결과를 활용하였다. 이 결과와 P항만의 최근 3년간의 재무 자료와 체선 체화에 따른 비용 등을 터미널운영사(TOC), 선사 및 화주의 입장에서 경제성을 분석하여 순이익이 최고인 선석점유율과 선박대기율을 최적 서비스 수준으로 도출하였다. 연구 결과, 컨테이너 부두 4선석은 선석점유율 63.4%와 선박대기율 10.6%에서, 5선석은 선석점유율 66.0%와 선박대기율 9.6%에서, 6선석은 선석점유율 69.0%와 선박대기율 8.5%에서 최적 서비스 수준으로 분석되었다. 반면 해양수산부의 2013년 연구 결과에서는 4선석에서 선석점유율 57.1%와 선박대기율 7.4%에서, 5선석에서는 선석점유율 63.4%와 선박대기율 6.6%에서, 6선석은 선석점유율 66.6%와 선박대기율 5.6%에서 최적 서비스 수준을 분석하였다. 결과적으로, 최적 서비스 수준은 분석 시점에 따라 달라질 수 있음을 알 수 있었다. 즉, 최적 서비스 수준을 산정함에 있어서 영향을 주는 요인으로는 환율, TEU당 수입 및 비용, TEU당 재고유지비, 유가 등으로 최적 서비스 수준은 절대적으로 확정되는 것도 아님을 알 수 있었다. 따라서, 컨테이너 항만의 최적 서비스 수준은 경기의 변동, 유가, 환율 등의 여러 요인에 따라 달라질 수 있으므로 항시 이러한 변동 요인을 빠르게 반영하여 고려할 필요가 있음을 알 수 있다.

• 산업경영시스템학회지
• /
• 제6권8호
• /
• pp.93-103
• /
• 1983

In this paper, we study an optimal service policy of the M/M/2/K queueing system with two types of customers. The incurred costs consist of waiting cost, service cost and incurred costs consist of waiting cost, service cut and changeover cost. The changeover cost occurs when a server who assigned to serve a particular type of customers reassigned to the other types of customers. Two servers serve two types of customers who arrive to the two separate queues. The two types of customers differ in respect of their arrival rate, service rate, waiting cost, and service cost. The servers require a policy, for determining when they should change their service type, which minimizes the long run expected total cost. The policy is obtained by a Markov decision process model that consists of a finite number of states and actions. In order to find the optimal service policy, we define states and actions of the system, compute onestep transition probabilities, and apply to the successive approximations algorithm.

• 한국통신학회논문지
• /
• 제29권5A호
• /
• pp.574-582
• /
• 2004

본 논문에서는 패킷 데이터 서비스를 지원하는 DS/CDMA 시스템에서 역방향 링크의 대기 패킷 버스트들이 겪는 평균 전송 시간을 최소화하기 위한 여러 가지 패킷 스캐줄링 방식을 비교 분석하였다. 모든 활성화된 데이터 사용자들이 동시에 전송을 하는 경우의 최적의 스케줄링 방식에 대하여 논하고 기존의 여러 가지 다른 전송률 스케줄링 방식들과의 수학적인 비교 분석을 통하여 평균 전송 지연을 고려한 전송률 스케줄링 방식의 효율적인 지표를 제시하였다.

• 한국경영과학회지
• /
• 제4권1호
• /
• pp.51-67
• /
• 1979

This paper considers the problem of determining an optimal dynamic operating policy for a two-stage tandem queueing service system in which the service facilities (or stages) can be operated at more than one service rate. At each period of the system's operation, the system manager must specify which of the available service rates is to be employed at each stage. The cost structure includes an operating cost for running each stage and a service facility profit earned when a service completion occurs at Stage 2. We assume that the system has a finite waiting capacity in front of each station and each customer requires two services which must be done in sequence, that is, customers must pass through Stage 1 and Stage 2 in that order. Processing must be in the order of arrival at each station. The objective is to minimize the total discounted expected cost in a two-stage tandem queueing service system, which we formulate as a Discrete-Time Markov Decision Process. We present analytical and numerical results that specify the form of the optimal dynamic operating policy for a two-stage tandem queueing service system.

• 한국동물위생학회지
• /
• 제15권1호
• /
• pp.1-6
• /
• 1992

A survey on the dosage optimal time for the bovine fascioliasis was carried out from Jan. 1987 to Dec. 1990. The results were summarized as follows ; 1. The mean infection rate was 27.7% (1,662 heads were infected out of 3,247 heads In 205 herds). A seasonal infection rate was winter (34.6%) >spring(32.5%) >summer(24.7%) > autumn(22.8%) 2. In the density of the fasciola spp. egg of infected bovine feces remarks 79.6% on the range below 10. 3. The density of fasciola spp. egg is not directly proportinal to the infection rate, and remarks on the range from 5 to 20. 4. In the herds dosed vermifuge the appearance of the fasciola spp. egg is as follows ; 1∼3 months show 3.8% and 4∼6 months 8.5% 5. The dosage optimal time for the bovine fasciliasis is as follows ; 1) According to the monthly infection rate the first dosage optimal time is Dec and Feb and the second-Jun and Aug. 2) In the herd dosed vermifuge the dosage optimal time is to dose twice by 60 days interval after 3∼4 months from previous dosage.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2003년도 추계 학술발표회 논문집
• /
• pp.189-194
• /
• 2003

We consider an M/G/1 queueing system under P$_{\lambda}^{M}$-service policy. As soon as the workload exceeds threshold ${\lambda}$ > 0, the service rate is increased from 1 to M ${\geq}$ 1 and is kept until the system becomes empty. After assigning several costs, we show that there exists a unique M minimizing the long-run average cost per unit time.

• 보건행정학회지
• /
• 제11권4호
• /
• pp.88-108
• /
• 2001

Separation of prescribing and dispensing practice in Korea has changed the service pattern of the pharmacy. The prescription dispensing activities, however, are concentrated excessively on the pharmacies near hospitals or clinics. Thus this study was conducted to estimate the number of optimal dispensing cases for the community pharmacy. Forty-six pharmacies were selected using systematic stratified random sampling method, and ninety-five pharmacists were interviewed on their workload of dispensing and other activities at pharmacies. One hundred and seventy prescriptions were chosen based on the length of drug administration and drug dosage form, and the dispensing time was measured by time-watch method. Also pharmacy benefit claims data were analyzed to identify the characteristics of the pharmacies which performed more than optimal dispensing cases. According to the study results, the average work time per pharmacist per day was found to be 10hours 32minutes and the dispensing activities occupied 7hours 36minutes. It took 5.72minutes on average for each dispensing case. The optimal dispensing case was estimated as 75 cases under the condition of 10hours 32minutes work time and 6% allowance rate. Even though the pharmacies near hospitals or clinics participated dispensing services actively, only pharmacies near clinics dealt with more than optimal dispensing cases. For the pharmacies near hospitals they dealt with less than optimal cases, but drug administration period per prescription was almost 3 times longer than that of pharmacies near clinics. Thus the intensity of dispensing activities such as drug administration period is to be considered to estimate optimal dispensing cases more accurately.