2014
DOI: 10.1007/978-3-319-07881-6_4
|View full text |Cite
|
Sign up to set email alerts
|

Queue Mining – Predicting Delays in Service Processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
43
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 72 publications
(46 citation statements)
references
References 20 publications
0
43
0
Order By: Relevance
“…The number of resources as function of time, R t , is extracted from data using statistical methods as reported in [20]. The distribution of interarrival times A t and processing times per class B c can be fitted with the techniques presented in [16,21].…”
Section: Discovery Of Fork/join Networkmentioning
confidence: 99%
See 3 more Smart Citations
“…The number of resources as function of time, R t , is extracted from data using statistical methods as reported in [20]. The distribution of interarrival times A t and processing times per class B c can be fitted with the techniques presented in [16,21].…”
Section: Discovery Of Fork/join Networkmentioning
confidence: 99%
“…In earlier work, therefore, we argued for an explicit representation of the queueing perspective and demonstrated its value for several real-world processes [20,22]. However, the existing techniques all considered the simplistic setting of a singlestation system, whereas, this paper addressed the more complex scenario of service processes that are scheduled and have a multi-stage structure that involves resource synchronization.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…This paper is an extended and revised version of our earlier work [7] that focused on single-class settings only. In this work, we also consider the more complex setup of multi-class settings.…”
Section: Introductionmentioning
confidence: 99%