Assembly systems with non-exponential machines : Throughput and bottlenecksSHINUNG CHING; MEERKOV, Semyon M; LIANG ZHANG et al.Nonlinear analysis. 2008, Vol 69, Num 3, pp 911-917, issn 0362-546X, 7 p.Article

An approximate analytical method for evaluating the performance of closed-loop flow systems with unreliable machines and finite buffersGERSHWIN, Stanley B; WERNER, Loren M.International journal of production research. 2007, Vol 45, Num 14, pp 3085-3111, issn 0020-7543, 27 p.Article

On the packet loss overhead in buffer-limited ad hoc networksYANG XU; MIN SHENG; JIA LIU et al.Wireless networks. 2014, Vol 20, Num 6, pp 1653-1667, issn 1022-0038, 15 p.Article

Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policiesNINO-MORA, Jose.European journal of operational research. 2012, Vol 220, Num 3, pp 705-715, issn 0377-2217, 11 p.Article

Properties and performance modelling of finite buffer M/G/1/K networksMACGREGOR SMITH, J.Computers & operations research. 2011, Vol 38, Num 4, pp 740-754, issn 0305-0548, 15 p.Article

Discrete-time Geo^X/G^(a,b)/1/N queues with single and multiple vacationsSAMANTA, S. K; CHAUDHRY, M. L; GUPTA, U. C et al.Mathematical and computer modelling. 2007, Vol 45, Num 1-2, pp 93-108, issn 0895-7177, 16 p.Article

Finite buffer analysis of multistage interconnection networksJIANXUN DING; BHUYAN, L. N.IEEE transactions on computers. 1994, Vol 43, Num 2, pp 243-247, issn 0018-9340Article

An ATM statistical multiplexer with on/off sources and spacing: numerical and analytical performance studiesYIJON XIONG; STEYAERT, B; BRUNEEL, H et al.Performance evaluation. 1994, Vol 21, Num 1-2, pp 37-58, issn 0166-5316Article

Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policyKAVUSTURUCU, A; GUPTA, S. M.Computers & operations research. 1999, Vol 26, Num 13, pp 1267-1292, issn 0305-0548Article

Variance of the output as a function of time : Production line dynamicsTAN, B.European journal of operational research. 1999, Vol 117, Num 3, pp 470-484, issn 0377-2217Article

BMAP/G/1/N queue with vacations and limited service disciplineBANIK, A. D; GUPTA, U. C; PATHAK, S. S et al.Applied mathematics and computation. 2006, Vol 180, Num 2, pp 707-721, issn 0096-3003, 15 p.Article

ASPECTS OF IMPATIENCE IN A FINITE BUFFER QUEUEPALLABI, Medhi; CHOUDHURY, Amit.RAIRO. Recherche opérationnelle. 2012, Vol 46, Num 3, pp 189-209, issn 0399-0559, 21 p.Article

An investigation of cooperative dispatching for minimising mean flowtime in a finite-buffer-capacity dynamic flowshopEL-BOURI, Ahmed; NAIRY, Subrahmanya.International journal of production research. 2011, Vol 49, Num 6-8, pp 1785-1800, issn 0020-7543, 16 p.Article

Characterizing losses during busy periods in finite buffer systemsPEKÖZ, Erol A; RIGHTER, Rhonda; XIA, Cathy H et al.Journal of applied probability. 2003, Vol 40, Num 1, pp 242-249, issn 0021-9002, 8 p.Article

Accurate formulae for the loss probability evaluation in a large class of queueing systemsBAIOCCHI, A.Performance evaluation. 1993, Vol 18, Num 2, pp 125-132, issn 0166-5316Article

Performance bounds on multiserver exponential tandem queues with finite buffersSO, K. C; CHIN, K.-T. E.European journal of operational research. 1992, Vol 63, Num 3, pp 463-477, issn 0377-2217Article

Complete analysis of finite and infinite buffer GI/MSP/1 queue : A computational approachGUPTA, U. C; BANIK, A. D.Operations research letters. 2007, Vol 35, Num 2, pp 273-280, issn 0167-6377, 8 p.Article

Optimum scheduling and memory management in input queued switches with finite buffer spaceSARKAR, Saswati.IEEE transactions on information theory. 2004, Vol 50, Num 12, pp 3197-3220, issn 0018-9448, 24 p.Article

On Effectiveness of Application-Layer CodingCHOI, Yoojin; MOMCILOVIC, Petar.IEEE transactions on information theory. 2011, Vol 57, Num 10, pp 6673-6691, issn 0018-9448, 19 p.Article

SOME ASPECTS OF BALKING AND RENEGING IN FINITE BUFFER QUEUESCHOUDHURY, Amit; MEDHI, Pallabi.RAIRO. Recherche opérationnelle. 2011, Vol 45, Num 3, pp 223-240, issn 0399-0559, 18 p.Article

Finite buffer vacation models under E-limited with limit variation service and Markovian arrival processBANIK, A. D; GUPTA, U. C; PATHAK, S. S et al.Operations research letters. 2006, Vol 34, Num 5, pp 539-547, issn 0167-6377, 9 p.Article

A Brownian model for multiclass queueing networks with finite buffersWANYANG DAI.Journal of computational and applied mathematics. 2002, Vol 144, Num 1-2, pp 145-160, issn 0377-0427Conference Paper

Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approachNINO-MORA, José.Mathematical programming. 2002, Vol 93, Num 3, pp 361-413, issn 0025-5610, 53 p.Article

Computing queue length distributions in MAP/G/1/N queue under single and multiple vacationGUPTA, U. C; SIKDAR, Karabi.Applied mathematics and computation. 2006, Vol 174, Num 2, pp 1498-1525, issn 0096-3003, 28 p.Article

Modeling of loosely coupled scatternets with finite buffersMISIE, Vojislav B; MISIE, Jelena; GONAPATI RAJASHEKAR REDDY et al.Simulation (San Diego, Calif.). 2005, Vol 81, Num 8, pp 561-570, issn 0037-5497, 10 p.Conference Paper