Time-constrained project scheduling
- 1.6k Downloads
We propose a new approach for scheduling with strict deadlines and apply this approach to the Time-Constrained Project Scheduling Problem (TCPSP). 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 the approach lies in the first stage in which we construct partial schedules. 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 neighborhood 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.
KeywordsProject scheduling Strict deadlines
- Demeulemeester, E. (1995). Minimizing resource availability costs in time-limited project networks. Management Science, 41(10), 1590–1598. Google Scholar
- Demeulemeester, E., & Herroelen, W. (1997). New benchmark results for the resource-constrained project scheduling problem. Management Science, 43, 1485–1492. Google Scholar
- Guldemond, T. A., Hurink, J. L., Paulus, J. J., & Schutten, J. M. J. (2006). Time-constrained project scheduling; details of the computational tests. http://tcpsp.ewi.utwente.nl/.
- Kolisch, R. (1995). Project scheduling under resource constraints. Berlin: Physica. Google Scholar
- Kolisch, R., & Hartmann, S. (1999). Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In J. Weglarz (Ed.), Handbook on recent advances in project scheduling (pp. 197–212). Dordrecht: Kluwer. Google Scholar
- Kolisch, R., & Sprecher, A. (1997a). Project scheduling library—PSPlib. http://18.104.22.168/psplib/.
- Möhring, R. H. (1984). Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research, 32(1), 89–120. Google Scholar
- Neumann, K., Schwindt, C., & Zimmermann, J. (2002). Project scheduling with time windows and scarce resources. Lecture notes in economics and mathematical systems (Vol. 508). Berlin: Springer. Google Scholar