Abstract
In this paper, the preemptive resource constrained project scheduling problem with set up times is investigated. In this problem, a fixed setup time is required to restart when an process is preempted. The project contains activities inter-related by finish to start type precedence relations with a time lag of zero, which require a set of renewable resources. The problem formed in this way is an NP-hard. A mixed integer programming model is proposed for the problem and a parameters tuned meta-heuristic namely genetic algorithm is proposed to solve it. To evaluate the validation and performance of the proposed algorithm a set of 100 test problems is used. Comparative statistical results show that the proposed algorithm is efficiently capable to solve the problem.
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 callDisclaimer: 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.
