Show simple item record

dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2017-12-02T14:16:10Z
dc.date.available2017-12-02T14:16:10Z
dc.date.issued2002
dc.identifier.urihttp://hdl.handle.net/20.500.12127/808
dc.description.abstractRecently, time-switch constraints have been introduced in literature by Yang and Chen (2000). Basically, these constraints impose a specified starting time on the project activities and force them to be inactive during specified time periods. This type of constraints have been incorporated into the well-known discrete time/cost trade-off problem in order to cope with day, night and weekend shifts. In this paper, we propose a new branch-and-bound algorithm which outperforms the previous one by Vanhoucke et al. (2002a). The procedure makes use of a lower bound calculation for the discrete time/cost trade-off problem (without time-switch constraints). The procedure has been coded in Visual C++, version 6.0 under Windows 2000 and has been validated on a randomly generated problem set. Keywords: Project Management, CPM, Time/cost trade-off problem, Time-switch constraints.
dc.language.isoen
dc.publisherVlerick Business School
dc.subjectProgramme & Portfolio Management
dc.titleNew computational results for the discrete time/cost trade-off problem with time-switch constraints
refterms.dateFOA2019-10-14T14:27:09Z
dc.source.issue18
dc.source.numberofpages30
vlerick.knowledgedomainOperations & Supply Chain Management
vlerick.supervisor
vlerick.typecommWorking paper
vlerick.vlerickdepartmentTOM
dc.identifier.vperid58614
dc.identifier.vpubid853


Files in this item

Thumbnail
Name:
Vanhoucke_M_WP_NewComputationa ...
Size:
134.5Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record