Loading...
A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints
Van Den Eeckhout, Mick Maenhout, Broos Vanhoucke, Mario
Van Den Eeckhout, Mick
Maenhout, Broos
Vanhoucke, Mario
Citations
Altmetric:
Publication Type
Journal article with impact factor
Editor
Supervisor
Publication Year
2019
Journal
Computers & Operations Research
Book
Publication Volume
101
Publication Issue
January
Publication Begin page
144
Publication End page
161
Publication Number of pages
Collections
Abstract
Highlights Project staffing with discrete time/resource trade-offs and calendar constraints. An iterated local search procedure is proposed. • Different problem decomposition techniques are applied. Abstract When scheduling projects under resource constraints, assumptions are typically made with respect to the resource availability and activities are planned each with its own duration and resource requirements. In resource scheduling, important assumptions are made with respect to the staffing requirements. Both problems are typically solved in a sequential manner leading to a suboptimal outcome. We integrate these two interrelated scheduling problems to determine the optimal personnel budget that minimises the overall cost. Integrating these problems increases the scheduling flexibility, which improves the overall performance. In addition, we consider some resource demand flexibility in this research as an activity can be performed in multiple modes. In this paper, we present an iterated local search procedure for the integrated multi-mode project scheduling and personnel staffing problem. Detailed computational experiments are presented to evaluate different decomposition heuristics and comparison is made with alternative optimisation techniques.
Research Projects
Organizational Units
Journal Issue
Keywords
Heuristic Programming, Time Management, Discrete Choice Models, Discrete Time Filters, Mixed Integer Linear Programming