Project selection, scheduling and resource allocation with time dependent returns

European Journal of Operational Research

Volumn 193, Issue 1, 2009, Pages 23-34

  Chen, Jiaqiong ^a   Askin, Ronald G ^b  

^a FedEx   (United States)

^b Arizona State University   (United States)

Author keywords

Heuristics; Implicit enumeration; Integer programming; Project management; Project selection

Indexed keywords

DISTANCE EDUCATION; MANAGEMENT; MODERNIZATION; PLANNING; RESOURCE ALLOCATION;

CONTINUING EDUCATION; HEURISTICS; HUMAN RESOURCES; IMPLICIT ENUMERATION; INTEGER PROGRAMMING; MATHEMATICAL FORMULATIONS; NEW PRODUCTS; PRIORITIZATION; PROJECT COMPLETION; PROJECT MANAGEMENT; PROJECT SELECTION; RESOURCE CONSTRAINTS; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; TASK SCHEDULING; TIME-DEPENDENT;

SCHEDULING;

EID: 52049102073     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.10.040     Document Type: Article

References (72)

1. Akkan C., Drexl A., and Kimms A. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research 165 2 (2005) 339-358
2. Alcaraz J., Maroto C., and Ruiz R. Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society 54 6 (2003) 614-626
3. Alcaraz, J., Maroto, C., Ruiz, R., 2004. Improving the performance of genetic algorithms for the RCPS problema. In: Proceedings of the Ninth International Workshop on Project Management and Scheduling, Nancy, pp. 40-43.
4. Böttcher J., Drexl A., Kolisch R., and Salewski F. Project scheduling under partially renewable resource constraints. Management Science 45 4 (1999) 543-559
5. Bouleimen K., and Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research. 149 2 (2003) 268-281
6. Bounds G. The last word on project management. IIE Solutions 30 11 (1998) 41-43
7. Brucker P., Knust S., Schoo A., and Thiele O. A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research 107 2 (1998) 272-288
8. Brucker P., Drexl A., Mohring R., Neumann K., and Pesch E. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112 1 (1999) 3-41
9. Brucker P., and Knust S. A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research 127 2 (2000) 355-362
10. Brucker P., and Knust S. Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149 2 (2003) 302-313
11. Brucker P., and Knust S. Complex Scheduling (2006), Springer, Berlin-Heidelberg
12. Chen, J., 2005. Project selection, scheduling and resource allocation for engineering design groups. Ph.D. Dissertation. The University of Arizona, Tucson, Arizona, USA.
13. Coffin M.A., and Taylor W.B. R& D project selection and scheduling with a filtered beam search approach. IIE Transactions 28 (1996) 167-176
14. Davis E.W., and Patterson J.H. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science 21 8 (1975) 944-955
15. Debels D., De Reyck B., Leus R., and Vanhoucke M. A hybrid sctter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research 196 2 (2006) 638-653
16. De Reyck B., Demeulemeester E., and Herroelen W. Local search methods for the discrete time/resource trade-off problem in project networks. Naval Research Logistics 45 6 (1998) 553-578
17. De Reyck B., and Herroelen W. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 111 1 (1998) 152-174
18. De Reyck B., and Herroelen W. The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 119 2 (1999) 538-556
19. Demassey S., Artigues C., and Michelon P. Constraint-progagation-based cutting planes: An application to the resource-constrained project scheduling problem. INFORMS Journal on Computing 17 1 (2005) 52-65
20. Demeulemeester E., De Reyck B., and Herroelen W. The discrete time/resource trade-off problem in project networks: A branch-and-bound approach. IIE Transactions 32 11 (2000) 1059-1069
21. Demeulemeester E., and Herroelen W. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38 12 (1992) 1803-1818
22. Demeulemeester E., and Herroelen W. A branch-and-bound procedure for the generalized resource-constrained project scheduling problem. Operations Research 45 2 (1997) 201-212
23. Demeulemeester E., and Herroelen W. Project Scheduling: A Research Handbook (2002), Kluwer Academic Publishers
24. Demeulemeester E.L., Vanhoucke M., and Herroelen W.S. RanGen: A network generator for activity-on-the-node networks. Journal of Scheduling 6 (2003) 17-38
25. Dorndorf U., Pesch E., and Phan-Huy T. A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Science 46 10 (2000) 1365-1384
26. Dorndorf U., Pesch E., and Phan-Huy T. A branch-and-bound algorithm for the resource-constrained project scheduling problem. Mathematical Methods of Operations Research 52 3 (2000) 413-439
27. Drexl A., Nissen R., Patterson J., and Salewski F. ProGen/pi x - an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. European Journal of Operational Research 125 1 (2000) 59-72
28. Erenguc S., Ahn T., and Conway D. The resource constrained project scheduling problem with multiple crashable modes: An exact solution method. Naval Research Logistics 48 2 (2001) 107-127
29. Fox G.E., Baker R.N., and Bryant J.L. Economic models for R and D project selection in the presence of project interactions. Management Science 30 7 (1984) 890-902
30. Franck B., Neumann K., and Schwindt C. Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum 23 3 (2001) 297-324
31. Gabriel S.A., Ordóñez J.F., and Faria J.A. Contingency planning in project selection using multiobjective optimization and chance constraints. Journal of Infrastructure Systems 12 2 (2006) 112-120
32. Hartmann S. A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Research Logistics 49 5 (2002) 433-448
33. Hartmann S., and Drexl A. Project scheduling with multiple modes: A comparison of exact algorithms. Networks 32 4 (1998) 283-297
34. Hartmann S., and Kolisch R. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research 127 2 (2000) 394-407
35. Heidenberger K. Dynamic project selection and funding under risk: A decision tree based MILP approach. European Journal of Operational Research 95 (1996) 284-298
36. Heilmann R. A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research 144 2 (2003) 348-365
37. Icmeli O., and Erenguc S. A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows. Management Science 42 10 (1996) 1395-1408
38. Jozefowska J., Mika M., Rozycki R., Waligora G., and Weglarz J. Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research 102 (2001) 137-155
39. In: Jozefowska J., and Weglarz J. (Eds). Perspectives in Modern Project Scheduling (2006), Springer, New York
40. Kimms A. Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds. Annals of Operations Research 102 (2001) 221-236
41. Klein R. Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects. European Journal of Operational Research 127 3 (2000) 619-638
42. Knotts G., Dror M., and Hartman B. Agent-based project scheduling. IIE Transactions 32 5 (2000) 387-401
43. Kochetov, Y., Stolyar, A., 2003. Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies, Russia.
44. Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management 14 3 (1996) 179-192
45. Kolisch R. Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90 2 (1996) 320-333
46. Kolisch R., and Drexl A. Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Tranactions 29 11 (1997) 987-999
47. Kolisch R., and Hartmann S. Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research 174 1 (2006) 23-37
48. Kolisch R., and Meyer K. Selection and scheduling of pharmaceutical research projects. In: Jozefowsk J., and Weglarz J. (Eds). Perspectives in Modern Project Scheduling (2006), Springer Science, New York 321-344
49. Kolisch R., and Sprecher A. PSPLIB - a project scheduling problem library. European Journal of Operational Research 96 1 (1997) 205-216
50. Kolisch R., Sprecher A., and Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41 10 (1995) 1693-1703
51. Mingozzi A., Maniezzo V., Ricciardelli S., and Bianco L. An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Science 44 5 (1998) 714-729
52. Möhring R.H., Schulz A.S., Stork F., and Uetz M. Solving project scheduling problems by minimum cut computations. Management Science 49 3 (2003) 330-350
53. Musselwhite C. Time-based innovation: The new competitive advantage. Training and Development Journal 55 (1990) 53-56
54. Neumann K., Schwindt C., and Zimmermann J. Project Scheduling with Time Windows and Scarce Resources vol. 2 (2003), Aufl. Springer-Verlag, Berlin
55. Neumann K., and Zimmermann J. Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operational Research 127 2 (2000) 425-443
56. Patterson J.H. A comparison of exact approaches for solving the multiple constrained resource project scheduling problem. Management Science 30 7 (1984) 854-867
57. Robinson W.T., and Fornell C. Sources of market pioneer advantages in consumer goods industries. Journal of Marketing Research 22 (1985) 305-317
58. Schirmer A. Resource-constrained project scheduling: An evaluation of adaptive control schemes for parameterized sampling heuristics. International Journal of Production Research 39 7 (2001) 1343-1365
59. Schwindt C., and Zimmermann J. A steepest ascent approach to maximizing the net present value of projects. Mathematical Methods of Operations Research 53 3 (2001) 435-450
60. Sprecher A., Hartmann S., and Drexl A. An exact algorithm for project scheduling with multiple modes. OR Spektrum 19 3 (1997) 195-203
61. Sprecher A., Kolisch R., and Drexl A. Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research 80 1 (1995) 94-102
62. Sprecher A., and Drexl A. Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. European Journal of Operational Research 107 2 (1998) 431-450
63. Sprecher A. Scheduling resource-constrained projects competitively at modest memory requirements. Management Science 46 5 (2000) 710-723
64. Stork F., and Uetz M. On the generation of circuits and minimal forbidden sets. Mathematical Programming A. 102 (2005) 185-203
65. Taylor B.W., Moore J.L., and Clayton E.R. R& D project selection and manpower allocation with integer nonlinear goal programming. Management Science 28 10 (1982) 1149-1158
66. Tormos P., and Lova A. A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research 102 (2001) 65-81
67. Ulusoy G., Sivrikaya-Serifoglu F., and Sahin S. Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows. Annals of Operations Research 102 (2001) 237-261
68. Urban G.L., Carter T., Gaskin S., and Mucha Z. Market share rewards to pioneering brands: An empirical analysis and strategic implications. Management Science 32 6 (1986) 645-659
69. Valls, V., Ballestin, F., Quintanilla, M.S., 2003. A hybrid genetic algorithm for the RCPSP. Technical Report, Department of Statistics and Operations Research, University of Valencia.
70. Valls V., Ballesti{dotless}́n F., and Quintanilla M.S. Justification and RCPSP: A technique that pays. European Journal of Operational Research 165 2 (2005) 375-386
71. Vanhoucke M., Demeulemeester E., and Herroelen W. An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research 102 (2001) 179-196
72. Vanhoucke M., Demeulemeester E., and Herroelen W. On maximizing the net present value of a project under renewable resource constraints. Management Science 47 8 (2001) 1113-1121