Scheduling problem of multiple projects with limited resources: Application in a software company

Project management is basically a combination of planning and scheduling activities with the aim to meet project's targets. Nowadays project scheduling is a very common problem in project based production companies. The problem is aim to complete the projects with the shortest time or minimum cost under some constraints. In this thesis, a new method was proposed for generating a schedule for a software company which runs multiple projects simultaneously. The problem faced by the company is aimed at finding the smallest completion time of multi-projects which has different precedence and constrained resources in different activities. In order to solve the problem, the linear decision models were investigated and the chosen decision model was coded using Optimization Programming Language (OPL). The results of the decision model were investigated with the help of CPLEX Optimizer solver. In order to ease the use of the decision model and the solver, a user interface was added using JAVA programming language. As a result, the end users were able to use the proposed scheduling method more affectively. In the conclusion section, the current thesis was evaluated and the possible future studies were called out.