Selection and scheduling of pharmaceutical research projects

International Series in Operations Research and Management Science

Volumn 92, Issue , 2006, Pages 321-344

  Kolisch, Rainer ^a   Meyer, Konrad ^b  

^a TUM SCHOOL OF MANAGEMENT   (Germany)

^b Kastor Haus   (Germany)

Author keywords

Heuristics; Lead optimization; Multi mode resource constrained project scheduling; Pharmaceutical R D

Indexed keywords

EID: 84955259221     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (26)

1. Bartusch, M., Mohring, R.H. and Radermacher, F.J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16:201-240.
2. Brucker, P., Drexl, A., Mohring, R., Neumann, K. and Pesch, E, (1999). Resourceconstrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112(1):3-41.
3. Coffin, M.A. and Taylor, B.W. (1996). R&D project selection and scheduling with a filtered beam search approach. HE Transactions 28:167-176.
4. De Reyck, B., Demeulemeester, E. and Herroelen, W. (1998). Local search methods for the discrete time/resource trade-off problem in project networks. Naval Research Logistics 45:553-578.
5. Drexl, A., Juretzka, J., Salewski, F. and Schirmer, A. (1999). New modeling concepts and their impact on resource-constrained project scheduling, in: Project Scheduling - Recent Models, Algorithms and Applications Węglarz, J, ed,, Kluwer Academic Publishers, Boston, pp. 413-432.
6. Fox, G.E., Baker, N.R. and Bryant, J. L. (1984). Economic models for R and D project selection in the presence of project interactions. Management Science 30(7):890-902.
7. Heidenberger, K. (1996). Dynamic project selection and funding under risk: A decision tree based MILP approach. European Journal of Operational Research 95:284-298.
8. Heilmann, R. (2001). Resource-constrained project scheduling: A heuristic for the multi-mode case. OR Spektrum 23:335-357.
9. Kolisch, R. (1996). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90:320-333.
10. Kolisch, R. and Hartmann, S. (1999). Heuristic algorithms for the resourceconstrained project scheduling problem: Classification and computational analysis, in: Project Scheduling - Recent Models, Algorithms and Applications, J. Węglarz, ed, Kluwer Academic Publishers, Boston, pp. 147-178.
11. Kolisch, R., Meyer, K., Mohr, R., Schwindt, C. and Urmann, M. (2003). Ablaufplanung fur die Leitstrukturoptimierung in der Pharmaforschung. Zeitschrift fur Betriebswirtschaft 73(8):825-848.
12. Leon, V.J. and Ramamoorthy, B. (1995). Strength and adaptability of problemspace based neighborhoods for resource-constrained scheduling. OR Spektrum 11 (2/3):173-182
13. Loch, C.H. and Bode-Greuel, K. (2001). Evaluating growth options as sources of value for pharmaceutical resrearch projects. R&D Management 31(2):231-248.
14. Luh, P.B., Liu, F. and Moser, B. (1999). Scheduling of design projects with uncertain number of iterations. European Journal of Operational Research 113:575-592.
15. Matsumoto, M. and Nishimura, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation 8(l):3-30.
16. Naphade, K. S., Wu, S.D. and Storer, R.H. (1997). Problem space search algorithms for resource-constrained project scheduling. Annals of Operations Research 70:307-326.
17. Neumann, K., Schwindt, C. and Zimmermann, J, (2003). Project Scheduling with Time Windows and Scarce Resources. Springer, 2. edition.
18. Patterson, J.H., Slowiriski, R., Talbot, F.B. and Węglarz, J. (1990). Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems. European Journal of Operational Research 49:68-79.
19. Salewski, F., Schirmer, A. and Drexl, A. (1997). Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application. European Journal of Operational Research 102:88-110.
20. Schoffski, O., Fricke, F.-U., Guminski, W. and Hartmann, W., editors (2002). Pharmabetriebslehre, Springer.
21. Sprecher, A. and Drexl, A. (1998). Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research 107(2):431-450.
22. Storer, R.H., Wu, S.D. and Vaccari, R. (1992). New search spaces for sequencing problems with application to job shop scheduling. Management Science 38(10): 1495-1509.
23. Talbot, F.B. (1982). Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science 28(10): 1197-1210.
24. Taylor, B.W., Moore, L.J. and Clayton, E.R. (1982). R&D project selection and manpower allocation with integer nonlinear goal programming. Management Science 28(10):1149-1158
25. Venkatraman, R. and Venkatraman, S. (1995). R&D project selection and scheduling for organizations facing product obsolescence. R&D Management 25(1): 57-70.
26. Viswanadham, N. and Narahari, Y. (2001). Queueing network modelling and lead time compression of pharmaceutical drug development. International Journal of Production Research 39(2): 395-412.