Abstract
Abstract This paper proposes to consider alternative project structures when dealing with the multi-mode resource-constrained project scheduling problem. An AND-OR network is used to present this alternative project structures innovatively. The problem is formulated as a bi-objective linear integer program, which minimizes the makespan and total cost. A hybrid metaheuristic is developed based on AND-OR network to solve this NP-hard problem efficiently, which nests adapted Tabu Search (outer layer) and NSGA-II algorithm (inner layer). A large amount of computational experiments of different sizes are conducted, and compared with solutions generated by CPLEX, traditional Tabu Search, enumeration-based method and single-layer NSGA-II. The experimental results show the advantages of the proposed model and method, especially with large-size problems.
Sign-in/Register to access full text options 
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.
