Queueing models with delayed state-dependent service times
Article Abstract:
An alternative queueing model is considered where the server changes its service rates or service types only at the beginning of service. It is an alternative to state-dependent queueing models where the service rate is adjusted at both periods of customer arrivals and departures. An embedded Markov chain technique is used to determine the probability generating function of the steady-state queue length. The delayed M/M/c queue and the delayed M/Gi/1 queue with c service types are compared with regular queues, particularly in terms of mean queue length and additional waiting time.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Optimizing flow rates in a queueing network with side constraints
Article Abstract:
Ford and Fulkerson's labeling algorithm and out-of-kilter algorithm solve modified forms of the classical deterministic maximum flow and minimum cost network flow problems in a stochastic queueing environment, respectively. The models aim to either maximize throughput rate in the network or to minimize the cost if a given flow in the network so that for each arc of the network, the resulting probability of finding congestion along that arc in excess of a desirable threshold does not exceed an acceptable value.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Queueing models for performance analysis: selection of single station models (Feature Issue: Warehouse Design and Operation)
Article Abstract:
Five approximation models for the single-station queue with finite buffers and general arrival and service processes are compared. The effect of queue parameters on performance estimates are analyzed using computer simulation. Results show that the diffusion approximation of Gelenbe yielded the best approximations and seemed less biased than the other models.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Provision of services: Balancing access to historic churches for disabled people with protection of the fabric can be a major design challenge
- Abstracts: Multi-echelon systems: a service measure perspective. A model for a mixed continuous-periodic review one-warehouse, n-retailer inventory system
- Abstracts: The threat looming over our schools: the dependency of funding on research criteria is placing an unfair burden on schools of architecture
- Abstracts: Planning outlines or battle lines? Planning advice: we look at the implications for architects of likely developments in housebuilding, and at the European Spatial Development Perspective
- Abstracts: Stuttgart digs deep for cathedral for the train. Controlling the unknown for towering achievement. Nervi's mastery of art in reinforced concrete. (Concrete Quarterly)