Modeling and optimisation of maintenance and repair activities performance by dunamic repairman problem

Cost and profitability optimization is an essential issue that must be considered for firms management and survivability. For this aim, firms has to scrutiny their current structure and processes and change them to fit the business dynamics.For this aim, the Thinking Processes of Theory of Constraints have been used for analysing the problems. Thinking Processes is one of the tools of Theory of Constraints that is used to expose the problem and to reach to roots of it.Logistics and transportation costs are the main costs of the firm. Routing issues in logistics and transportation activities are important for pickup and delivery of products. It is also important in service sector, while performing repair and maintenance activities in customers? place. Vehicle routing problem has found a vast area of implementation related to these problems. Most of these studies are done base on the static data and reflects the static states. Improvements in communication technologies have given the opportunity to solve the dynamic type of these problems.In this study, Thinking Processes of Theory of Constraints has defined in detail. In third part, usage of Thinking Processes in analyzing problem has described. The dynamic and static aspects of the vehicle routing problem have introduced and the differences beetween them has discussed in fourth part. In addition, studies in the literature about dynamic vehicle routing problem have reviewed. Answers for selection of dynamic vehicle routing problem as solution method has explained. In fifth part, traditional vehicle routing problem has summarized according to the applied problem area and the approaches have used for solution. In sixth part, Genetic algorithm is used for developing one of the heuristic methods has been explained in detail. In seventh part, the solution approach proposed for the problem has given. In eighth part, developed three heuristic algorithms are presented and their solution results are compared. These algorithms are developed in ?JavaTM Platform, Standard Edition 6?. Time windows and precedence issues has considered in developed three heuristic algorithms.Keywords: Theory of constraints, thinking processes, dynamic repairmen routing problem, nearest neighbor algorithm, genetic algorithm, time windows, shortest path method