Current Proceedings on Technology

Yazarlar: Judit Kiss

Konular:-

Anahtar Kelimeler:Flexible project planning,Matrix-based planning methods,Algorithms,Computer applications

Özet: During the planning phase of projects the planners have to face several difficulties: tasks and their sequences cannot be clearly defined. Sometimes they can be uncertain. Some tasks need to be omitted during the project completion because their realisation costs exceed the project budget. It is also hard to plan the sequence of the tasks, as the serial solution requires more time, while the parallel realisation claims additional resources. The currently popular methods and applications are not capable to plan in such a flexible manner. Formerly, our research team developed new matrix-based methods which represent the assigned importance values of the project tasks in the diagonal cells and the possible relation values in the off-diagonal cells.Determining the possible project solutions additionally calculating their cost, lead time and resource need is a very complex problem, which is hard to compute manually even with a small matrix with high uncertainty. This research aimed to create the opportunity by multiple applications to put theory into practice. Two Matlab applications and a genetic algorithm based on GAlib have been developed. In this paper these applications are introduced and compared through simulations with the same inputs and objective functions.

---