Show simple item record

dc.contributor.authorDemeulemeester, Erik*
dc.contributor.authorDe Reyck, B.*
dc.contributor.authorFoubert, Bram*
dc.contributor.authorHerroelen, Willy*
dc.contributor.authorVanhoucke, Mario*
dc.contributor.authorDemeulemeester, Erik
dc.contributor.authorDe Reyck, B.
dc.contributor.authorFoubert, Bram
dc.contributor.authorHerroelen, Willy
dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2017-12-02T14:10:27Z
dc.date.available2017-12-02T14:10:27Z
dc.date.issued1998
dc.identifier.urihttp://hdl.handle.net/20.500.12127/633
dc.description.abstractA description is given of a new exact procedure for the discrete time/cost trade-off problem in deterministic activity-on-the-arc networks of the CPM type, where the duration of each activity is a discrete, nonincreasing function of the amount of a single resource (money) committed to it. The objective is to construct the complete and efficient time/cost profile over the set of feasible project durations. The procedure uses a horizon-varying approach based on the iterative optimal solution of the problem of minimizing the sum of the resource use over all activities subject to the activity precedence constraints and a project deadline. The optimal solution is derived using a branch-and-bound procedure.
dc.language.isoen
dc.subjectProject Scheduling & Management
dc.subjectProject Management
dc.subjectProject Scheduling
dc.titleNew computational results on the discrete time/cost trade-off problem in project networks
dc.identifier.journalJournal of the Operational Research Society
dc.source.volume49
dc.source.issue11
dc.source.beginpage1153
dc.source.endpage1163
vlerick.knowledgedomainOperations & Supply Chain Management
vlerick.typearticleJournal article with impact factor
vlerick.vlerickdepartmentTOM
dc.identifier.vperid140523
dc.identifier.vperid51529
dc.identifier.vperid139137
dc.identifier.vperid140730
dc.identifier.vperid58614
dc.identifier.vpubid670


This item appears in the following Collection(s)

Show simple item record