A Semi Definite Programming Based Optimization Algorithm for Project Scheduling Problem

2015 
A method to estimate the time of accomplishment of a project is proposed in this study. The method claims a tight and better time complexity. A semi definite optimization based model for better calculation of project completion time in a project scheduling environment has been developed that works well when limited information of individual activities in the project is available. The computational experiments suggest that the result provided by the new method is more accurate. A significant improvement is achieved in terms of time complexities of algorithm compared to alternative methods.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    23
    References
    0
    Citations
    NaN
    KQI
    []