The purpose of this work is to provide simulation-based support for making optimal (or near-optimal) decisions in situations where decision makers are faced with imperfect information. We develop several novel techniques and algorithms for simulation-based optimization and decision support and apply them to two categories of problems: (i) Unmanned Aerial Vehicle (UAV) path planning in search operations, and; (ii) optimization of business process models. Common features of these two problems for which analytical approaches are not available, are the presence of imperfect information and their inherent complexity. In the UAV path planning problem, the objective is to define the path of a UAV searching for a target on a known road network. It is assumed that the target is moving toward a goal and we have some uncertain information about the start point of the target, its velocity, and the final goal of the target. The target does not take evasive action to avoid being detected. The UAV is equipped with a sensor, which may detect the target once it is in the sensor’s scope. Nevertheless, the detection process is uncertain and the sensor is subject to both false-positive and false-negative errors. We propose three different solutions, two of which are simulation-based. The most promising solution is an on-line simulation-based method that estimates the location of the target by using a Sequential Monte Carlo (SMC) method. During the entire mission, different UAV paths are simulated and the one is chosen that most reduces the uncertainty about the location of the target. In the optimization of the business process models, several different but related problems are addressed: (i) we define a measure of performance for a business process model based on the value added by agents (employees) to the process; (ii) we use this model for optimization of the business process models. Different types of processes are distinguished and methods for finding the optimal or near-optimal solutions are provided; (iii) we propose a model for estimating the performance of collaborative agents. This model is used to solve a class of Assignment Problems (AP), where tasks are assigned to collaborative agents; (iv) we propose a model for team activity and the performance of a team of agents. We introduce different collaboration strategies between agents and a negotiation algorithm for resolving conflicts between agents. We compare the effect of different strategies on the output of the team. Most of the studied cases are complex problems for which no analytical solution is available. Simulation methods are successfully applied to these problems. They are shown to be more general than analytical models for handling uncertainty since they usually have fewer assumptions and impose no restrictions on the probability distributions involved. Our investigation confirms that simulation is a powerful tool for providing decision-making support. Moreover, our proposed algorithms and methods in the accompanying articles contribute to providing support for making optimal and in some cases near-optimal decisions: (i) our tests of the UAV simulation-based search methods on a simulator show that the on-line simulation method has generally a high performance and detects the target in a reasonable time. The performance of this method was compared with the detection time when the UAV had the exact information about the initial location of the target, its velocity, and its path (minimum detection time). This comparison indicated that the online simulation method in many cases achieved a near-optimal performance in the studied scenario; (ii) our business process optimization framework combines simulation with the Hungarian method and finds the optimal solution for all cases where the assignment of tasks does not change the workflow of the process. For the most general cases, where the assignment of tasks may change the workflow, we propose an algorithm that finds near-optimal solutions. In this algorithm, simulation, which deals with the uncertainty in the process, is combined with the Hungarian method and hill-climbing heuristics. In the study of assigning tasks to collaborative agents we suggest a Genetic Algorithm (GA) that finds near-optimal solutions with a high degree of accuracy, stability, scalability and robustness. While investigating the effect of different agent strategies on the output of a team, we find that the output of a team is near-optimal, when agents choose a collaboration strategy that follows the principle of least effort (Zipf’s law) and use our suggested algorithm for negotiation and resolving conflicts. / QC 20111202

This thesis is focused on optimizing business processes in an environment of LIMAL (CZ). The aim of my work is to analyze and present the company processes and design new processes, which will be used to make the necessary adjustments in the information system and in the working practices of individual employees. The work is divided into two parts, theoretical and practical. The theoretical part describes the issue of business processes and their classification. Furthermore, usual methods which can be used to optimize business processes. The practical part is focused on optimizing the most important processes in LIMAL (CZ) s.r.o. First part clarify the company's activities and its specifics. To better understand the environment in which business operates, I present an Porter's analysis of competitive environment. The following part is an overview of each company's internal processes, and description of their current status and deficiencies, and proposed a new procedure, including the benefits that the deployment will bring. The work will serve as a reference for implementation of necessary changes in the information system and working practices of employees.

Work theoretically and practically deals with process management - the process analysis and optimization of business processes in the company. The theoretical part describes the process control and its features and benefits, describes the term of process and the types of processes. The theoretical part also describes the theoretical basis of process analysis. At the end of the theoretical part is the explanation of the concept of business process optimization. In the practical part at first author presents company, which then performs a SWOT analysis of the company. Furthermore, in the practical part is a process analysis of selected business processes in EPC notation. After the analysis, followed by optimization - improve the business processes. The last point of this work is the evaluation of work and conclusion.

Business process reengineering (BPR) was analyzed as one of the approaches to considerably improve the performance of the enterprise. The actuality of BPR in times of economic downturn was evaluated. The historic evolution of the concept was examined and findings about the economic nature of BPR emergence were made. The dependence of BPR actuality and simplicity of BPR usage on the level of enterprise business process maturity was shown. A conclusion about optimal point was made via depicting the interrelations graphically. Advantages of BPR usage for enterprises of different sizes were proved and specified. Benefits of BPR were compared with benefits of other related methods like ERP, JIT, TQM and Continuous Improvement. The future possible development of the BPR was analyzed. There offered possible further directions of research in the area of BPR based on current limitations of the concept. Results of the research may be used in companies of maturity level one to three, taking into account size of the company and current state of business process maturity.

