Leyman, Pieter; Vanhoucke, Mario; Leyman, Pieter; Vanhoucke, Mario (2015)
In this paper, we discuss the resource-constrained project scheduling problem with discounted cash flows. We introduce a new schedule construction technique which moves sets of activities to improve the project net present value and consists of two steps. In particular, the inclusion of individual activities into sets, which are then moved together, is crucial in both steps. The first step groups the activities based on the predecessors and successors in the project network, and adds these activities to a set based on their finish time and cash flow. The second step on the contrary does so based on the neighbouring activities in the schedule, which may but need not include precedence related activities. The proposed scheduling method is implemented in a genetic algorithm metaheuristic and we employ a penalty function to improve the algorithm's feasibility with respect to a tight deadline. All steps of the proposed solution methodology are tested in detail and an extensive computational experiment shows that our results are competitive with existing work.
Van Peteghem, Vincent; Vanhoucke, Mario; Van Peteghem, Vincent; Vanhoucke, Mario (2013)
In this paper, an artificial immune system (AIS) algorithm for the resource availability cost problem (RACP) is presented, in which the total cost of the (unlimited) renewable resources required to complete the project by a pre-specified project deadline should be minimized. The AIS algorithm makes use of mechanisms inspired by the vertebrate immune system and includes different algorithmic components, such as a new fitness function, a probability function for the composition of the capacity lists, and a K-means density function in order to avoid premature convergence. All components are explained in detail and computational results for the RACP are presented.
The export option will allow you to export the current search results of the entered query to a file. Different
formats are available for download. To export the items, click on the button corresponding with the preferred download format.
By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.
To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export.
The amount of items that can be exported at once is similarly restricted as the full export.
After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.