• Title/Summary/Keyword: M/M/1 Queue

Search Result 166, Processing Time 0.023 seconds

The Optimal Base-Stock Level in Assembly lines (조립 생산 시스템에서 최적 Base-Stock 수준)

  • Ko, Sung-Seok;Seo, Dong-Won
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.3
    • /
    • pp.89-93
    • /
    • 2007
  • In this study, we consider an assembly line operated under a base-stock policy. A product consists of two parts, and a finished product transfers to a warehouse in which demands are satisfied. Assume that demands arrive according to a Poisson process and processing times at each production line are exponentially distributed. Whenever a demand arrives, it is satisfied immediately from an inventory in the warehouse if available; otherwise, it is backlogged and satisfied later by the next product exiting from production lines. In either case, an arriving demand automatically triggers the production of a part at both production lines. These two parts will be assembled into a product that eventually transfers to the warehouse. We obtain a closed form formula of approximation for delay time or lead time distribution of a demand when a base- stock level is s. Moreover, it can be applied to the optimal base-stock level which minimizes the total inventory cost. Numerical examples are presented to show our optimal base-stock level's quality.

Stochastic Traffic Congestion Evaluation of Korean Highway Traffic Information System with Structural Changes

  • Lee, Yongwoong;Jeon, Saebom;Park, Yousung
    • Asia pacific journal of information systems
    • /
    • v.26 no.3
    • /
    • pp.427-448
    • /
    • 2016
  • The stochastic phenomena of traffic network condition, such as traffic speed and density, are affected not only by exogenous traffic control but also by endogenous changes in service time during congestion. In this paper, we propose a mixed M/G/1 queuing model by introducing a condition-varying parameter of traffic congestion to reflect structural changes in the traffic network. We also develop congestion indices to evaluate network efficiency in terms of traffic flow and economic cost in traffic operating system using structure-changing queuing model, and perform scenario analysis according to various traffic network improvement policies. Empirical analysis using Korean highway traffic operating system shows that our suggested model better captures structural changes in the traffic queue. The scenario analysis also shows that occasional reversible lane operation during peak times can be more efficient and feasible than regular lane extension in Korea.

Reliability Analysis of Multi-Component System Considering Preventive Maintenance: Application of Markov Chain Model (예방정비를 고려한 복수 부품 시스템의 신뢰성 분석: 마코프 체인 모형의 응용)

  • Kim, Hun Gil;Kim, Woo-Sung
    • Journal of Applied Reliability
    • /
    • v.16 no.4
    • /
    • pp.313-322
    • /
    • 2016
  • Purpose: We introduce ways to employ Markov chain model to evaluate the effect of preventive maintenance process. While the preventive maintenance process decreases the failure rate of each subsystems, it increases the downtime of the system because the system can not work during the maintenance process. The goal of this paper is to introduce ways to analyze this trade-off. Methods: Markov chain models are employed. We derive the availability of the system consisting of N repairable subsystems by the methods under various maintenance policies. Results: To validate our methods, we apply our models to the real maintenance data reports of military truck. The error between the model and the data was about 1%. Conclusion: The models developed in this paper fit real data well. These techniques can be applied to calculate the availability under various preventive maintenance policies.

How to Reinvent Network Services for All (상이한 네트워크 서비스 어떻게 향상시킬까?)

  • Kim, Yong-J.;Lee, Seo-Jun;Lim, Jay-Ick
    • Korean Management Science Review
    • /
    • v.25 no.3
    • /
    • pp.87-99
    • /
    • 2008
  • Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

The Analysis of an Opportunistic Spectrum Access with a Strict T-preemptive Priority Discipline (엄격한 T-축출 우선순위 대기행렬을 이용한 기회 주파수 접근 방식의 성능 분석)

  • Kim, Kilhwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.4
    • /
    • pp.162-170
    • /
    • 2012
  • We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