The subject of my thesis is the optimization of selected business processes in the specific company. These are processes, which optimization will lead to save time, money and will generate additional income and increase the current level of profit significantly. In my thesis, I proposed several indicators of metrics and describe new information systems that will be part of optimized processes. In the first part I present the theoretical aspects and the transition from functional to process management, modeling based on different methodologies, standards and measuring the performance of individual processes. In the next chapter I am dealing with the practical application of theoretical knowledge on a specific company. First I briefly introduce this company, define its position in the market, and going through complex of strategic analysis. Next I give solution how to find out the problematic aspects of the most critical processes and then I suggest optimization. An important part of this thesis are suggested metrics and indicators for these metrics, which are monitored and evaluate targets of each individual process and thus his successful implementation. After incorporating the proposed optimization, the company has significantly shifted not only in monitored metrics, but will also increase its value. These ideas I will summarize in the end of the work.

The master thesis deals with business process optimization which has to be in a place due to a global implementation of a new logistic information system. The aim is to ensure a process analysis of a current status of selected processes of a company part which is going to be influenced by this implementation. Then to highlight and to stress on the biggest risks and disadvantages of a current status. Final result will be a proposal of new optimized process flows on a higher level of maturity which will meet all requirements set by a new information system, by an information need of a local management and will be helpful to customer service improvement. The first part of the thesis covers theoretical base of a business process management, process modeling and business process optimization approaches which prepare a base for their application in the second practical part of this thesis.

Актуальность темы обусловлена потребностью организаций в оптимизации бизнес-процессов продвижения через сеть Интернет в сфере оптовой торговли. Целью выпускной квалификационной работы является разработка и внедрение нового функционала, оптимизирующего процесс продвижения на предприятии ООО «Мед-орто». Данные рекомендации применяются на практике, и будут способствовать поддержанию интереса покупателей к компании «Мед-Орто». Реализация проекта направлена на увеличение продаж, узнаваемости, формированию лояльных пользователей. / The relevance of the topic is due to the need for organizations to optimize the business processes of promotion via the Internet in the field of wholesale. The purpose of the final qualification work is the development and implementation of new functionality that optimizes the promotion process at the “Med-orto” enterprise. These recommendations are applied in practice and will help maintain the interest of buyers in “Med-orto”. The implementation of the project is aimed at increasing sales, recognition, and building loyal users.

L'orientation service occupe de plus en plus une place importante dans la structuration des systèmes complexes. La conception et le développement d'applications évoluent progressivement d'un modèle traditionnel vers un modèle plus dynamique orienté services où la réutilisation et l'adaptabilité jouent un rôle important. Dans cette thèse, nous proposons une étude portant sur la conception et le développement d'applications par composition de services. Nous décrivons un environnement de partage de services : DyCoSe. Il consiste en un écosystème coopératif où les entreprises membres, organisées en communautés, partagent un consensus global représentant les fonctionnalités métier récurrentes et les propriétés non fonctionnelles communes. La composition d'applications dans DyCoSe repose sur une architecture à trois niveaux combinant à la fois une démarche descendante et une autre ascendante. La démarche descendante permet de décrire l’application à travers une interaction de composants haut niveau et de la raffiner en une ou plusieurs orchestrations de services. La démarche ascendante projette les caractéristiques de l’infrastructure réseau sous-jacente au niveau services. Un processus d’instanciation visant à réaliser une application composite est détaillé. Il formalise le choix des services, selon un ensemble de contraintes données, comme un problème d’optimisation de coûts. Deux solutions au problème d’instanciation sont étudiées. Une solution globale tient compte de l’ensemble des services disponibles dans l’écosystème et une solution locale favorise les services de certaines communautés. Un algorithme génétique est décrit comme implémentation de l’instanciation globale. Une simulation stochastique de l’environnement DyCoSe est proposée. Elle permet d'étudier les possibilités d’instanciation d’une application donnée dans un environnement où la disponibilité des services n’est pas garantie. Elle permet d'étudier aussi, le taux de réussite de l’exécution d’une instance d’une application donnée. / The service oriented computing paradigm plays an increasingly important role in structuring complex systems. Application design and development approaches are witnessing a shift from traditional models towards a more dynamic service oriented model promoting reuse and adaptability. In this thesis, we study an approach for application design and development based on services’ composition. We propose DyCoSe, an environment for sharing services. It consists of an enterprise ecosystem wherein members, organized in communities, share a global agreement describing traditional business functionalities and common non-functional properties. DyCoSe relies on a three level architecture for service based application composition combining both, a top down and a bottom up composition approach. The top down part describes an application using high-level components and refines it to an orchestration of services. The bottom up part projects network characteristics to the services’ level. An instantiation process aiming at realizing an application is described. It formalizes services’ selection as a cost optimization problem considering a set of user given constraints. Two solutions of the instantiation problem are proposed. A global solution considers all the available services in an ecosystem. A local solution gives priority to services of selected communities. A genetic algorithm implements the global instantiation. A stochastic simulation of DyCoSe is proposed. It allows studying the instantiation success rate and the application execution success rate both in a dynamic environment wherein services availability is not guaranteed.