Winfried K. Grassmann - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2019

The distribution of the line length in a discrete time GI∕G∕1 queueWinfried K. Grassmann, Javad Tavakoli. pe, 131:43-53, 2019. [doi]

A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tailsWinfried K. Grassmann, Javad Tavakoli. infor, 57(2):286-295, 2019. [doi]

2016

Optimal policies of M(t)/M/c/c queues with two different levels of serversAli Tirdad, Winfried K. Grassmann, Javad Tavakoli. eor, 249(3):1124-1130, 2016. [doi]

2015

Using Multiple Runs in the Simulation of Stochastic Systems for Estimating Equilibrium ExpectationsWinfried K. Grassmann. simultech 2015: 138-144 [doi]

Multiple Runs in the Simulation of Stochastic Systems Can Improve the Estimates of Equilibrium ExpectationsWinfried K. Grassmann. simultech 2016: 35-48 [doi]

2014

Simulation and performance evaluation of the hadoop capacity schedulerJagmohan Chauhan, Dwight J. Makaroff, Winfried K. Grassmann. cascon 2014: 163-177 [doi]

Factors affecting warm-up periods in discrete event simulationWinfried K. Grassmann. simulation, 90(1):11-23, 2014. [doi]

Efficient Methods to find the Equilibrium Distribution of the Number of Customers in GI/M/c QueuesWinfried K. Grassmann, Javad Tavakoli. infor, 52(4):197-205, 2014. [doi]

2012

The Impact of Capacity Scheduler Configuration Settings on MapReduce JobsJagmohan Chauhan, Dwight J. Makaroff, Winfried K. Grassmann. cgc 2012: 667-674 [doi]

A Computer Built with Relays and a Mechanical Memory, and ALGOLWinfried K. Grassmann. cj, 55(11):1309-1316, 2012. [doi]

2011

Rethinking the initialization bias problem in steady-state discrete event simulationWinfried K. Grassmann. wsc 2011: 593-599 [doi]

2010

Comparing Some Algorithms for Solving QBD Processes Exhibiting Special StructuresWinfried K. Grassmann, Javad Tavakoli. infor, 48(3):133-141, 2010. [doi]

2009

When, and when not to use warm-up periods in discrete event simulationWinfried K. Grassmann. simutools 2009: 51 [doi]

Transient solutions for multi-server queues with finite buffersWinfried K. Grassmann, Javad Tavakoli. questa, 62(1-2):35-49, 2009. [doi]

2008

A case study of spark resource configuration and management for image processing applicationsOwolabi Adekoya, Habib Sabiu, Derek L. Eager, Winfried K. Grassmann, Dwight J. Makaroff. cascon 2018: 18-29 [doi]

Four Canadian Contributions to Stochastic ModelingWinfried K. Grassmann, Martin L. Puterman, Pierre L'Ecuyer, Armann Ingolfsson. infor, 46(1):3-14, 2008. [doi]

2007

A System Dynamics Approach to Study Virtual CommunitiesYan Mao, Julita Vassileva, Winfried K. Grassmann. hicss 2007: 178 [doi]

2005

Simulating markov-reward processes with rare eventsWinfried K. Grassmann, Jingxiang Luo. tomacs, 15(2):138-154, 2005. [doi]

Social Networks in Peer-to-Peer SystemsYamini Upadrashta, Julita Vassileva, Winfried K. Grassmann. hicss 2005: [doi]

2003

The Use of Eigenvalues for Finding Equilibrium Probabilities of Certain Markovian Two-Dimensional Queueing ProblemsWinfried K. Grassmann. informs, 15(4):412-421, 2003. [doi]

2002

An Eigenvalue Approach to Analyzing a Finite Source Priority Queueing ModelSteve Drekic, Winfried K. Grassmann. anor, 112(1-4):139-152, 2002. [doi]

A Tandem Queuewith a Movable Server: An Eigenvalue ApproachWinfried K. Grassmann, Javad Tavakoli. siammax, 24(2):465-474, 2002. [doi]

2001

Optimal service rates for the state-dependent M/G/1 queues in steady stateWinfried K. Grassmann, Xin Chen, Brij R. K. Kashyap. orl, 29(2):57-63, 2001. [doi]

2000

An analytical solution for a tandem queue with blockingWinfried K. Grassmann, Steve Drekic. questa, 36(1-3):221-235, 2000.

1996

Logic and discrete mathematics - a computer science perspectiveWinfried K. Grassmann, J. Paul Tremblay. Prentice Hall, 1996.

1995

Queueing Analysis of a Jockeying ModelYiqiang Zhao, Winfried K. Grassmann. ior, 43(3):520-529, 1995. [doi]

1993

Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating RowsWinfried K. Grassmann, Daniel P. Heyman. informs, 5(3):292-303, 1993. [doi]

Rounding errors in certain algorithms involving Markov chainsWinfried K. Grassmann. TOMS, 19(4):496-508, 1993. [doi]

1991

A Numerically Stable Algorithm for Two Server Queue ModelsY. Zhao, Winfried K. Grassmann. questa, 8(1):59-79, 1991.

1989

Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 QueueWinfried K. Grassmann, Joti L. Jain. ior, 37(1):141-150, 1989. [doi]

1988

Numerical solution for the departure process from the GI/G/1 queueJoti L. Jain, Winfried K. Grassmann. cor, 15(3):293-296, 1988. [doi]

1985

Regenerative Analysis and Steady State Distributions for Markov ChainsWinfried K. Grassmann, Michael I. Taksar, Daniel P. Heyman. ior, 33(5):1107-1116, 1985. [doi]

1983

Markov modellingWinfried K. Grassmann. wsc 1983: 613-619 [doi]

1982

Initial bias and estimation error in discrete event simulationWinfried K. Grassmann. wsc 1982: 377-384 [doi]

ErratumWinfried K. Grassmann. ior, 30(4):796, 1982. [doi]

1981

D/∞ Queueing SystemWinfried K. Grassmann. ior, 29(6):1208-1211, 1981. [doi]

1978

Transient solutions in Markovian Queueing SystemsWinfried K. Grassmann. cor, 5(2):161, 1978. [doi]

1977

Transient solutions in markovian queueing systemsWinfried K. Grassmann. cor, 4(1):47-53, 1977. [doi]

1969

Schätzung der Bestimmungsgründe von RangfolgenWinfried K. Grassmann. mmor, 13(4):247-257, 1969. [doi]

Sign in or sign up to see more results.

runs on WebDSL