Stability and resource allocation in project planning

IIE Transactions (Institute of Industrial Engineers)

Volumn 36, Issue 7, 2004, Pages 667-682

  Leus, Roel ^a   Herroelen, Willy ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROJECT MANAGEMENT; RESOURCE ALLOCATION; SCHEDULING;

BRANCH AND BOUND ALGORITHM; PROJECT PLANNING;

STRATEGIC PLANNING;

EID: 2942687563     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490447348     Document Type: Article

References (46)

1. Adlakha, V.G. and Kulkarni, V.G. (1989) A classified bibliography of research on stochastic PERT networks: 1966-1987. INFOR, 27(3), 272-296.
2. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Upper Saddle River, NJ.
3. Alexopoulos, C. and Fishman, G.S. (1991) Characterizing stochastic flow networks using the Monte Carlo method. Networks, 21, 775-798.
4. Artigues, C. (2000) Insertion techniques for on and off-line resource constrained project scheduling. In Proceedings of the 7th International Workshop on Project Management and Scheduling, PMS, Osnabrück, Germany.
5. Artigues, C., Michelon, P. and Reusser, S. (2000) Insertion techniques for static and dynamic resource constrained project scheduling. LIA report 152, Laboratoire d'Informatique d'Avignon, University of Avignon, France.
6. Artigues, C. and Roubellat, F. (2000) A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. European Journal of Operational Research, 127(2), 297-316.
7. Aytug, H., Lawley, M. A., McKay, K., Mohan, S. and Uzsoy, R. (2004) Executing production schedules in the face of uncertainties: a review and some future directions. European Journal of Operational Research, (to appear).
8. Bartusch, M., Möhring, R.H. and Radermacher, F.J. (1988) Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16, 201-240.
9. Bowers, J.A. (1995) Criticality in resource constrained networks. Journal of the Operational Research Society, 46, 80-91.
10. Brearley, A. L., Mitra, G. and Williams, H.P. (1975) An analysis of mathematical programs prior to applying the simplex method. Mathematical Programming, 8, 54-83.
11. Brucker, P., Drexl, A., Möhring, R., Neumann, K. and Pesch, E. (1999) Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research, 112, 3-41.
12. Davis, E. (1987) Constraint propagation with interval labels. Artificial Intelligence, 32, 281-331.
13. De Boer, R. (1998) Resource-constrained multi-project management. Ph.D. thesis, University of Twente, The Netherlands.
14. Demeulemeester, E. and Herroelen, W. (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science, 38, 1803-1818.
15. Demeulemeester, E. and Herroelen, W. (1997) New benchmark results for the resource-constrained project scheduling problem. Management Science, 43, 1485-1492.
16. Demeulemeester, E., Vanhoucke, M. and Herroelen, W. (2003) A random generator for activity-on-the-node networks. Journal of Scheduling, 6, 13-34.
17. Dorndorf, U., Pesch, E. and Phan-Huy, T. (2000) Constraint propagation techniques for the disjunctive scheduling problem. Artificial Intelligence, 122, 189-240.
18. Edmonds, J. and Karp, R.M. (1972) Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19, 248-264.
19. Elmaghraby, S.E. (1977) Activity Networks: Project Planning and Control by Network Models, Wiley, New York.
20. Ford, L.R., Jr. and Fulkerson, D.R. (1962) Flows in Networks. Princeton University Press, Princeton, NJ.
21. Fulkerson, D.R. (1962) Expected critical path lengths in PERT networks. Operations Research, 10, 808-817.
22. Gutierrez, G.J. and Kouvelis, P. (1991) Parkinson's law and its implications for project management. Management Science, 37(8), 990-1001.
23. Hagstrom, J.N. (1988) Computational complexity of PERT problems. Networks, 18, 139-147.
24. Herroelen, W., De Reyck, B. and Demeulemeester, E. (1998) Resource-constrained project scheduling: a survey of recent developments. Computers and Operations Research, 25(4), 279-302.
25. Herroelen, W. and Leus, R. (2004) The construction of stable project baseline schedules. European Journal of Operational Research, 156(3), 550-565.
26. Igelmund, G. and Radermacher, F.J. (1983a) Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks, 13, 1-28.
27. Igelmund, G. and Radermacher, F.J. (1983b) Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks, 13, 29-48.
28. Knight, F.H. (1921) Risk, Uncertainty, and Profit, Houghton Mifflin, Boston, MA.
29. Kolisch, R. and Padman, R. (2001) An integrated survey of deterministic project scheduling. Omega, 49(3), 249-272.
30. Lawler, E.L. (1976) Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
31. Leus, R. and Herroelen, W. (2001) Models for robust resource allocation in project scheduling. Research report 0128, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium.
32. Mackworth, A.K. (1977) Consistency in networks of relations. Artificial Intelligence, 8(1), 99-118.
33. Mehta, S.V. and Uzsoy, R.M. (1998) Predictable scheduling of a job shop subject to breakdowns. IEEE Transactions on Robotics and Automation, 14(3), 365-378.
34. Möring, R.H. (1985) Algorithmic aspects of comparability graphs and interval graphs, in: Graphs and Orders, Rival, I. (ed.), Reidel, Boston, pp. 41-101.
35. Möhring, R.H. (2000) Scheduling under uncertainty: bounding the makespan distribution. Working paper 700/2000, Department of Mathematics, Technische Universität Berlin, Berlin, Germany.
36. Möhring, R.H. and Radermacher, F.J. (1989) The order-theoretic approach to scheduling: the stochastic case, in Advances in Project Scheduling, Slowinski, R. and Weglarz, J. (eds.), Elsevier, Amsterdam, Ch. III.4.
37. Naegler, G. and Schoenherr, S. (1989) Resource allocation in a network model - The Leinet system, in Advances in Project Scheduling, Slowinski, R. and Weglarz, J. (eds.), Elsevier, Amsterdam, Ch. II.8.
38. Neumann, K., Schwindt, C. and Zimmermann, J. (2002) Project scheduling with time windows and scarse resources, in Lecture Notes in Economics and Mathematical Systems, Springer.
39. Nuijten, W.P.M. (1994) Time and resource constrained scheduling: a constraint satisfaction approach. Ph.D. thesis, TU Eindhoven, The Netherlands.
40. Radermacher, F.J. (1985) Scheduling of project networks. Annals of Operations Research, 4, 227-252.
41. Roy, B. and Sussman, B. (1964) Les problèmes d'ordonnancement avec constraintes disjonctives.
42. Schwindt, C. (2001) Project scheduling with sequence-dependent changeover times. Paper presented at the EURO 2001 Meeting in Rotterdam, July 9-11.
43. Stork, F. (2001) Stochastic resource-constrained project scheduling. Ph.D. thesis, Technische Universität Berlin, Berlin, Germany.
44. Stork, F. and Uetz, M. (2000) On the representation of resource constraints in project scheduling. Technical report 693/2000, Department of Mathematics, Technische Universität Berlin, Germany.
45. Wiest, J.D. and Levy, F.K. (1977) A management guide to PERT/CPM. Prentice-Hall, Englewood Cliffs, NJ.
46. Wu, S.D., Storer, H.S. and Chang, P.-C. (1993) One-machine rescheduling heuristics with efficiency and stability as criteria. Computers and Operations Research, 20(1), 1-14.