<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>ResRec: A Multi-criteria Tool for Resource Recommendation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Michael Arias</string-name>
          <email>m.arias@uc.cl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eric Rojas</string-name>
          <email>eric.rojas@uc.cl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jonathan Lee</string-name>
          <email>wllee@uc.cl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jorge Munoz-Gama</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marcos Sepulveda</string-name>
          <email>marcos@ing.puc.cl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Department, School of Engineering Ponti cia Universidad Catolica de Chile</institution>
          ,
          <addr-line>Santiago</addr-line>
          ,
          <country country="CL">Chile</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Signi cance of Resource Recommendation for BPM</institution>
        </aff>
      </contrib-group>
      <fpage>17</fpage>
      <lpage>22</lpage>
      <abstract>
        <p>Dynamic resource allocation is considered a key aspect within business process management. Selecting the most suitable resources is a challenge for those in charge of making the allocation, because the e ciency with which this task is executed, can contribute to the quality of the results, and improve the process performance. Di erent mechanisms have been proposed to improve resource allocation. However, there is a need for more exible allocation methods that integrate a set of conditions and requirements de ned at run-time, and also, allow the combination of di erent criteria to evaluate resources. In this paper, we present ResRec, a novel Multi-factor Criteria tool that can be used to recommend and allocate resources dynamically. The tool provides the feature of solving individual requests (On-demand), or requests made in blocks (Batch) through a recommender system developed in ProM.</p>
      </abstract>
      <kwd-group>
        <kwd>resource allocation</kwd>
        <kwd>process mining</kwd>
        <kwd>business processes</kwd>
        <kwd>recommendation systems</kwd>
        <kwd>organizational perspective</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        whereas, a Nave Bayes Model approach has been proposed to select the best
performer to execute an activity based on the total completion time [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. There
is a need to optimize the task of allocating resources through methods that: i)
support resource allocation at run-time; ii) use di erent criteria to evaluate
resources, combining process information with other additional information (e.g.,
resource characteristics); iii) execute the allocation considering di erent
abstraction levels (e.g., activity, sub-process, or process level); and iv) support di erent
decision strategies faced by the person in charge of making the allocation in their
daily processes. In this paper, we present ResRec, a novel multi-criteria tool to
allocate/recommend resources dynamically. The tool combines di erent
criteria to assess resources, allows the de nition at run-time of individual requests
(On-demand) or requests made in blocks (Batch), and provides distinct decision
alternatives {a decision maker-oriented approach{. The remainder of the article
is structured as follows. Section 2 introduces concepts related with the ResRec
framework for resource allocation/recommendation. In Section 3 we present the
details about the ResRec implementation. Section 4 presents a demonstration of
the tool and its functionality. Finally, Section 5 presents the work conclusions.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>The Resource Recommendation Framework</title>
      <p>The proposed framework for allocating/recommending the most suitable
resources for executing activities in a business process is shown in Figure 1. For
allocation we mean selecting the most appropriate resource. For
recommendation we mean retrieving a ranking of the most suitable resources that could
be considered by the person in charge of the allocation. The user responsible
for undertaking the allocation speci es the characterization of a resource
allocation/recommendation. This characterization is integrated by di erent factors
that represent the desired request properties, e.g., what part of the process is the
resource request for or what speci c characteristic the process instance has. For
example, in a Help-Desk process, Contact level 1 English are two factors that
can characterize a request. Resources are evaluated considering several criteria:
frequency, performance, quality, cost, expertise and workload. Furthermore,
speci c weights are de ned according to the importance level that the responsible
wants to give to each criterion.</p>
      <p>
        We use an information repository to store the resource contextual data (e.g.,
expertise), and the historical information about past process execution (e.g.,
frequency, performance, quality, and cost). We created a knowledge base, where
we use a Resource Process Cube to abstract at a conceptual level (not at an
implementation level) the historical information, and expertise matrices to
represent the expertise of a resource and the desired level of expertise required
to execute a given characterization. Each available resource to execute a given
characterization is evaluated considering di erent criteria, which are computed
across several metrics de ned in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The de nition of the Resource Process
Cube is closer to the well-known OLAP cubes, providing slice and dice
operations for the analysis of each speci c characterization and resource. We propose
REQUEST
      </p>
      <p>WEIGHTS</p>
      <p>
        Resource Resource
Allocation Recommendation
four use cases: 1) On-demand Resource Allocation: a resource is allocated to a
single request; 2) On-demand Resource Recommendation: a ranked list of
resources is recommended for a single request; 3) Batch Resource Allocation: a
batch of requests is evaluated, and a resource is allocated to each of them; and
4) Batch Resource Recommendation: a batch of requests is considered, and a
ranked list of resource tuples is recommended to perform all requests. We use
a recommender system that uses two methods to allocate/recommend the most
suitable resources: a method based on Integer Linear Programming (to support
On-demand or Batch Resource Allocation), and a method based on the Best
Position Algoritm (BPA2) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] (to support On-demand or Batch Resource
Recommendation). The details about the proposed methods and the implementation
will be published shortly [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>ResRec: The Tool</title>
      <p>To perform a dynamic resource allocation/recommendation, the ResRec tool
provides two plugins implemented in ProM: 1) GenerateResourceKnowledge,
and 2) Recommend Resources. Both plugins are available in the Resource
Recommendation package in the open-source framework ProM (available in ProM
nightly-builds 2).
3.1</p>
      <sec id="sec-3-1">
        <title>Generate Resource Knowledge</title>
        <p>To use the ResRec tool, we have rst to import the information (contextual and
historical) needed for the decision making within the framework (Figure 2a). For
this purpose, we created a standardized format to store the information that is
2 www.promtools.org/prom6/nightly
considered. ResRec includes an extension to the Java OpenXES library 3 that
allows to standardize and manipulate the information that is used to generate
the required knowledge. Using the GenerateResourceKnowledge plugin
(Figure 2b), the di erent criteria are evaluated through di erent metrics, generating
the resource knowledge.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Recommend Resources</title>
        <p>Based on the resource knowledge, we apply the RecommendResources plugin
