Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 21 for “"Closed Queueing"”.

  1. Stochastic analyses arising from a new approach for closed queueing networks

    … are addressed for a number of problems in queueing systems and stochastic modeling that arose due to an investigation into techniques that could be used to approximate general closed networks. In Chapter II, a method is presented to calculate the system size distribution at an arbitrary …

    tamu Repository record for Stochastic analyses arising from a new approach for closed queueing networks (opens in a new tab)

  2. Essays on Design, Operation, and Pricing of On-Demand Service Systems

    … random) amount of time. We model the systems as closed queueing systems and provide non-asymptotic performance guarantees.

    umn Repository record for Essays on Design, Operation, and Pricing of On-Demand Service Systems (opens in a new tab)

  3. Strategic resource planning in healthcare under uncertainty : British Columbia Cancer Agency and Vancouver's Downtown Eastside

    … of system-level quantitative planning. We use a queueing network to model clients with complex concurrent disorders (CCD) flowing through services in Vancouver’s Downtown Eastside (DTES). We perform sensitivity analysis on the input parameters, validate our solution against a simulation model, …

    ubc Repository record for Strategic resource planning in healthcare under uncertainty : British Columbia Cancer Agency and Vancouver's Downtown Eastside (opens in a new tab) Download PDF for Strategic resource planning in healthcare under uncertainty : British Columbia Cancer Agency and Vancouver's Downtown Eastside (opens in a new tab)

  4. A model for a university timesharing computer

    … Level 66 computer system has been modelled by a closed queueing network consisting of a central CPU with disks and front end processors as the input-output devices. Terminal input proceeds through a front end processor. Data gathered from the system was used to find the mean device service times …

    carleton Repository record for A model for a university timesharing computer (opens in a new tab)

  5. Queueing analysis of two healthcare systems where physician activity is offloaded to supporting health professionals

    … patients. The second chapter presents a queueing and simulation approach to analyze the impact of an alternative care provider in a rheumatologist consultation system on waiting time and specialist utilization. Using a multi-class closed queueing network, we look into the boundaries for …

    calgary Repository record for Queueing analysis of two healthcare systems where physician activity is offloaded to supporting health professionals (opens in a new tab)

  6. Συστήματα παραγωγής και εξυπηρέτησης με ζήτηση που επηρεάζεται από την ικανοποίηση πελατών

    … optimization of this policy we use models from closed queueing network theory that have minimum computational demands. The numerical results indicate that the proposed threshold policy has a performance equally satisfying to the optimal policy.

    greece Repository record for Συστήματα παραγωγής και εξυπηρέτησης με ζήτηση που επηρεάζεται από την ικανοποίηση πελατών (opens in a new tab)

  7. Distributed control of computer communication systems

    … with three levels of flow control, based on closed queueing network theory. The flow control mechanisms considered are: end-to-end control of virtual circuits, network access control of external messages at the entry nodes and the hop level control between nodes. The model is solved by a …

    aston Download PDF for Distributed control of computer communication systems (opens in a new tab)

  8. Interconnection of X.25 networks

    … able to model our interconnected network as a closed queueing network with limited number of packets in transit within the network. Mean Value Analysis with Blocking (MVA) algorithm was applied to obtain the performance characteristics as the resources available were considered to have limited …

    njit Repository record for Interconnection of X.25 networks (opens in a new tab)

  9. Optimization schemes for queueing networks with applications to flexible manufacturing systems.

    Product-form queueing networks have been useful for modeling complex systems such as flexible manufacturing systems and computer systems. While the literature is rich with queueing models, little attention has been paid to the use of these models in optimization schemes. This dissertation addresses …

    arizona-thes Repository record for Optimization schemes for queueing networks with applications to flexible manufacturing systems. (opens in a new tab)

  10. A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types

    … we model the back-shop as a multi-class queueing network with a ConWIP execution system and introduce a new priority scheme to maximize the system performance. In this scheme, we identify the bottleneck machine based on overall workload and classify machines into two categories: the …

    utk-theses Repository record for A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types (opens in a new tab)

  11. Data delivery in fragmented wireless sensor networks using mobile agents

    … their role as relay stations is modeled using a closed queueing network approach, which is used to obtain steady state results. Building on these results, we derive the distributions of the fragment-to-fragment and fragment-to-sink delays. The results show that this model accurately captures the …

    iastate Repository record for Data delivery in fragmented wireless sensor networks using mobile agents (opens in a new tab)

  12. Analysis of delayed product differentiation under pull type policies

    … directly. These systems can be modeled as closed queueing networks in which a fixed number of kanbans circulate as customers among each set of one or more processing stages.;In this study, we first developed models to analyze the performance of simple kanban and CONstant-WIP (CONWIP) …

    iastate Repository record for Analysis of delayed product differentiation under pull type policies (opens in a new tab)

  13. Reversibility and flows in queueing networks

    … between the flows of customers in a queueing network whose queue length process is a Markov process. A flow is a stochastic process formed by embedding the queue length process at transitions corresponding to: customers arriving to the network at a node; customers departing the …

    vt Repository record for Reversibility and flows in queueing networks (opens in a new tab)

  14. Dynamical Modeling of Cloud Applications for Runtime Performance Management

    … In particular, we focus on modeling using queueing theory and on the fluid model for approximating the often intractable dynamics of the queue lengths. First, existing results on how the fluid model can be obtained from the mean-field approximation of a closed queueing network are …

    lund Repository record for Dynamical Modeling of Cloud Applications for Runtime Performance Management (opens in a new tab) Download PDF for Dynamical Modeling of Cloud Applications for Runtime Performance Management (opens in a new tab)

  15. Modelling and Data Analysis for the Design of Modern Urban Mobility

    This thesis has two parts. The first focuses on shared e-bike and e-scooter systems, which have become globally popular solutions for urban mobility.However, they introduce new operational challenges around charging and many charging mechanisms have been proposed (e.g. employees swapping batteries, …

    cornell Repository record for Modelling and Data Analysis for the Design of Modern Urban Mobility (opens in a new tab)

Page 1 of 2