Time-constrained project scheduling

Share/Save/Bookmark

Guldemond, T.A. and Hurink, J.L. and Paulus, J.J. and Schutten, J.M.J. (2008) Time-constrained project scheduling. Journal of Scheduling, 11 (2). pp. 137-148. ISSN 1094-6136

[img]
Preview
PDF
329Kb
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.
Item Type:Article
Copyright:© 2008 The Author(s)
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/64724
Official URL:http://dx.doi.org/10.1007/s10951-008-0059-7
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 246949