(Figure 2c). This plugin allows the con guration of the required parameters to
obtain the nal allocation/recommendation. Figure 2d shows the needed con
guration. First, the person in charge of making the allocation must decide which
method wants to perform: resource allocation (single resource), or resource
recommendation (a ranking of resources). Then, the person in charge speci es the
amount of requests for each type of available characterizations (On-demand for
1 request, Batch for 2 or more requests). After that, weights are de ned to
describe the importance of each criterion considered in the framework. Finally,
the recommender system computes the allocation/recommendation (Figure 2e)
according with the chosen con guration, showing as an output the resource(s)
allocated/recommended for each request.</p>
        <p>Note that the ResRec tool is designed to be generic and extensible, being able
to incorporate new criteria to evaluate the resources, so as to make the resource
allocation a more e ective task. Moreover, the framework can be adapted to be
used in any domain or scenario.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Demonstration</title>
      <p>A screencast that demonstrates the usage of the ResRec tool is available on the
web (http://is.ing.uc.cl/dcc/index.php/resrec/). The screencast shows the steps
followed to generate the resource allocation/recommendation considering the use
cases introduced in Section 2. We used a Help-Desk process as a running example.
First, we add the contextual and the historical information required to evaluate
the resources. Then, we create the knowledge base needed to perform the resource
recommendation. After that, we con gure the corresponding parameters in order
to generate a Batch Resource Recommendation, de ning a batch of requests and
the weights describing the importance of each criterion. We show the obtained
results by applying the method based on BPA2, performing a Batch Resource
Recommendation. Additional to the Batch Resource Recommendation, the other
three use cases outlined are also presented. Furthermore, we used the ResRec
tool to recommend resources in a real life scenario. The case study included the
resource allocation/recommendation for a consulting rm specializing in the sale
of business software solutions in Costa Rica, based on its help-desk process.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>We presented ResRec, a multi-criteria tool that consider historical and
contextual information to allocate/recommend the most suitable resources to execute
either a single request or a batch of requests, de ned at run-time. To obtain the
nal recommendation, we propose a recommender system that use two methods:
1) Resource allocation based on Integer Linear Programming, and 2) Resource
recommendation based on the Best Position Algorithm (BPA2). This tool also
has been tested through a real-life help desk scenario of a software consulting
company that handles a management solution developed for the automotive
industry named DMS-One SAP system. We considered a event log with 1.778 cases
registered between August and November 2015. As a future work, we may
consider integrating a greedy-based approach as an alternative method to produce a
Batch Resource Recommendation with several requests that need to be resolved
simultaneously. We also plan to evaluate the incorporation of new criteria to
enrich the knowledge base available to determine the most suitable resources.
Finally, we aim to apply the framework to allocate/recommend resources with
more case studies.</p>
      <p>Acknowledgments. This project was partially supported by the Ph.D.
Scholarship Program of CONICYT Chile (CONICYT-Doctorado Nacional 2014
63140181), Universidad de Costa Rica Professor Fellowships, and by Fondecyt
(Chile) Project No.1150365.</p>
      <p>Arias et al.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          : Process Mining - Data Science in Action,
          <source>Second Edition</source>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Akbarinia</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pacitti</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valduriez</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Best position algorithms for e cient top-k query processing</article-title>
          .
          <source>Inf. Syst</source>
          .
          <volume>36</volume>
          (
          <issue>6</issue>
          ),
          <volume>973</volume>
          {
          <fpage>989</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Arias</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Munoz-Gama</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sepulveda</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carmona</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miranda</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          :
          <article-title>On-demand and batch resource allocation/recommendation based on multi-factor criteria</article-title>
          .
          <source>(under revision)</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Arias</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rojas</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Munoz-Gama</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sepulveda</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A framework for recommending resource allocation based on process mining</article-title>
          .
          <source>In: BPM Workshops</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , van der Aalst,
          <string-name>
            <given-names>W.M.P.</given-names>
            ,
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Duan</surname>
          </string-name>
          , H.:
          <article-title>Reinforcement learning based resource allocation in business process management</article-title>
          .
          <source>DKE</source>
          <volume>70</volume>
          (
          <issue>1</issue>
          ),
          <volume>127</volume>
          {
          <fpage>145</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Wibisono</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nisafani</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bae</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Park</surname>
          </string-name>
          , Y.:
          <article-title>On-the- y performance-aware human resource allocation in the business process management systems environment using nave bayes</article-title>
          .
          <source>In: AP-BPM 2015</source>
          . pp.
          <volume>70</volume>
          {
          <issue>80</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Process mining from the organizational perspective</article-title>
          .
          <source>In: Foundations of Intelligent Systems</source>
          , pp.
          <volume>701</volume>
          {
          <issue>708</issue>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>