Pre-emptive resource-constrained project scheduling with setup times
Resource-constrained project scheduling with activity pre-emption assumes that activities are allowed to be interrupted and restarted later in the schedule at no extra cost. In the current paper, we extend this pre-emptive scheduling problem with setup times between activity interruptions and the possibility to fast track pre-emptive subparts of activities. The contribution of the paper is twofold. First, we present an optimal branch-and-bound procedure for the pre-emptive resource-constrained project scheduling problem with setup times and fast tracking options. Second, we test the impact of these pre-emptive extensions to the quality of the schedule from a lead-time point-of-view.
Year of publication: |
2006-05
|
---|---|
Authors: | DEBELS, D. ; VANHOUCKE, M. |
Institutions: | Faculteit Economie en Bedrijfskunde, Universiteit Gent |
Saved in:
freely available
Saved in favorites
Similar items by person
-
ON THE MORPHOLOGICAL STRUCTURE OF A NETWORK
VANHOUCKE, M., (2004)
-
A Bi-Population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem
DEBELS, D., (2005)
-
THE DISCRETE TIME/COST TRADE-OFF PROBLEM UNDER VARIOUS ASSUMPTIONS EXACT AND HEURISTIC PROCEDURES
VANHOUCKE, M., (2005)
- More ...