• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.1-12
• /
• 2016

In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

• Journal of Astronomy and Space Sciences
• /
• v.12 no.2
• /
• pp.179-195
• /
• 1995

RT Per has been known as a close binary of which the orbital period has unpredictably varied so far. Although there are no agreements with the working mechanism for the changes of the period, two interpretations have been suggested and waiting for to be tested: 1) light-time effects due to the unseen 3rd and 4rd bodies (Panchatsaram 1981), 2) Abrupt period-changes, due to internal variations of the system (e.g. mass transfer or mass loss) superimposing to the light-time effect by a 3rd body (Frieboes-Conde & Herczeg 1973). In the point of view that the former interprepation models could predict the behavior of the changes of the orbital period theoretically, we checked whether the recent observed times of minimum lights follow the perdictions by the first model or not. We confirmed that the observed times of minimum lights have followed the variations calculated by the light-times effects due to the 3rd and 4rd bodies suggested by Panchatsatam. In this paper a total of 626 times of minimum lights were reanalyzed in terms of the light-time effects by the 3rd and 4rd bodies. We concluded that the eclipsing pair in SVCam system moves in an elliptic orbit about center of mass of the triple system with a period of about $42.^y2$, while the mass center of the triplet is in light-time orbit about the center of mass of the quadruple system with a period of $120^y$. The mean masses deduced for the 3rd and 4rd bodies were $0.89m_\odot$ and $0.82m_\odot$, respectively.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.34-40
• /
• 2018

In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.33 no.2
• /
• pp.171-187
• /
• 2023

Objectives: Aircraft cabin cleaning work is characterized by being performed within a limited time in a narrow and enclosed space. The objective of this study was to evaluate the exposure levels to dust, ultra fine dust(PM2.5) and black carbon(BC) among aircraft cabin cleaners. Methods: Active personal air sampling for respirable dust(n=73) and BC(n=47) was conducted during quick transit cleaning(cabin general and vacuum-specific) and seat cover replacement and total dust and PM2.5 were area-air-sampled as well. Also, size distribution of particle was identified with the cleaning workers targeted. Dusts were collected with PVC filters using gravimetric analysis. The concentration of PM2.5 and the particle size distribution were measured with real-time direct reading portable equipment using light scattering analysis. The concentration of BC was measured by aethalometer(filter-based real-time light absorption analysis instrument). Results: The geometric mean of respirable dust was the highest at vacuum cleaning as 74.4 ㎍/m³, following by replacing seat covers as 49.3 ㎍/m³ and cabin general cleaning as 47.8 ㎍/m³ . The arithmetic mean of PM2.5 was 4.83 ~ 9.89 ㎍/m³ inside the cabin, and 28.5~44.5 ㎍/m³ outside the cabin(from bus and outdoor waiting space). From size distribution, PM_2.5/PM₁₀ ratio was 0.54 at quick transit cleaning and 0.41 at replacing seat covers. The average concentration of BC was 2~7 ㎍/m³, showing a high correlation with the PM2.5 concentration. Conclusions: The hazards concentration levels of aircraft cabin cleaners were very similar to those of roadside outdoor workers. As the main source of pollution is estimated to be diesel vehicles operating at airports, and it is necessary to replace older vehicles, strengthen pollutant emission control regulations, and introduce electric vehicles. In addition, it is necessary to provide as part of airport-inftastructure a stable standby waiting space for aircraft cabin cleaners and introduce a systematic safety and health management system for all workers in the aviation industry.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.381-390
• /
• 2002

We analyze the performance of a telecommunications management network (TMN) system using models of networks of queues, Jackson's theorem, and simulation. TMN systems for managing public asynchronous transfer mode (ATM) networks generally have a four-level hierarchical structure consisting of a network management system, a few element management systems (EMSs), and several pairs of agents and ATM switches. We construct a Jackson's queuing network and present formulae to calculate its performance measures: distributions of queue lengths and waiting times, mean message response time, and maximum throughput. We perform a numerical analysis and a simulation analysis and compare the results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.81-87
• /
• 2000

As for M/G/1 queueing system, we use various control policies, with which we can optimize the system. Up to now the most widely adopted policies are N-Policy, T-Policy, D-Policy, and so on. The existing researches are largely concerned to find an optimal operation condition or to optimize the system under single policy in M/G/1 system. There are, however, few literatures dealing with multiple control policies at once to enhance the flexibility of the model. In this study, we consider M/G/1 system adopting N-Policy and T-Policy simultaneously. If one of two conditions is satisfied, then, the server starts the service. We call this Min(N,T)-Policy. We find the probability distribution of the number of customers and mean waiting time in steady state and derive a cost function. Next, we seek the $N^*$, optimal threshold under various N values. Finally, we reveal the characteristics of cost function.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.37 no.2
• /
• pp.31-43
• /
• 2012

Delivery of a good quality of service in an efficient manner requires matching the supply of capacity with customer demand. Much research has employed queueing models that analyzed the service system on the basis of independent and stationary customer arrivals. However, the appointment system, which is widely used to facilitate customer access to service in many industries including healthcare, has significant influence on the customer arrival process so that the independent and stationary assumption does not hold in an appointment-based service system. In this regard, this paper aims to propose a model for accurate illustration of the appointment-based customer arrival process. The use of the proposed model allows us to evaluate the overall system performance such as mean waiting time and service level under various appointment policies instead of conducting simulation studies.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.153-168
• /
• 1998

In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished Products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be backordered. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the proportion of backordered demands, the average number of backordered demands and the mean waiting time of a backordered demand. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. A matrix geometric method is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method were compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.2
• /
• pp.103-113
• /
• 2013

We analyze the queueing model for leaky bucket (LB) scheme with dynamic arrivals and token rates. In other words, in our LB scheme the arrivals and token rates are changed according to the buffer occupancy. In telecommunication networks, the LB scheme has been used as a policing function to prevent congestion. By considering bursty and correlated properties of input traffic, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the distribution of system state, and obtain the loss probability and the mean waiting time. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effect of our proposed model.

• Journal of Korean Society for Quality Management
• /
• v.27 no.2
• /
• pp.251-262
• /
• 1999

In the automated manufacturing systems, the problem regarding how to make production activities flexible is even more important and critical than that regarding how to product large quantities, and the more flexible, if possible, the manufacturing system is, the more competitiveness and profitable factors it gets. This research, therefore, concentrated on establishing the flexibility and evaluating performance on the manufacturing system, operational flexibility is considered because of enabling the manufacturing system to get both the improvement of production rate and the adaptive ability of environment changes. For it, we used the analytical tool, GSPNs, which is a kind of timed Petri-Nets. GSPNs is competent enough to consider practical situations just like operation priorities, machine failure, randomness, concurrency and so on. Through the GSPNs analysis, it is confirmed that in the manufacturing system with operational flexibility is compatible with the traditional performances such as production rate or mean waiting time.