@article {18347,
	title = {The state-dependent M / G / 1 queue with orbit.},
	journal = {Queueing Systems},
	volume = {90},
	year = {2018},
	pages = {89-123},
	abstract = {<span>We consider a state-dependent single-server queue with orbit. This is a versatile model for the study of service systems, where the server needs a non-negligible time to retrieve waiting customers every time he completes a service. This situation arises typically when the customers are not physically present at a system, but they have a remote access to it, as in a call center station, a communication node, etc. We introduce a probabilistic approach for the performance evaluation of this queueing system, that we refer to as the queueing and Markov chain decomposition approach. Moreover, we discuss the applicability of this approach for the performance evaluation of other non-Markovian service systems with state dependencies.</span>},
	url = {https://link.springer.com/article/10.1007/s11134-018-9582-1},
	author = {Baron, O. and Economou, A. and Manou, A.}
}
