New computational results on the discrete time/cost trade-off problem in project networks
dc.contributor.author | Demeulemeester, Erik | |
dc.contributor.author | De Reyck, B. | |
dc.contributor.author | Foubert, Bram | |
dc.contributor.author | Herroelen, Willy | |
dc.contributor.author | Vanhoucke, Mario | |
dc.date.accessioned | 2017-12-02T14:10:27Z | |
dc.date.available | 2017-12-02T14:10:27Z | |
dc.date.issued | 1998 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12127/633 | |
dc.description.abstract | A 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.iso | en | |
dc.subject | Project Scheduling & Management | |
dc.subject | Project Management | |
dc.subject | Project Scheduling | |
dc.title | New computational results on the discrete time/cost trade-off problem in project networks | |
dc.identifier.journal | Journal of the Operational Research Society | |
dc.source.volume | 49 | |
dc.source.issue | 11 | |
dc.source.beginpage | 1153 | |
dc.source.endpage | 1163 | |
vlerick.knowledgedomain | Operations & Supply Chain Management | |
vlerick.typearticle | Journal article with impact factor | |
vlerick.vlerickdepartment | TOM | |
dc.identifier.vperid | 140523 | |
dc.identifier.vperid | 51529 | |
dc.identifier.vperid | 139137 | |
dc.identifier.vperid | 140730 | |
dc.identifier.vperid | 58614 | |
dc.identifier.vpubid | 670 |