A scatter search for the extended resource renting problem
dc.contributor.author | Vandenheede, Len | |
dc.contributor.author | Vanhoucke, Mario | |
dc.contributor.author | Maenhout, Broos | |
dc.date.accessioned | 2017-12-02T14:53:20Z | |
dc.date.available | 2017-12-02T14:53:20Z | |
dc.date.issued | 2016 | |
dc.identifier.doi | 10.1080/00207543.2015.1064177 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12127/5254 | |
dc.description.abstract | In this paper, the extended Resource Renting Problem (RRP/extended) is presented. The RRP/extended is a time-constrained project scheduling problem, in which the total project cost is minimised. In the RRP/extended, this total project cost is determined by a number of extra costs, which are defined in this paper. These costs are based on the costs that are used in the traditional Resource Renting Problem and the Total Adjustment Cost Problem. Therefore, the RRP/extended represents a union of these two problems. To solve the RRP/extended, a scatter search is developed. The building blocks of this scatter search are specifically designed for the RRP/extended. We introduce two crossovers and an improvement method. The efficiency of these building blocks will be shown in the paper. Furthermore, a sensitivity analysis is presented in which the five costs have diverse values. | |
dc.language.iso | en | |
dc.subject | Project Scheduling | |
dc.subject | Resource Scheduling | |
dc.subject | Scatter Search | |
dc.subject | Renting Costs | |
dc.title | A scatter search for the extended resource renting problem | |
dc.identifier.journal | International Journal of Production Research | |
dc.source.volume | 54 | |
dc.source.issue | 16 | |
dc.source.beginpage | 4723 | |
dc.source.endpage | 4743 | |
vlerick.knowledgedomain | Operations & Supply Chain Management | |
vlerick.typearticle | Vlerick strategic journal article | |
vlerick.vlerickdepartment | TOM | |
dc.identifier.vperid | 75947 | |
dc.identifier.vperid | 154694 | |
dc.identifier.vperid | 58614 | |
dc.identifier.vpubid | 6505 |