Stochastic Modeling and Analysis of Generalized Kanban Controlled Unsaturated finite capacitated Multi-Stage Production System
|
|
- Homer Parker
- 6 years ago
- Views:
Transcription
1 Stochastic Modeling and Analysis of Generalized anban Controlled Unsaturated finite capacitated Multi-Stage Production System Mitnala Sreenivasa Rao 1 orada Viswanatha Sharma 2 1 Department of Mechanical Engineering JNTU College of Engineering, Hyderabad, India 2 Centre for Energy Studies, JNTU College of Engineering, Hyderabad, India Abstract In recent years, variants of anban mechanisms are proposed to deal with different levels of uncertainties commonly exist in a typical production system. Among them, generalized anban control (Buzacott [1989]) mechanism gained popularity as it is able to deal with uncertainties effectively while maintaining pull philosophy. In literature, many models are developed to gain insights on the design of generalized anban control mechanism however they were developed under the assumption that external demand for finished products of a production system in its control is very large, nown as saturated condition. In the present globalization of maret, most of the products face finite rate of demand, nown as unsaturated condition and stochastic. In the present paper, Generalized anban Control unsaturated finite capacitated Multi-Stage Production of serial type (GCMP) system has been considered with uncertainties in external demand and processing times. A model of decomposition Continuous Time Marov Chain (CTMC) type is developed for analyzing the considered system for the performance measures, namely, fill rate, average inventory and throughput. The model is then validated with stochastic discrete event simulation model at 95 % confidence level. Insights on the issues relevant to deployment of safety stocs, such that specified fill rate is achieved with minimum average inventory, have been presented. It is found analytical results are in close agreement with simulation results and uniform increasing
2 anban allocation pattern is dominant over uniform allocation pattern for the specified criteria. (eywords: Multi-Stage Production System-Unsaturated finite capacitated-uncertainties- Decomposition based CTMC-various performance measures-validation- Discrete Stochastic Discrete event Simulation model at 95% C.F- Location & Sizing of buffer stocs) 1. Introduction The typical production systems are of multi-stage type, as most of the products require multiple operations. Among various mechanisms for controlling inventories in multi-stage production systems, pull mechanisms gained importance in recent years due to reason that Toyota manufacturing system and Hard Davidson Company could decrease inventories to minimum through implementation of them in their concerns. In pull mechanism, production is initiated at each stage of multi-stage production system as reaction to present demand of its downstream stage. Pull mechanisms are commonly implemented using anbans and hence they are alternatively nown as anban systems. anban is a Japanese word for a card or ticet, which is used as a manual information system. In reality, various sources of uncertainties, viz external demand uncertainty, processing times variations, yield uncertainty, worers absenteeism etc., do exist in any typical production system and anban systems are not exception to this, Often safety stocs are used to alleviate the ill effects of uncertainties. As per the philosophy of anban systems, uncertainties would be reduced rather than deployment of safety stocs however they are used as long as uncertainties exist. If safety stocs are used in multi-stage production as a buffer against uncertainties, their location and sizing are the related issues as deployment of safety stocs at
3 certain locations result more effective buffering than at other location. Further, larger the safety stocs higher the buffer against the uncertainties but at a cost of increased inventory of the system and longer flow times. In anban systems, inventories are clearly controlled and by addition or removal of anban from the system inventory in the system can be increased or decreased. Therefore, the problem of deployment of safety stocs in anban controlled production systems when uncertainties exist is equivalently treated as a problem of determining of number of anbans at each stage of the system such that specified level of performance is achieved with minimum inventory. It is noted that traditional anban systems cannot perform even with deployment of safety stocs when the level of uncertainties is high. For meeting high fluctuations while maintaining pull control, Generalized anban Controlled Production (GCP) system is devised (due to Buzacott [1989]). As compared to traditional anban controlled systems, in GCP system information about consumption of product by an external demand reaches the most upstream stage is fast and consequently a raw part enters into the system as a substitute for the consumed product. GCP systems can be operated either saturated or unsaturated conditions. In saturated condition, finished products have heavy external demand and essentially finished products are consumed as soon as they are available in the output buffer. On the other hand, in unsaturated condition, finished products face finite rate of demand however it can be stochastic and wait in the buffer for arrival of an external demand. It can be noted that in the present global competitive maret, most of products have finite rate of demand essentially unsaturated production environment prevails. Buzacott [1980] compared GCP system with MRP system and found that lie push systems former system faces uncertainties while maintaining the pull concept i.e., by effectively controlling inventories. Due to this, many
4 researchers have shown lot of interest in modelling various issues relevant to GCP system in recent years. 2. Review of literature Mitra & Mitrani [1990] considered saturated GCP system of serial type with processing times variations as sources of uncertainty and developed decomposition type evaluation model for the considered system. Later Mitra & Mitrani [1991] extended their model for considering stochastic demand case (unsaturated) under assumption that infinite numbers of bacorders are allowed. Tayur [1992] extended Mitra and Mitrani 1990] model for addressing the problem of deployment of safety stocs when processing times variations exist. He developed a heuristic based on the sample path analysis, which allocates anbans at each stage of system such that specified throughput (THT) is achieved with minimum average inventory (AI). Di Masocolo et al [1995] extended Mitra & Mitrani [1991] model to consider general production networ and they also decomposition type algorithm for evaluating the performance of the system. The basic difference between in the decomposition approach of Mitra & Mitrani [1990 & 1991] and Di Masocolo et al[1995] is each subsystem after decomposition of total system is analyzed by dealing with underlying Marov chain in the former system whereas in the later system, it is analyzed by product form approximation. However, both Mitra & Mitrani[1991] and Di Masocolo et al[1995] models do not consider the issues relevant to the problem of deployment of safety stocs in unsaturated GCP system. Ettl and Schwehm[94& 95] considered saturated Generalized anban controlled production lines and developed a heuristic based queuing networs and genetic algorithm for optimal portioning of the networ and allocation of anbans such that specified throughput is achieved with minimum average inventory Further, designing of the
5 system for specified off-the bin service to the external customer (alternatively nown as Customer Service Level (CSL)) is essentially needed so as to have competitive edge over others. In the present wor, unsaturated finite capacitated GCP system with sources of uncertainties in external demand and processing times is considered and analyzed for the various performance measures. Further, relevant issues of safety stocs viz, their location and sizing are also addressed. 3. Model The considered GCP system consists of number of stages arranged in series as shown in Fig.1. Each stage (=1,2,..) consist of queues, namely, anban post (P ), WorCentre (WC ) and Output Buffer (OB ) with their entities respectively as free anbans (anbans not attached with parts), anbans attached with raw parts (WIP) and anbans with finished products of stage. It is assumed that c number of anbans is associated with stage of the system. In the queue WC,(=12, ), there exist a machine M which process one part at a time. The processing time of M is random process and is assumed as exponentially distributed with mean service rate a µ. External demand occurs for finished products of stage and is assumed as Poisson process with mean arrival rate as λ. The difference in the number of entities in the queues P andob 1, the difference in number of entities in the queues P + 1 and OB at each stage and bacorder level in QD are used as state variables. Let b be the maximum number of bacorders allowed in the system.
6 3.1 Law of Motion The dynamics of the GCP system on occurrence of the events namely, arrival of external demand and service completion of machine M (=1,2,.) is called as law of motion of the system and it is as follows: When an external demand arrives, it is satisfied immediately if at least one finished product is available in the output buffer OB resulting in assembly of product with demand. The finished product leaves the system along with external demand after its associated anban is detached without any time delay. The detached anban joins the anban post products in P instantaneously. On the other hand, if there are no finished OB and the external demand is bacordered in the queueqd. It remains in that queue until a finished product joins the output bufferob. It is assumed that finite number of bacorders is allowed in the system. Let B be the maximum number of bacorders allowed in the system. Hence queues OB and QD can never be nonempty simultaneously although they can be empty simultaneously. The machine M ( = 1,2,..., ) after completion of operation on a part, the part along with its tagged anban is added to the output buffer OB without any time delay. The machine M ( = 1,2,..., ) processes the next part from WC if available, otherwise it becomes idle. When a part along with its tagged anban departs from M ( = 1,2,..., ) to output buffer OB, the part is detached from its associated anban and is attached with a free anban from the anban post P + 1 without any time delay if at least one free anban is available in that anban post. The part along with the attached anban moves to wor centerwc + 1. The anban, which is removed from the part, is transferred to P instantaneously. On the arrival of free anban to P, it is tagged to a part from the output buffer OB after removing its already associated anban of stage 1 without any time 1 delay if at least one part along with tagged anban is available in that buffer. The
7 removed anban joins P 1 instantaneously. The anban along with its attached part is moved to WC and it is loaded on to the machine M if idle, otherwise the part waits for processing in the worcentre. If OB 1 is empty, then free anban remains in the anban post, OB 1 cannot be non-empty simultaneously. P. This results in the queues P ( = 1,2,..., ) and 3.2 Mathematical statement of the problem The problem can now be stated as follows: Given allocation of anbans c 1, c 2,.. c at stage 1, 2.. respectively in the GCP of serial type with Poisson arrival process of external demand, and exponential processing times, it is needed to determine the Average Inventory (AI), Average Throughput (THT) and Customer Service Level (CSL). The underlying stochastic process of the system is Continuous Time Marov Chain (CTMC) due to the assumptions about external demand and processing times as Marovian processes. The underlying Marov chains of CTMC can be dealt and specified performance measures can be determined if the number of stages in the system is only two (Rao [2006]). When the number of stages in the system is more than two, it is computationally very difficult and hence decomposition type procedure is developed to evaluate the performance of the system. 4. Decomposition Procedure The GCP system is decomposed into number of subsystems, Ω ( ) ( = 1,2,..., ) as shown in Fig. 2. Each subsystem Ω() consists of a Wor Center WC, an upstream and a downstream synchronization stations IP and OP respectively. Upstream synchronization IP, taes place between the two queues viz., i) queue of raw parts, denoted as RP and ii)
8 queue of free anbans P. Similarly, in downstream station OP, synchronization taes place between the queue of demands DM and the queue of finished productsob. The sizes of RP and DM are chosen to coincide exactly with the capacities of OB 1 and P + 1 of stages -1 and +1 of the GCP system respectively. The number of anbans associated with Ω ( ) ( = 1,2,..., ) is equal to c of stage of the original system. It is assumed that each subsystem Ω () behaves in the same manner as that of stage in the original system. Each subsystem Ω ( ) ( = 1,2,..., ) is synchronized with two independent Poisson processes one at IP with parameter ρ and the other at OP withϖ. For analyzing the GCP system through decomposition algorithm, two issues are to be resolved namely, (i) analysis of subsystem Ω ( ) ( = 1,2,..., ) assuming that ρ ( = 1,2,..., ) and ϖ ( = 1,2,..., ) are given and (ii) determination of parameters ρ and ϖ for each subsystem Ω( ) ( = 1,2,..., ). 4.1 Analysis of Subsystem Ω( ) ( = 1,2,..., ) In this subsection, the procedure for analyzing Ω() is described with the assumption that ρ and ϖ are nown. Fig. 3 shows the schematic representation of Ω ( )( = 1,2,... ). As assumed earlier the service time of machine M follows exponential, arrival of raw parts and demands follow Poisson processes and c, c 1 and c + 1 are finite numbers, the underlying stochastic process involved with Ω () conforms to finite Continuous-Time Marov Chain(CTMC). Therefore CTMC modeling approach is followed for the analysis of Ω (). As per this, Let S (t) be the state of subsystem Ω () at given time t defined as
9 { I ( t), J ( t); c I ( t) c, c J ( t) c ; for =, c = b, t 0} S( t) = (1) where I (t) and J (t) represent difference of entities in the queues P and RP and the difference of entities in the queues OB and DM. at any given time t respectively. Let Q be the transition rate matrix of CTMC of Ω( ) ( = 1,2,3,... ). and can be written based on the net conservation flow (Viswanatham & Narahari [1995]). Let Π ( = 1,2,3,..., 1) be the row vector of steady-state probabilities of states of Ω ().and ( j) π be the j th component of the steady-state probability vector. Then Π can be determined by solving the following set of simultaneous linear global balance equations. Π Q = 0 (2) ( ) π j = 1 (3) j Let α be the throughput of the subsystem Ω ( ) ( = 1,2,3,... ).. Based conservation of flow of material, under steady-state the expression for α ( > 1) can be written as follows: α = ρ [ 1 P( I = c 1 )] for = 2,... (4) where P ( I = c 1 ) represents the steady-state probability that c 1 anbans accumulate in buffer RP. Alternatively in steady state as net inflow of parts to the buffer OB ( = 1,2,3,..., ) is equal to the effective outflow of demands that are accepted per unit time. Hence α ( 1) can be expressed as follows: α ϖ 1 P( J = c )] for = 1,2,..., 1 (5) = [ + 1
10 where P ( J = c + 1) is the probability that c + 1 number of free anbans accumulate in DM.. Using Π, the values of functions, viz, P ( I = c 1 ) and P ( J = c + 1) can be determined by proper summation of steady-state probabilities. 4.2 Estimation of parameters of Ω( ),( = 1,2,..., ) The -stage GCP system is approximated as a sequence of subsystems where a stream of raw parts and demands at Ω() is provided by the subsystem Ω( 1) and Ω( +1) respectively. On other hand, the last subsystem Ω () is non-typical system in which the demands for the finished products come from outside with Poisson distribution rate with parameter λ. The parameters of the subsystems are denoted as two different vectors viz, (i) ρ= ρ, ρ,..., ρ ) and (ii) ϖ= ϖ, ϖ,..., ϖ ). and are determined by following two ( 1 2 considerations respectively ( 1 2 i) Under steady-state, throughput of all subsystems must be the same and the system faces an average demand of λ ( P( J = b). Hence the throughput of each subsystem α = λ P( J b) and Eqns (4) and (5) can be written as ( J b) for 2,3 ρ [ 1 P( I = c 1 )] = λ P =,..., (6) ϖ 1 P ( J = c )] + = λ P( J b) for = 1,2,3,..., 1 (7) [ 1 Rearranging Eqs. (6) and (7), we get λ P( J b) ρ = for = 2,3,... (8) [1 P( I = c )] 1 ϖ λp( J = [1 P( J b) = c 1 )] for = 1,2,... 1 (9)
11 ii) As the input buffer RP of subsystem Ω () is equal to the output buffer of Ω( 1) and DM of subsystem Ω () is equal to P +1 of the subsystem Ω( +1) we get P( I = c 1 ) = P( J 1 = c 1 ) for = 2,3,... (10) P( J = c+ 1) = P( I + 1 = c + 1) for = 1,2,3,... 1 (11) Using Eqs. (10) and (11) Eqs.(8) and (9) can be rewritten respectively as λp( J b) ρ = for = 2,3,... (12) [1 P( J = c )] 1 1 λp( J b) ϖ = for = 1,2,... 1 (13) [1 P( I = c )] Rewriting, Eqs. (12) and (13) λp( J b) ρ + 1 = for = 1,2,3,..., 1 (14) [1 P( J = c )] λp( J b) ϖ 1 = for = 2,3,... (15) [1 P( I = c )] The equations (14) and (15) are nown as fixed-point equations. These equations are solved for ρ= [ ρ ρ ρ2,..., ρ ] and ϖ= ϖ, ϖ,..., ϖ ] iteratively by fixed point iterative algorithm 1 2, [ Fixed Point Iterative Algorithm The algorithm is initialized by setting the downstream parameters of all the subsystems to certain starting values asϖ = + ( = 1,2,..., 1) and P( J b) 1. As the µ 1 = number of bacorders allowed in the system is b ϖ = λ P( J b). The main loop consist of forward and bacward passes In the forward pass, for each subsystem Ω( ) ( = 2..., ),
12 the upstream parameters of ρ is updated according to Eq. (14) by analyzing the subsystem Ω( 1). In bacward pass, the downstream parameter, ϖ 1 of the subsystem Ω( 1) ( = 1,2,..., 1) is improved according to Eq.(15) by analyzing the subsystem Ω ( ) ( = 2,3,..., ). The algorithm iterates between the two passes until a convergence criteria is satisfied. Table.1 shows the summarization of fixed-point algorithm for estimating the vectors ρ andϖ. Once the convergence is achieved in the fixed-point algorithm, the whole system is decomposed into Ω ( 1), Ω(2),... Ω( ). These subsystems are analyzed in isolation independently and the performance measures of total system determined. 4.4 Performance measures Let (l, m) be the typical state of Ω ( ) ( = 1,2,... ) and its associated steady-state probability be π ( l, m). Using steady-state probabilities and other parameters, viz, c1, c2,... c, B expressions for the performance measures of original system namely, CSL, AI and THT are derived. CSL: It is defined as the probability that the arrival of external demand is met instantaneously and occurs only for finished products of stage in a multi-stage unsaturated GCP system. Based on the analysis of subsystem Ω () in isolation, the expression for CSL can be derived by proper summing of steady state probabilities as follows: CSL c = c j j= 1i i= c 1 π ( i, j) (16)
13 AI: It is sum of average inventory of each subsystemω ( ), = 1, 2,...,. The average inventory of each subsystem is the difference between the number of anbans associated with Ω () and the expected number of free anbans in P. Hence, expression for AI can be obtained as AI = c i = = 1 i= 1 j= c c 0 π ( i, j) (17) THT 1 0 = µ 1 π j= i= c ( c j, j) + π ( i, c ) 0 1 (18) To test the accuracy of the analysis, a simulation model is developed for GCP system. The results are compared with that obtained from the analysis. 5. Results and Discussion Decomposition type algorithm is developed for the evaluation of multi-stage unsaturated finite capacitated GCP system. Three types of data sets are considered, namely, identical processing set ( = ) type ( ) i < µ i+1 µ, non-identical processing set of type ( ) = i µ i + µ and of i > µ i+1 µ for validating the procedure developed and gaining insights on the issue of deployment of buffer stocs in the selected system under considered sources of uncertainties. In each type of data set, three types of external demand scenarios, viz., uniform, bowl, inverse bowl and random allocation patterns are considered (Siha [1994]). A comparison of the results obtained from decomposition procedure for the analysis of two stage unsaturated finite capacitated GCP system with that from CTMC and simulation models with 95% confidence level(c>f) is presented in Tables 2-4.
14 It may be observed from these tables that decomposition results are in close agreement with that of CTMC analysis under identical conditions. In addition, for validation of the algorithm developed for analyzing large system, six stage system is considered and is evaluated with uniform allocation, uniformly decreasing, uniformly increasing and random allocation patterns with varying demand rates, machine capacities and number of anbans and presented in Tables 5-9. From these tables, it can be noted that these algorithms yield results, which are in close agreement with that of simulation at 95% C.F further signifying their applicability to the analysis of multi-stage system. After validation of the algorithm developed, it is attempted to evaluate the five stage selected GCP system for gaining insights on the deployment of buffer stocs when the systems face uncertainties in external demand and machine processing times. The following sections present the effect of variations in external demand, effect of unbalances in machine capacities and the effect of allocation pattern on the performance of selected systems. 5.1 Effect of variation in external demand Figures 4 & 5 show the effect of increase of mean external demand rate on the CSL and AI respectively of unsaturated finite capacitated 5-stage GCP system under various types of allocation patterns namely, uniform, constantly increasing, constantly decreasing and random allocation patterns when machine capacities are balanced. It can be observed that as external demand increases both CSL and AI decreases however, rate of decrease of CSL is more as compared to AI. This is due to the fact that as external demand increases, congestion taes place which leads to longer flow times consequently rate of availability of finished products decreases and therefore CSL decreases. Further, more accumulation of free anbans occur in respective anban posts as external demand increases resulting in the decrease of AI. As per
15 the law of motion of considered GCP system that each stage, consists of input buffer WC, it results WIP as external demand increases therefore decrement in AI is less as compared that of CSL. Similar observations can be made from Figures 6 & 7 when machine capacities are decreasing from the most upstream stage to the most down stream stage and Figures 8 & 9 in which machine capacities increase from upstream stage to down stream stages 5.2 Effect of Variations in machine capacities and number of stages It may be observed from Figures 4, 6 and 8 that for a given allocation pattern and external demand scenarios balanced machine capacities results in better CSL compared to unbalanced machine capacities in the selected five-stage systems. In case of balanced capacities raw parts are made available to downstream stages at the required epochs of time. Unbalanced machine capacities results in either starvation or excess availability of parts in contrary to the demands raised by down stream stages. The presence of uniformly increasing machine capacities between the stages results in better CSL compared to the case of uniformly decreasing condition at low ( =0.3) and medium ( =0.5) rates of demand in the selected system. When the downstream stages are more capacitated the parts are processed at faster rate although upstream stages feed at lower rate resulting in availability of the finished products. 5.3 Effect of allocation pattern It can be noted from Figures 4-8 that in the GCP system at low rates of demand i.e., =0.3, the uniformly increasing allocation pattern dominates over other allocation pattern for a given total number of anbans. On the other hand that at higher rates of demand, > 0.3, no allocation pattern follow a set pattern, such that specified CSL is achieved with minimum AI.
16 It can be observed that at lower rates of external demand, exact allocation for the selected criteria is difficult to determine. Hence allocation of anbans among stages in CP systems is treated as a combinatorial problem. For determining the number of anbans at each stage in GCP system to the selected criterion namely achieving specified CSL with minimum AI is still an issue. 6. Conclusions A decomposition type procedure is developed for evaluating the performance of multi-stage unsaturated finite capacitated GCP system with uncertainties in processing times and external demand. Derived the expressions for performance measures namely, CSL,AI and THT. The accuracy of the procedure is tested with CTMC and simulation models. It is found that the results are in close agreement. Further, effect of variations in external demand rates, capacities of machines and allocation patterns on the performance of the system is studied. Based on this, the following conclusions can be drawn: o With an increase in external demand, both CSL and AI decrease. o Machines having higher capacities when located at downstream stages would result in more CSL and less AI in all demand scenarios compared to the machine located at upstream stages o No specific allocation pattern is perceptible for achieving a specified CSL with minimum AI in multi-stage system, unlie in two-stage GCP system. It can be categorized as a combinatorial problem. 7. References 1. Di Mascolo, M., Frein, Y., Baynat, B., and Dallery, Y.,(1993) Queuing networ modeling and analysis of generalized anban systems. European Control Conference. pp Di Mascolo, M., Frein, Y., Baynat, B., Dallery, Y. (1996) An analytical method for performance evaluation of anban controlled production systems. Operations Res. 44(1), pp
17 3. Ettl, M., and Schwehm, M. (1994) A design methodology for anban controlled production lines using queuing networs and genetic algorithms. Tenth International Conference on Systems Engineering, ICSE, 6-8 September, Coventry U.., pp Ettl, M., and Schwehm, M.(1995) Determining the Optimal Networ partition and anban Allocation in JIT production lines. Evolutionary Algorithms in Management Applications : Edited by Bielthah, J., and Nissen, V. Springer Verlag., pp Frein, Y. and Di Mascolo, M. (1995) On the Design of Generalized anban Control Systems. International Journal of Operations & Production Management, Vol.15, No.9, pp Matta, A., Dallery, Y. and Di Mascolo, M. (2005) Analysis of an assembly systems controlled with anbans. European Journal of Operations Research, Vol.166, pp Mitra, D.and Mitrani, I.(1990) Analysis of a anban discipline for cell coordination in production lines. Management Science, Vol.36, pp Mitra, D. and Mitrani, I.(1991) Analysis of a anban discipline for cell coordination in production lines, -II: Stochastic Demands. Operations Research, Vol.39, pp Rao, M.S. 2006, Analytical Investigations on anban Controlled Unsaturated Multi-Stage Production System. Ph.D thesis, JNT University, Hyderabad, India 10. Siha, S., 1994, The Pull Production System: Modeling and Characteristics. International Journal of Production Research. 32(32), pp Tayur, S. R. (1992) Properties of Serial anban Systems. Queuing systems. Vol.12, pp Tayur, S. R. (1993) Structural properties and a Heuristic for anban controlled Serial lines. Management Science, Vol.39, No. 11, pp Viswanadham, N. and Narahari, Y. (1994) Performance modeling of Automated Manufacturing Systems. Prentice-Hall India Ltd, pp Acnowledgement The authors than Dr. A. Seshu umar for the help rendered in the preparation of the paper. The financial support from Technical Education Quality Improvement Program (TEQIP) in the presentation of the article is acnowledged.
18 P1 0 0 OB0 External 1 1 WC1 1 Stage 1 M P2 P3 2 2 WC2 Stage 2 M2 2 2 WC Stage M P+1 WC Stage M QD Poisson demand with λ OB1 OB2 OB OB - Free anban of stage - anban with part of stage - External Demands Fig. 1 Schematic representation of multi-stage unsaturated finite capacitated GCP system
19 IP1 OP1 ϖ DM 1 1 M 1 P1 ρ 1 WC 1 RP OB 1 1 Ω(1) DM 2 ϖ 2 M 2 P2 ρ 2 WC 2 RP OB 2 2 Ω(2) IP OP ϖ DM M P ρ RP WC OB Ω() Fig. 2 Decomposition of -stage unsaturated finite capacitated GCP system
20 IP OP DM ϖ M P ρ RP WC Ω () OB Part with anban Free anban of stage Fig. 3 Isolated subsystems Ω() Customer Service Level (CSL) uniform constantly decreasing random µ i = 1.0, i = 1,2,...,5 constantly increasing Mean External Demand Rate (λ) Fig. 4 Variation of CSL with demand (µ i = 1.0, i=1,2,,5) in the case of five-stage unsaturated finite capacitated GCP system
21 20.0 µ i = 1.0, i = 1,2,..., Avaerage Inventory (AI) constantly decreasing constantly increasing random uniform Mean External Demand Rate (λ) Fig. 5 Variation of AI with demand (µ i = 1.0, i=1,2,,5) in the case five-stage unsaturated finite capacitated GCP system µ 1 = 1.0, µ 2 = 0.9, µ 3 = 0.8, µ 4 = 0.7, µ 5 = 0.6 Customer Service Level (CSL) random constantly decreasing uniform constantly increasing Mean External Demand Rate (λ) Fig. 6 Variation of CSL with demand (µ 1 =1.0, µ 2 =0.9, µ 3 =0.8, µ 4 =0.7, µ 5 =0.5) in the case of five-stage unsaturated finite capacitated GCP system
22 20.0 µ 1 = 1.0, µ 2 = 0.9, µ 3 = 0.8, µ 4 = 0.7, µ 5 = Average Iinventory (AI) random constantly increasing uniform constantly decreasing Mean External Demand Rate (λ) Fig. 7 Variation of AI with demand (µ 1 =1.0, µ 2 =0.9, µ 3 =0.8, µ 4 =0.7, µ 5 =0.6) in the case of five-stage unsaturated finite capacitated GCP system µ 1 = 0.6, µ 2 = 0.7, µ 3 = 0.8, µ 4 = 0.9, µ 5 = 1.0 Customer Service Level (CSL) random constantly decreasing constantly increasing uniform Mean External Demand Rate (λ) Fig. 8 Variation of CSL with demand (µ 1 =0.6, µ 2 =0.7, µ 3 =0.8, µ 4 =0.9, µ 5 =1.0) in the case of five-stage unsaturated finite capacitated GCP system
23 Average Inventory (AI) uniform constantly increasing µ 1 = 0.6, µ 2 = 0.7, µ 3 = 0.8, µ 4 = 0.9, µ 5 = 1.0 random constantly decreasing Mean External Demand Rate (λ) Fig. 9 Variation of AI with demand (µ 1 =0.6, µ 2 =0.7, µ 3 =0.8, µ 4 =0.9, µ 5 =1.0) in the case of five-stage unsaturated finite capacitated GCP system Table 1 Summary of Fixed point algorithm 1. INITIALILZATION: Set values for ρ 1 =, ϖ = λ and ϖ = µ + 1 ( = 1,2,..., 1) and P( J b) = 1 2. FORWARD PASS: In this pass, the upstream parameters ρ ( = 2,3,..., ) are updated. For this purpose, the subsystems are analyzed from Ω (1) to Ω( 1). In the analysis of Ω( ) = 1,2,..., 1, determine ρ + 1 using Eq BACWARD PASS: In this pass, the downstream parameters ( = 1,2,... 1) are modified. The subsystem, Ω( ) ( =, 1,...2), are analyzed for determining ϖ 1 using Eq CONVERGENCE: Repeat step 2 and 3 until the changes in parameters are small. ϖ
24 Table 2 Decomposition procedure for analysis of two-stage unsaturated GCP system and its validation with CTMC model and simulation for conditions µ 1 = µ 2 = 1.0, C = 6 and b = 100 Sl. No Ext. Demand rate Allocation GCP DECOM ` GCP CTMC Simulation with 95% C.F AI CSL AI CSL AI CSL ±0.002 ± ±0.002 ± ±0.002 ± ±0.002 ± ±0.004 ± ±0.005 ± ±0.005 ± ±0.004 ± ±0.002 ± ± ± ±0.002 ± ±0.002 ± ±0.002 ± ± ±0.002 ± ±0.008
25 Table 3 Decomposition procedure for analysis of two-stage unsaturated GCP system and its validation with CTMC model and simulation for conditions µ 1 =1.0 & µ 2 =0.8, C = 6 & b =100 Sl. No Ext. Demand rate Allocation GCP DECOM ` GCP CTMC Simulation with 95% C.F AI CSL AI CSL AI CSL ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ±0.0075
26 Table 4 Decomposition procedure for analysis of two-stage unsaturated GCP system and its validation with CTMC model and simulation for conditions µ 1 =0.8 & µ 2 = 1.0, C = 6 & b =100 Sl. No Ext. Demand rate Allocation GCP DECOM ` GCP CTMC Simulation with 95% C.F AI CSL AI CSL AI CSL ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ±0.009
27 Table 5 Decomposition procedure for analysis of six-stage unsaturated GCP system and its validation with simulation for conditions µ i = 1.0, i = 1, 2,,6 and b = 100 Sl. No Ext. Demand rate Allocation GCP DECOM Simulation with 95% C.F AI CSL AI CSL ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ±0.0097
28 Table 6 Decomposition procedure for analysis of six-stage unsaturated GCP system and its validation with simulation for conditions µ 1 = 1.0, µ 2 = 0.9, µ 3 =0.8, µ 4 = 0.7, µ 5 = 0.6, µ 6 =0.5 and b = 100 Sl. No Ext. Demand rate Allocation GCP DECOM Simulation with 95% C.F AI CSL AI CSL ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± ±0.012
29 Table 7 Decomposition procedure for analysis of six-stage unsaturated GCP system and its validation with simulation for conditions µ 1 = 0.5, µ 2 = 0.6, µ 3 =0.7, µ 4 = 0.8, µ 5 = 0.9, µ 6 =1.0 and b = 100 Sl. No Ext. Demand rate Allocation GCP DECOM Simulation with 95% C.F AI CSL AI CSL ± ± ± ± ± ± ± ± X ± X ± X ± X ± ± ± ± ± ± ± ± ± ± ± X10-5 ± ±0.000
MODELING AND PROPERTIES OF GENERALIZED KANBAN CONTROLLED ASSEMBLY SYSTEMS 1
MODELING AND PROPERTIES OF GENERALIZED KANBAN CONTROLLED ASSEMBLY SYSTEMS 1 Sbiti N. *, Di Mascolo M. **, Amghar M.* * Ecole Mohammadia d Ingénieurs, Université Mohammed V-Agdal, Avenue Ibn Sina, BP 765,
More informationA PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS
A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS Kumar Satyam and Ananth Krishnamurthy Department of Decision Sciences and Engineering Systems,
More informationPush and Pull Systems in a Dynamic Environment
Push and Pull Systems in a Dynamic Environment ichael Zazanis Dept. of IEOR University of assachusetts Amherst, A 0003 email: zazanis@ecs.umass.edu Abstract We examine Push and Pull production control
More informationSynchronized Queues with Deterministic Arrivals
Synchronized Queues with Deterministic Arrivals Dimitra Pinotsi and Michael A. Zazanis Department of Statistics Athens University of Economics and Business 76 Patission str., Athens 14 34, Greece Abstract
More informationS. T. Enns Paul Rogers. Dept. of Mechanical and Manufacturing Engineering University of Calgary Calgary, AB., T2N-1N4, CANADA
Proceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. CLARIFYING CONWIP VERSUS PUSH SYSTEM BEHAVIOR USING SIMULATION S. T. Enns
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationImproved Algorithms for Machine Allocation in Manufacturing Systems
Improved Algorithms for Machine Allocation in Manufacturing Systems Hans Frenk Martine Labbé Mario van Vliet Shuzhong Zhang October, 1992 Econometric Institute, Erasmus University Rotterdam, the Netherlands.
More informationPERFORMANCE ANALYSIS OF PRODUCTION SYSTEMS WITH REWORK LOOPS
PERFORMANCE ANALYSIS OF PRODUCTION SYSTEMS WITH REWORK LOOPS Jingshan Li Enterprise Systems Laboratory General Motors Research & Development Center Mail Code 480-106-359 30500 Mound Road Warren, MI 48090-9055
More informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More informationUNIVERSITY OF CALGARY. A Method for Stationary Analysis and Control during Transience in Multi-State Stochastic. Manufacturing Systems
UNIVERSITY OF CALGARY A Method for Stationary Analysis and Control during Transience in Multi-State Stochastic Manufacturing Systems by Alireza Fazlirad A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES
More informationThe Behavior of a Multichannel Queueing System under Three Queue Disciplines
The Behavior of a Multichannel Queueing System under Three Queue Disciplines John K Karlof John Jenkins November 11, 2002 Abstract In this paper we investigate a multichannel channel queueing system where
More informationSingle-part-type, multiple stage systems. Lecturer: Stanley B. Gershwin
Single-part-type, multiple stage systems Lecturer: Stanley B. Gershwin Flow Line... also known as a Production or Transfer Line. M 1 B 1 M 2 B 2 M 3 B 3 M 4 B 4 M 5 B 5 M 6 Machine Buffer Machines are
More information6 Solving Queueing Models
6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will
More informationMultiserver Queueing Model subject to Single Exponential Vacation
Journal of Physics: Conference Series PAPER OPEN ACCESS Multiserver Queueing Model subject to Single Exponential Vacation To cite this article: K V Vijayashree B Janani 2018 J. Phys.: Conf. Ser. 1000 012129
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More informationStationary Probabilities of Markov Chains with Upper Hessenberg Transition Matrices
Stationary Probabilities of Marov Chains with Upper Hessenberg Transition Matrices Y. Quennel ZHAO Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba CANADA R3B 2E9 Susan
More informationTransient Analysis of Single Machine Production Line Dynamics
International Journal of Operations Research International Journal of Operations Research Vol. 11, No. 2, 040 050 (2014) Transient Analysis of Single Machine Production Line Dynamics Farhood Rismanchian
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationThe Study State Analysis of Tandem Queue with Blocking and Feedback
` Journal Of Advanced Networing and Applications 4 Vol. 0 No. 0 pages: 4-0 (009) The Study State Analysis of Tandem Queue with Blocing and Feedbac C Chandra Sehar Reddy Asst. Prof., RGM Engg. College,
More informationQueuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The
More informationMODELING AND ANALYSIS OF SPLIT AND MERGE PRODUCTION SYSTEMS
University of Kentucky UKnowledge University of Kentucky Master's Theses Graduate School 008 MODELING AND ANALYSIS OF SPLIT AND MERGE PRODUCTION SYSTEMS Yang Liu University of Kentucky, yang.liu@uky.edu
More informationA scalar conservation law with discontinuous flux for supply chains with finite buffers.
A scalar conservation law with discontinuous flux for supply chains with finite buffers. Dieter Armbruster School of Mathematical and Statistical Sciences, Arizona State University & Department of Mechanical
More informationMulti-class, multi-server queues with non-preemptive priorities
Multi-class, multi-server queues with non-preemptive priorities Andrei Sleptcheno. EURANDOM, Eindhoven University of Technology, P.O. Box 53, 5600MB Eindhoven, The Netherlands. e-mail:sleptcheno@eurandom.tue.nl
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More informationMIT Manufacturing Systems Analysis Lectures 6 9: Flow Lines
2.852 Manufacturing Systems Analysis 1/165 Copyright 2010 c Stanley B. Gershwin. MIT 2.852 Manufacturing Systems Analysis Lectures 6 9: Flow Lines Models That Can Be Analyzed Exactly Stanley B. Gershwin
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
More informationAutomation in Complex Systems MIE090
Automation in Complex Systems MIE090 Exam Monday May 29, 2017 You may bring the course book and the reprints (defined in the course requirements), but not the solution to problems or your own solutions
More informationFuzzy Optimization and Normal Simulation for Solving Fuzzy Web Queuing System Problems
Fuzzy Optimization and Normal Simulation for Solving Fuzzy Web Queuing System Problems Xidong Zheng, Kevin Reilly Dept. of Computer and Information Sciences University of Alabama at Birmingham Birmingham,
More informationPooling in tandem queueing networks with non-collaborative servers
DOI 10.1007/s11134-017-9543-0 Pooling in tandem queueing networks with non-collaborative servers Nilay Tanık Argon 1 Sigrún Andradóttir 2 Received: 22 September 2016 / Revised: 26 June 2017 Springer Science+Business
More informationProcess-Algebraic Modelling of Priority Queueing Networks
Process-Algebraic Modelling of Priority Queueing Networks Giuliano Casale Department of Computing Imperial College ondon, U.K. gcasale@doc.ic.ac.uk Mirco Tribastone Institut für Informatik udwig-maximilians-universität
More informationOn the Partitioning of Servers in Queueing Systems during Rush Hour
On the Partitioning of Servers in Queueing Systems during Rush Hour This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity
More informationMIT Manufacturing Systems Analysis Lectures 18 19
MIT 2.852 Manufacturing Systems Analysis Lectures 18 19 Loops Stanley B. Gershwin Spring, 2007 Copyright c 2007 Stanley B. Gershwin. Problem Statement B 1 M 2 B 2 M 3 B 3 M 1 M 4 B 6 M 6 B 5 M 5 B 4 Finite
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/39637 holds various files of this Leiden University dissertation Author: Smit, Laurens Title: Steady-state analysis of large scale systems : the successive
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationAnalysis of a Two-Phase Queueing System with Impatient Customers and Multiple Vacations
The Tenth International Symposium on Operations Research and Its Applications (ISORA 211) Dunhuang, China, August 28 31, 211 Copyright 211 ORSC & APORC, pp. 292 298 Analysis of a Two-Phase Queueing System
More informationNetwork Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model
2st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 205 wwwmssanzorgau/modsim205 Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More informationA Retrial Queueing model with FDL at OBS core node
A Retrial Queueing model with FDL at OBS core node Chuong Dang Thanh a, Duc Pham Trung a, Thang Doan Van b a Faculty of Information Technology, College of Sciences, Hue University, Hue, Viet Nam. E-mail:
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationA Markov chain analysis of the effectiveness of drum-buffer-rope material flow management in job shop environment
International Journal of Industrial Engineering Computations 6 (015) 457 468 Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/iiec
More informationMinimizing response times and queue lengths in systems of parallel queues
Minimizing response times and queue lengths in systems of parallel queues Ger Koole Department of Mathematics and Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationType 1. Type 1 Type 2 Type 2 M 4 M 1 B 41 B 71 B 31 B 51 B 32 B 11 B 12 B 22 B 61 M 3 M 2 B 21
Design and Operation of Manufacturing Systems The Control-Point Policy by Stanley B. Gershwin Institute Massachusetts Technology of Cambridge, 02139 USA Massachusetts I I E Annual Conference Orlando, Florida,
More informationMIT Manufacturing Systems Analysis Lecture 10 12
2.852 Manufacturing Systems Analysis 1/91 Copyright 2010 c Stanley B. Gershwin. MIT 2.852 Manufacturing Systems Analysis Lecture 10 12 Transfer Lines Long Lines Stanley B. Gershwin http://web.mit.edu/manuf-sys
More informationPERFORMANCE ANALYSIS OF MULTI-SERVER TANDEM QUEUES WITH FINITE BUFFERS AND BLOCKING
PERFORMANCE ANALYSIS OF MULTI-SERVER TANDEM QUEUES WITH FINITE BUFFERS AND BLOCKING Marcel van Vuuren a, Ivo J.B.F. Adan a and Simone A. E. Resing-Sassen b a Eindhoven University of Technology, P.O. Box
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationEquivalent Models and Analysis for Multi-Stage Tree Networks of Deterministic Service Time Queues
Proceedings of the 38th Annual Allerton Conference on Communication, Control, and Computing, Oct. 2000. Equivalent Models and Analysis for Multi-Stage ree Networks of Deterministic Service ime Queues Michael
More informationFuzzy Queues with Priority Discipline
Applied Mathematical Sciences, Vol. 4,, no., 575-58 Fuzzy Queues with Priority Discipline W. Ritha* and Lilly Robert Department of Mathematics Holy Cross College (Autonomous) Trichirapalli, Tamilnadu,
More informationCost models for lot streaming in a multistage flow shop
Omega 33 2005) 435 450 www.elsevier.com/locate/omega Cost models for lot streaming in a multistage flow shop Huan Neng Chiu, Jen Huei Chang Department of Industrial Management, National Taiwan University
More informationI, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.
A BRIEF REVIEW ON INFINITE QUEUE MODEL M. Vasuki*, A. Dinesh Kumar** & G. Vijayaprabha** * Assistant Professor, Department of Mathematics, Srinivasan College of Arts and Science, Perambalur, Tamilnadu
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationDiscrete Event and Process Oriented Simulation (2)
B. Maddah ENMG 622 Simulation 11/04/08 Discrete Event and Process Oriented Simulation (2) Discrete event hand simulation of an (s, S) periodic review inventory system Consider a retailer who sells a commodity
More informationA Bernoulli Model of Selective Assembly Systems
Preprints of the 19th World Congress The International Federation of Automatic Control A Bernoulli Model of Selective Assembly Systems Feng Ju and Jingshan Li Department of Industrial and Systems Engineering,
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More informationTwo Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server
Two Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server S. Jehoashan Kingsly 1, S. Padmasekaran and K. Jeganathan 3 1 Department of Mathematics, Adhiyamaan
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationAn inspection-based compositional approach to the quantitative evaluation of assembly lines
An inspection-based compositional approach to the quantitative evaluation of assembly lines Marco Biagi 1 Laura Carnevali 1 Tommaso Papini 1 Kumiko Tadano 2 Enrico Vicario 1 1 Department of Information
More informationRepresentation and Analysis of Transfer Lines. with Machines That Have Different Processing Rates
March, 1985 Revised November, 1985 LIDS-P-1446 Representation and Analysis of Transfer Lines with Machines That Have Different Processing Rates by Stanley B. Gershwin 35-433 Massachusetts Institute of
More informationSystem occupancy of a two-class batch-service queue with class-dependent variable server capacity
System occupancy of a two-class batch-service queue with class-dependent variable server capacity Jens Baetens 1, Bart Steyaert 1, Dieter Claeys 1,2, and Herwig Bruneel 1 1 SMACS Research Group, Dept.
More informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More informationCHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK
CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK 3. INTRODUCTION: Considerable work has been turned out by Mathematicians and operation researchers in the development of stochastic and simulation
More informationControl of Fork-Join Networks in Heavy-Traffic
in Heavy-Traffic Asaf Zviran Based on MSc work under the guidance of Rami Atar (Technion) and Avishai Mandelbaum (Technion) Industrial Engineering and Management Technion June 2010 Introduction Network
More informationA STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL
A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University
More informationClassification of Queuing Models
Classification of Queuing Models Generally Queuing models may be completely specified in the following symbol form:(a/b/c):(d/e)where a = Probability law for the arrival(or inter arrival)time, b = Probability
More information0utline. 1. Tools from Operations Research. 2. Applications
0utline 1. Tools from Operations Research Little s Law (average values) Unreliable Machine(s) (operation dependent) Buffers (zero buffers & infinite buffers) M/M/1 Queue (effects of variation) 2. Applications
More informationDesign of Plant Layouts with Queueing Effects
Design of Plant Layouts with Queueing Effects Saifallah Benjaafar Department of echanical Engineering University of innesota inneapolis, N 55455 July 10, 1997 Abstract In this paper, we present a formulation
More informationAn Aggregation Method for Performance Evaluation of a Tandem Homogenous Production Line with Machines Having Multiple Failure Modes
An Aggregation Method for Performance Evaluation of a Tandem Homogenous Production Line with Machines Having Multiple Failure Modes Ahmed-Tidjani Belmansour Mustapha Nourelfath November 2008 CIRRELT-2008-53
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Submitted to imanufacturing & Service Operations Management manuscript MSOM-11-370.R3 Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement (Authors names blinded
More informationChapter 5. Elementary Performance Analysis
Chapter 5 Elementary Performance Analysis 1 5.0 2 5.1 Ref: Mischa Schwartz Telecommunication Networks Addison-Wesley publishing company 1988 3 4 p t T m T P(k)= 5 6 5.2 : arrived rate : service rate 7
More informationUNIVERSITY OF THESSALY DEPARTMENT OF MECHANICAL & INDUSTRIAL ENGINEERING COMPARATIVE MODELING OF MULTI-STAGE PRODUCTION-
UNIVERSITY OF THESSALY DEPARTMENT OF MECHANICAL & INDUSTRIAL ENGINEERING Postgraduate (Master's) Dissertation COMPARATIVE MODELING OF MULTI-STAGE PRODUCTION- INVENTORY CONTROL POLICIES WITH LOT SIZING
More informationThe Passport Control Problem or How to Keep an Unstable Service System Load Balanced?
The Passport Control Problem or How to Keep an Unstable Service System Load Balanced? A. ITAI Computer Science Department, Technion M. RODEH Computer Science Department, Technion H. SHACHNAI Computer Science
More informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
More informationDepartment 2 Power cut of A1 and A2
3.12. PROBLEMS 115 3.12 Problems Problem 3.1 A production system manufactures products A and B. Each product consists of two parts: A1 and A2 for product A and B1 and B2 for product B. The processing of
More informationAnalyzing Queuing Systems with Coupled Processors. through Semidefinite Programming
Analyzing Queuing Systems with Coupled Processors through Semidefinite Programming Balaji Rengarajan, Constantine Caramanis, and Gustavo de Veciana Dept. of Electrical and Computer Engineering The University
More informationSCHEDULING POLICIES IN MULTI-PRODUCT MANUFACTURING SYSTEMS WITH SEQUENCE-DEPENDENT SETUP TIMES
Proceedings of the 2011 Winter Simulation Conference S. Jain, R. R. Creasey, J. Himmelspach, K. P. White, and M. Fu, eds. SCHEDULING POLICIES IN MULTI-PRODUCT MANUFACTURING SYSTEMS WITH SEQUENCE-DEPENDENT
More informationProduction variability in manufacturing systems: Bernoulli reliability case
Annals of Operations Research 93 (2000) 299 324 299 Production variability in manufacturing systems: Bernoulli reliability case Jingshan Li and Semyon M. Meerkov Department of Electrical Engineering and
More informationA Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time
A Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time E. Ramesh Kumar 1, L. Poornima 2 1 Associate Professor, Department of Mathematics, CMS College of Science
More informationGeo (λ)/ Geo (µ) +G/2 Queues with Heterogeneous Servers Operating under FCFS Queue Discipline
American Journal of Applied Mathematics and Statistics, 5, Vol. 3, No., 54-58 Available online at http://pubs.sciepub.com/aams/3// Science and Education Publishing DOI:.69/aams-3-- Geo ()/ Geo () +G/ Queues
More informationStochastic Models of Manufacturing Systems
Stochastic Models of Manufacturing Systems Ivo Adan Systems 2/49 Continuous systems State changes continuously in time (e.g., in chemical applications) Discrete systems State is observed at fixed regular
More informationMaximizing throughput in zero-buffer tandem lines with dedicated and flexible servers
Maximizing throughput in zero-buffer tandem lines with dedicated and flexible servers Mohammad H. Yarmand and Douglas G. Down Department of Computing and Software, McMaster University, Hamilton, ON, L8S
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationPerformance Analysis of an M/M/c/N Queueing System with Balking, Reneging and Synchronous Vacations of Partial Servers
The Sixth International Symposium on Operations Research and Its Applications (ISORA 06) Xinjiang, China, August 8 12, 2006 Copyright 2006 ORSC & APORC pp. 128 143 Performance Analysis of an M/M/c/ Queueing
More informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement Wyean Chan DIRO, Université de Montréal, C.P. 6128, Succ. Centre-Ville, Montréal (Québec), H3C 3J7, CANADA,
More informationEE 368. Weeks 3 (Notes)
EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How
More informationQueue Decomposition and its Applications in State-Dependent Queueing Systems
Submitted to Manufacturing & Service Operations Management manuscript Please, provide the mansucript number! Authors are encouraged to submit new papers to INFORMS journals by means of a style file template,
More informationDynamic Control of Parallel-Server Systems
Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationThe discrete-time Geom/G/1 queue with multiple adaptive vacations and. setup/closedown times
ISSN 1750-9653, England, UK International Journal of Management Science and Engineering Management Vol. 2 (2007) No. 4, pp. 289-296 The discrete-time Geom/G/1 queue with multiple adaptive vacations and
More informationIncorporating the Effects of Traffic Signal Progression Into the Proposed Incremental Queue Accumulation (IQA) Method
#06-0107 Incorporating the Effects of Traffic Signal Progression Into the Proposed Incremental Queue Accumulation (IQA) Method Dennis W. Strong, President Strong Concepts 1249 Shermer Road, Suite 100 Northbrook,
More informationOptimal Cyclic Control of a Buffer Between Two Consecutive Non-Synchronized Manufacturing Processes
University of Wisconsin Milwaukee UWM Digital Commons Theses and Dissertations August 2015 Optimal Cyclic Control of a Buffer Between Two Consecutive Non-Synchronized Manufacturing Processes WenHuan Hsieh
More information