Protocol Implementations for Web Based Control Systems

  • Shoo Sugoog
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.1
    • /
    • pp.122-129
    • /
    • 2005
  • We describe the MiniWeb[7] TCP/IP stack (mIP), which is an extremely small implementation of the TCP/IP protocol suite running 8 or 32-bit micro controllers intended for embedded control systems, and satisfying the subset of RFC1122 requirements needed for host­to-host interoperability over different platforms. Our TCP/IP implementation does sacrifice some of TCP's mechanisms such as fragmentation, urgent data, retransmission, or congestion control. Our implementation is applicable to web based controllers. The network protocols are tested in operational networks using CommView and Dummynet where the various operational parameters such as bandwidth, delay, and queue sizes can be set and controlled.

Estimation of the Expected Time in System of Trip-Based Material Handling Systems (트립에 기초한 물자취급 시스템에서 자재의 평균 체류시간에 대한 추정)

  • Cho, Myeon-Sig
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.2
    • /
    • pp.167-181
    • /
    • 1995
  • We develop an analytical model to estimate the time a workpiece spends in both input and output queues in trip-based material handling systems. The waiting times in the input queues are approximated by M/G/1 queueing system and the waiting times in the output queues are estimated using the method discussed in Bozer, Cho, and Srinivasan [2]. The analytical results are tested via simulation experiment. The result indicates that the analytical model estimates the expected waiting times in both the input and output queues fairly accurately. Furthermore, we observe that a workpiece spends more time waiting for a processor than waiting for a device even if the processors and the devices are equally utilized. It is also noted that the expected waiting time in the output queue with fewer faster devices is shorter than that obtained with multiple slower devices.

  • PDF

Performance Analysis of Threshold-based Bernoulli Priority Jump Traffic Control Scheme (동적우선권제어함수 기반 TBPJ 트래픽 제어방식의 성능분석)

  • Kim, Do-Kyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.11S
    • /
    • pp.3684-3693
    • /
    • 2000
  • In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

  • PDF

A Study on the Improvement of the Multichannel Sea Surface Temperature(MCSST) Software for Mini-Computer System (소/중형 컴퓨터를 위한 MCSST 소프트웨어 개선에 관한 연구)

  • 심태보;장덕홍
    • Korean Journal of Remote Sensing
    • /
    • v.5 no.1
    • /
    • pp.41-56
    • /
    • 1989
  • Improvement of the multichannel sea surface temperature(MCSST) software, which had been developed for the purpose of operating under mainframe computer system, was seeked in order to operate effectively in a mini computer system. CPU time and processing time, which is not a major factor under mainframe computer system, become a critical factor in real time image processing under mini computer system. Due to fixed kernel size(3$\times$4) of the old MCSST software, high spatial resolution characteristics of the original image received from satellites were apparently degraded when images are transformed into a cartesian coordinate system after geometrical distortions of the image due to earth curvature are removed. CPU and processing time were reduced to 0.13 and 0.15~0.22 comparing with the old MCSST's, respectively, by applying disk block I/O and M/T queue I/O method under VAX-11/750 computer. The high resolution quality (1.1km in AVHRR) of the processed image was guaranted using 2$\times$2 kernel size and applying moving window techniques without sacrificing CPU and processing time much.

A Basic Investigation on the Characteristics of Traffic Flow for the Capacity Analysis of Signalized Intersections (교차로 용량분석을 위한 교통류 특성 기초조사)

  • 이승환
    • Journal of Korean Society of Transportation
    • /
    • v.7 no.2
    • /
    • pp.89-111
    • /
    • 1989
  • This study concentrates on a basic investigation research related to some of parameters to be used for the analysis of capacity and the level of service for signalized intersections. The parameters to be studied are ideal saturation flow rate, large vehicle's passenger car equivalent(PCE) ane the lane utilization factors of through and left turn vehicles. The field data were collected at six intersections in Seoul using video cameras so as to reflect conditions in urban areas. In this study discharge headway based on a rear bumper of each vehicle was used and all the parameters were estimated using a regression technique. The findings of this research are as follows : 1. The saturation headway and saturation flow rate on a single lane with the lane width of 3.1m are 1.652 seconds and 2,180 pcphgpl. It was found that the frist 5 vehicles in the queue experience some start-up lost time. 2. It was confirmed that the new method adopted for the estimate of large vehicle's PCE gives larger PCE values than those derived from the method commonly used. 3. For the estimate of lane utilization factors of through and left turn vehicles, a relationship was established and the corresponding formulas were developed.

  • PDF