Show simple item record

dc.contributor.authorVan Den Eeckhout, Mick
dc.contributor.authorVanhoucke, Mario
dc.contributor.authorMaenhout, Broos
dc.date.accessioned2019-10-04T08:53:35Z
dc.date.available2019-10-04T08:53:35Z
dc.date.issued2020en_US
dc.identifier.issn0377-2217
dc.identifier.doi10.1016/j.ejor.2019.07.069
dc.identifier.urihttp://hdl.handle.net/20.500.12127/6391
dc.description.abstractProject staffing with discrete time/resource trade-offs and calendar constraints. • A cut-branch-and-price procedure is proposed. Decomposition into subproblems with a specific staffing composition. Dedicated cuts include personnel information in the workload pricing problem. The personnel staffing problem calculates the required workforce size and is determined by constructing a baseline personnel roster that assigns personnel members to duties in order to cover certain staffing requirements. In this research, we incorporate the planning of the duty demand in the staff scheduling problem in order to lower the staffing costs. More specifically, the demand originates from a project scheduling problem with discrete time/resource trade-offs, which embodies additional flexibility as activities can be executed in different modes. In order to tackle this integrated problem, we propose a decomposed branch-and-price procedure. A tight lower and upper bound are calculated using a problem formulation that models the project scheduling constraints and the time-related resource scheduling constraints implicitly in the decision variables. Based upon these bounds, the strategic problem is decomposed into multiple tactical subproblems with a fixed workforce size and an optimal solution is searched for each subproblem via branch-and-price. Fixing the workforce size in a subproblem facilitates the definition of resource capacity cuts, which limit the set of eligible project schedules, decreasing the size of the branching tree. In addition, in order to find the optimal integer solution, we propose a specific search strategy based upon the lower bound and dedicated rules to branch upon the workload generated by a project schedule. The computational results show that applying the proposed search space decomposition and the inclusion of resource capacity cuts lead to a well-performing procedure outperforming different other heuristic and exact methodologies.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectProject Schedulingen_US
dc.subjectManpower Schedulingen_US
dc.subjectDecompositionen_US
dc.subjectBranch-and-Priceen_US
dc.subjectDiscrete Time/Resource Trade-Offsen_US
dc.subjectTree Sizeen_US
dc.titleA decomposed branch-and-price procedure for integrating demand planning in personnel staffing problemsen_US
dc.identifier.journalEuropean Journal of Operational Researchen_US
dc.source.volume280en_US
dc.source.issue3en_US
dc.source.beginpage845en_US
dc.source.endpage859en_US
dc.contributor.departmentFaculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, Gent, 9000 Belgiumen_US
dc.contributor.departmentUCL School of Management, University College, London, UKen_US
vlerick.knowledgedomainOperations & Supply Chain Managementen_US
vlerick.typearticleVlerick strategic journal articleen_US
vlerick.vlerickdepartmentTOMen_US
dc.identifier.vperid58614en_US


Files in this item

Thumbnail
Name:
Publisher version

This item appears in the following Collection(s)

Show simple item record