Discrete time/cost trade-offs in project scheduling with time-switch constraints
dc.contributor.author | Vanhoucke, Mario | |
dc.contributor.author | Demeulemeester, Erik | |
dc.contributor.author | Herroelen, Willy | |
dc.date.accessioned | 2017-12-02T14:10:27Z | |
dc.date.available | 2017-12-02T14:10:27Z | |
dc.date.issued | 2002 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12127/635 | |
dc.description.abstract | The discrete time/cost trade-off problem assumes the duration of project activities to be discrete, non-increasing functions of the amount of a single non-renewable resource. The problem has been studied under three possible objectives. The so-called deadline problem involves the scheduling of project activities in order to minimize the total cost of the project while meeting a given deadline. The budget problem aims at minimizing the project duration without exceeding a given budget. A third objective involves the generation of the complete efficient time/cost profile over the set of feasible project durations. In this paper we describe a solution procedure for the deadline problem in which three special cases of time-switch constraints are involved. | |
dc.language.iso | nl | |
dc.subject | Programme & Portfolio Management | |
dc.title | Discrete time/cost trade-offs in project scheduling with time-switch constraints | |
dc.identifier.journal | Journal of the Operational Research Society | |
dc.source.volume | 53 | |
dc.source.issue | 7 | |
dc.source.beginpage | 741 | |
dc.source.endpage | 751 | |
vlerick.knowledgedomain | Operations & Supply Chain Management | |
vlerick.typearticle | Vlerick strategic journal article | |
vlerick.vlerickdepartment | TOM | |
dc.identifier.vperid | 51529 | |
dc.identifier.vperid | 140730 | |
dc.identifier.vperid | 58614 | |
dc.identifier.vpubid | 672 |