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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.