MCDM'09 - paper no. 12


 

Back to MCDM'09 contents
 

EVOLUTIONARY ALGORITHM WITH DIRECT CHROMOSOME REPRESENTATION IN MULTI-CRITERIA PROJECT SCHEDULING

Bogumiła Krzeszowska-Zakrzewska

Abstract:

In recent years project scheduling problems became popular because of their broad real-life applications. In practical situations it is often necessary to use multi-criteria models for the evaluation of feasible schedules. Constraints and objectives in project scheduling are determined by three main issues: time, resource and capital; but few papers consider all of them. In research on project scheduling the most popular is the problem with one objective. There are only few papers that consider the multi-objective project scheduling problem. This paper considers the multi-criteria project scheduling problem. There are three types of criteria used to optimize a project schedule: resource allocation, time allocation and cost allocation. An evolutionary algorithm with direct chromosome representation is used to solve this problem. In this representation a chromosome is a sequence of completion times of each activity. The purpose of this paper is to demonstrate how evolutionary algorithms can be used in multi-criteria project scheduling. The paper begins with an overview of previous literature and problem statement; after that there is direct chromosome representation description and at the end final results.

Keywords:

Project scheduling, multi-criteria analysis, evolutionary algorithms, multi-criteria scheduling

Reference index:

Bogumiła Krzeszowska-Zakrzewska, (2010), EVOLUTIONARY ALGORITHM WITH DIRECT CHROMOSOME REPRESENTATION IN MULTI-CRITERIA PROJECT SCHEDULING, Multiple Criteria Decision Making (5), pp. 181-196

Full text:

download