INFORMATION CHANGE THE WORLD

International Journal of Intelligent Systems and Applications(IJISA)

ISSN: 2074-904X (Print), ISSN: 2074-9058 (Online)

Published By: MECS Press

IJISA Vol.5, No.1, Dec. 2012

Dynamic Programming and Genetic Algorithm for Business Processes Optimisation

Full Text (PDF, 321KB), PP.44-51


Views:103   Downloads:1

Author(s)

Mateusz Wibig

Index Terms

Petri Nets, Business Process Improvement, Simulation Based Optimization, Genetic Algorithm

Abstract

There are many business process modelling techniques, which allow to capture features of those processes, but graphical, diagrammatic models seems to be used most in companies and organizations. Although the modelling notations are more and more mature and can be used not only to visualise the process idea but also to implement it in the workflow solution and although modern software allows us to gather a lot of data for analysis purposes, there is still not much commercial used business process optimisation methods. 
In this paper the scheduling / optimisation method for automatic task scheduling in business processes models is described. The Petri Net model is used, but it can be easily applied to any other modelling notation, where the process is presented as a set of tasks, i.e. BPMN (Business Process Modelling Notation). 
The method uses Petri Nets’, business processes’ scalability and dynamic programming concept to reduce the necessary computations, by revising only those parts of the model, to which the change was applied.

Cite This Paper

Mateusz Wibig,"Dynamic Programming and Genetic Algorithm for Business Processes Optimisation", IJISA, vol.5, no.1, pp.44-51, 2013.DOI: 10.5815/ijisa.2013.01.04

Reference

[1]W.J. Kettinger, J.T.C. Teng and S. Guha. Business process change: A study of methodologies, techniques and tools. MIS Quartely., Vol. 21, 1997. 

[2]N. Melao and M. Pidd. A conceptual framework for understanding business process modeling. Information Systems, Vol. 10, 2000.

[3]K. Vergidis, A. Tiwari and B. Majeed. Business process analysis and optimisation: beyond reengineering. IEEE Transactions on Systems, Man and Cybernetics – Part C: Application and Reviews, Vol. 38, 2008.

[4]W.M.P van der Aalst, A.H.M ter Hofstede, B. Kiepuszewski and A.P. Barros. Advanced workflow patterns. Proceedings of 7th International Conference on Cooperative Information Systems, Berlin 2000.

[5]Y. Cheung and J. Bal. Process analysis techniques and tools for business improvements. Business Process Management, Vol. 4, 1998.

[6]D. Grigori, F. Casati, M. Castellanos, U. Dayal, M. Sayal and M.C. Shan. Business process intelligence. Computers in Industry, Vol. 53, 2004.

[7]T. Weijters and W.M.P. van der Aalst. Process mining: discovering workflow models from event-based data. Proceedings of 13th Belgium-Netherlands Conference on Artificial Intelligence, 2001.

[8]I. Hofacker and R. Vetschera. Algorithmical approaches to business process design. Computers & Operations Research, Vol. 28, 2001.

[9]Y. Zhou and Y Chen. Project-oriented business process performance optimization. Proceedings of Industrial Electronics Conference, 2003.

[10]A. Tiwari, K. Vergidis, and B. Majeed. Evolutionary multi-objective optimisation of business processes, in Proc. IEEE Congress of Evolutionary Computations, Jul. 2006, pp. 3091–3097

[11]F. Niedermann and H. Schwarz. Deep business optimisation: making business process optimisation theory work in practice. Lecture Notes in Business Information Processing, Vol. 81, 2011.

[12]W. Ruml, M.B. Do, R. Zhou and M.P.J. Fromherz. On-line planning and scheduling: an application to controlling modular printers. Journal of Artificial Intelligence Research, Vol. 40, 2011.

[13]W. Sadiq and M. Orłowska. Analyzing process models using graph reduction techniques. Information Systems, Vol. 25, 2000.

[14]W.M.P. van der Aalst, A. Hirnschall and H.M.W. Verbeek. An alternative way to analyse workflow graphs. Lecture Notes in Computer Science, Vol. 2348, 2002.

[15]J.L. Rummel, Z. Walter, R. Dewan and A. Seidmann. Activity consolidation to improve responsiveness. European Journal of Operations Research, Vol 134, 2001.

[16]R. Dewan, A. Siedmann and Z. Walter. Workflow optimization through task redesign in business information processes. Proceedings of Hawaii Internationl Conference of System Science, 1998.

[17]M.T. Wynn, H.M.W. Verbeek, W.M.P. van der Aalst, A.H.M. ter Hofstede and D. Edmond. Reduction rules for YAWL workflows with cancellation regions and OR-join. Information Software Technology, Vol. 51, 2009.

[18]M. Koubarakis and D. Plexousakis. A formal framework for business process modelling and design. Information Systems, Vol. 27, 2002.

[19]P. Köchel. Solving logistic problems through simulation and evolution. Proceedings of the 7th International Symposium on Operational Research, Ljubljana 2003.

[20]K. Deb, S. Agrawal, A. Pratap and T. Meyarivan. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimisation: NSGA-II. IEEE Transactions on Evolutionary Computations, Vol. 6, 2002.

[21]A. Smith. The Wealth of Nations, 1776.

[22]E.J. Macias and M.M.P. de la Parte. Simulation and optimization of logistic and production systems using discrete and continuous Petri nets. Simulation, Vol. 80, 2005.

[23]G. Rudolph. Evolutionary search under partially ordered sets. Technical Report No CI-67/99, Dortmund: Department of Computer Science/LS11, University of Dortmund, Germany, 1999

[24]M. Wibig. Optimization of projects logistics processes using Petri Nets. Proceedings of XII System Modelling and Control Conference in Polish Journal of Environmental Studies, 2008.