Abstract

Several indistinguishable or comparative tasks/works in a project are generally alluded to as repetitive projects. A project have group of tasks which is repetitive in nature in all over the project or a similar plan in different positions are commonly known as repetitive project. In repetitive project businesses, distinctive crew choices are accessible for each task, and selecting the best choice to a task is a noteworthy test for administrators of a project. Since acquiring optimum results is found computationally escalated for this type of problems, a modified Genetic Algorithm based technique is developed to schedule projects to satisfy different goals like minimizing total task time and the total expenditure of the project, with the constraints of precedence connections between different tasks, precedence connections between different sites and the due time within which different tasks to be finished. The performance of the proposed method is compared with solutions created using existing algorithms like simple GA and ABC. Exact solutions generated by solving the developed mathematical model is utilized for validating the solutions acquired by modified GA. The computational outcomes demonstrate that the proposed GAIIPDM methodology performs significantly well in terms of quality of solutions.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.