M/G/k with staggered setup
From MaRDI portal
Publication:2450656
DOI10.1016/J.ORL.2013.03.006zbMATH Open1286.90029OpenAlexW2587183101MaRDI QIDQ2450656FDOQ2450656
Authors: Anshul Gandhi, Mor Harchol-Balter
Publication date: 14 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.03.006
Recommendations
- $M / G / \infty$ with exponentially distributed setup times
- \(M/G/1\) queue with multiple vacations and server set-up and close-down times
- Multiserver queues with finite capacity and setup time
- The \(M/M/c\) queue with \((e,d)\) setup time
- Analyses of a single vacation M/G/1 queue with server's immediately setup-time after ending vacation
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
Cited In (5)
- Maximum weight matching with hysteresis in overloaded queues with setups
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- $M / G / \infty$ with exponentially distributed setup times
- Batch arrival multiserver queue with state-dependent setup for energy-saving data center
- Optimal energy-efficient policies for data centers through sensitivity-based optimization
This page was built for publication: \(M/G/k\) with staggered setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450656)