Show simple item record

dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2017-12-02T14:23:29Z
dc.date.available2017-12-02T14:23:29Z
dc.date.issued2006
dc.identifier.urihttp://hdl.handle.net/20.500.12127/1960
dc.description.abstractThis paper describes a detailed study of a recursive search algorithm for different optimization problems. Although the algorithm has been originally developed for a project scheduling problem with financial objectives, we show that it can be extended to many other application areas and therefore, can serve as a sub-procedure for various optimization problems. The contribution of the paper is threefold. First, we present a hybrid recursive search procedure for the project scheduling problem with net present value maximization and compare it with state-of-the-art procedures by means of computational tests. Second, we show how the procedure can be adapted to two other application areas: project scheduling with work continuity minimization and the open pit mining problem. Last, we highlight some future research areas where this hybrid procedure might bring a promising contribution.
dc.language.isoen
dc.subjectProgramme & Portfolio Management
dc.titleAn efficient hybrid search algorithm for various optimization problems
dc.source.issue7
dc.source.numberofpages21
vlerick.knowledgedomainOperations & Supply Chain Management
vlerick.supervisor
vlerick.typecommWorking paper
vlerick.vlerickdepartmentTOM
dc.identifier.vperid58614
dc.identifier.vpubid2197


This item appears in the following Collection(s)

Show simple item record