{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,28]],"date-time":"2024-01-28T01:36:18Z","timestamp":1706405778482},"reference-count":29,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Coop. Info. Syst."],"published-print":{"date-parts":[[2013,6]]},"abstract":" Business process (BP) models are usually defined manually by business analysts through imperative languages considering activity properties, constraints imposed on the relations between the activities as well as different performance objectives. Furthermore, allocating resources is an additional challenge since scheduling may significantly impact BP performance. Therefore, the manual specification of BP models can be very complex and time-consuming, potentially leading to non-optimized models or even errors. To overcome these problems, this work proposes the automatic generation of imperative optimized BP models from declarative specifications. The static part of these declarative specifications (i.e. control-flow and resource constraints) is expected to be useful on a long-term basis. This static part is complemented with information that is less stable and which is potentially unknown until starting the BP execution, i.e. estimates related to (1) number of process instances which are being executed within a particular timeframe, (2) activity durations, and (3) resource availabilities. Unlike conventional proposals, an imperative BP model optimizing a set of instances is created and deployed on a short-term basis. To provide for run-time flexibility the proposed approach additionally allows decisions to be deferred to run-time by using complex late-planning activities, and the imperative BP model to be dynamically adapted during run-time using replanning. To validate the proposed approach, different performance measures for a set of test models of varying complexity are analyzed. The results indicate that, despite the NP-hard complexity of the problems, a satisfactory number of suitable solutions can be produced. <\/jats:p>","DOI":"10.1142\/s0218843013500093","type":"journal-article","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T08:52:17Z","timestamp":1381913537000},"page":"1350009","source":"Crossref","is-referenced-by-count":9,"title":["AUTOMATIC GENERATION OF OPTIMIZED BUSINESS PROCESS MODELS FROM CONSTRAINT-BASED SPECIFICATIONS"],"prefix":"10.1142","volume":"22","author":[{"given":"IRENE","family":"BARBA","sequence":"first","affiliation":[{"name":"Dpto. Lenguajes y Sistemas Inform\u00e1ticos, University of Seville, Avda Reina Mercedes s\/n, Seville, 41012, Spain"}]},{"given":"CARMELO","family":"DEL VALLE","sequence":"additional","affiliation":[{"name":"Dpto. Lenguajes y Sistemas Inform\u00e1ticos, University of Seville, Avda Reina Mercedes s\/n, Seville, 41012, Spain"}]},{"given":"BARBARA","family":"WEBER","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Innsbruck, Technikerstra\u00dfe 21a, Innsbruck, 6020, Austria"}]},{"given":"ANDR\u00c9S","family":"JIM\u00c9NEZ","sequence":"additional","affiliation":[{"name":"Dpto. Lenguajes y Sistemas Inform\u00e1ticos, University of Seville, Avda Reina Mercedes s\/n, Seville, 41012, Spain"}]}],"member":"219","published-online":{"date-parts":[[2013,11,14]]},"reference":[{"key":"rf1","volume-title":"Business Process Management: Concepts, Languages Architectures","author":"Weske M.","year":"2007"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/0471741442"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(03)00102-6"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36615-6"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1142\/S0218843006001463"},{"key":"rf16","volume-title":"Automated Planning: Theory and Practice","author":"Ghallab M.","year":"2004"},{"key":"rf17","volume-title":"Complex Scheduling (GOR-Publications)","author":"Brucker P.","year":"2006"},{"key":"rf18","volume-title":"Handbook of Constraint Programming","author":"Rossi F.","year":"2006"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-008-0188-z"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30409-5"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-009-0057-9"},{"key":"rf30","first-page":"1","volume":"4184","author":"van der Aalst W. M. P.","year":"2006","journal-title":"LNCS"},{"key":"rf33","doi-asserted-by":"publisher","DOI":"10.1145\/182.358434"},{"key":"rf35","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf39","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00354-1"},{"key":"rf41","volume-title":"Dynamic Programming","author":"Bellman R.","year":"1957"},{"key":"rf43","doi-asserted-by":"publisher","DOI":"10.1145\/295666.295687"},{"key":"rf44","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(01)00039-5"},{"key":"rf45","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.02.007"},{"key":"rf46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9790-6_6"},{"key":"rf47","doi-asserted-by":"publisher","DOI":"10.1007\/s10796-008-9145-9"},{"key":"rf48","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2010.04.001"},{"key":"rf51","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.05.027"},{"key":"rf53","doi-asserted-by":"publisher","DOI":"10.1142\/S0218843009002038"},{"key":"rf55","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.007"},{"key":"rf57","first-page":"45","volume":"5","author":"Rychkova I.","year":"2008","journal-title":"Int. J. Comput. Sci. Appl."},{"key":"rf60","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.09.001"},{"key":"rf61","doi-asserted-by":"publisher","DOI":"10.1145\/1658373.1658376"},{"key":"rf64","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-008-7030-7"}],"container-title":["International Journal of Cooperative Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218843013500093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:36:03Z","timestamp":1565094963000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218843013500093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":29,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2013,11,14]]},"published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1142\/S0218843013500093"],"URL":"http:\/\/dx.doi.org\/10.1142\/s0218843013500093","relation":{},"ISSN":["0218-8430","1793-6365"],"issn-type":[{"value":"0218-8430","type":"print"},{"value":"1793-6365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}
