A Study on Project Scheduling Technique Using Cut Theory and GA

Abstract

In this study, It is developed as follows that new-type systematic scheduling procedure by use of GA: At the first stage, a optimal scheduling model with limited resource problem is formulated as problem of integer programming to obtain the execution state defined by using “number of activities”ד number of activities” matrix. At the second stage, topological characteristics of the project network are analyzed mathematically focusing on the cut set structure. Thus relationship between this cut set structure and execution state is discussed. At the final stage, coding, decoding and GA-operator are proposed in accordance with cut-network concept.