EEMCS

This is the latest version of this eprint.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 330 Kb

Official URL: http://dx.doi.org/10.1007/s10951-008-0059-7

Abstract

We study the Time-Constrained Project Scheduling Problem (TCPSP), in which the scheduling of activities is subject to strict deadlines. To be able to meet these deadlines, it is possible to work in overtime or hire additional capacity in regular time or overtime. For this problem, we develop a two stage heuristic. The key of our approach lies in the first stage in which we construct partial schedules with a randomized sampling technique. In these partial schedules, jobs may be scheduled for a shorter duration than required. The second stage uses an ILP formulation of the problem to turn a partial schedule into a feasible schedule, and to perform a neighbourhood search. The developed heuristic is quite flexible and, therefore, suitable for practice. We present experimental results on modified RCPSP benchmark instances. The two stage heuristic solves many instances to optimality, and if we substantially decrease the deadline, the rise in cost is only small.

Available Versions of this Item

• Time-Constrained Project Scheduling (deposited 24 November 2006)
  • Time-constrained project scheduling (deposited 23 April 2008)
    [Currently Displayed]

Export this item as:

• BibTeX
• XML

To correct this item please ask your editor

Repository Staff Only: edit this item