Project Portfolio Management: Capacity Allocation, Downsizing Decisions and Sequencing Rules

This paper aims to gain insight into capacity allocation, downsizing decisions and sequencing rules when managing a portfolio of projects. By downsizing, we mean reducing the scale or size of a project and thereby changing the project's content. In previous work, we have determined the amount of critical capacity that is optimally allocated to concurrently executed projects with deterministic or stochastic workloads when the impact of downsizing is known. In this paper, we extend this view with the possibility of sequential processing, which implies that a complete order is imposed on the projects. When projects are sequenced instead of executed in parallel, two effects come into play: firstly, unused capacity can be shifted to later projects in the same period; and secondly, reinvestment revenues gain importance because of the differences in realization time of the sequenced projects. When project workloads are known, only the second effect counts; when project workloads are stochastic, however, the project's capacity usage is uncertain so that unused capacity can be shifted to later projects in the same period. In this case, both effects need to be taken into account. In this paper, we determine optimal sequencing rules when the selection and capacity-allocation decisions for a set of projects have already been made. We also consider a combination of parallel and sequential planning and we perform simulation experiments that confirm the appropriateness of our capacity-allocation methods.

[1]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  T. Keelin,et al.  How SmithKline Beecham makes better resource-allocation decisions. , 1998, Harvard business review.

[3]  David Simchi-Levi,et al.  Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era (International Series in Operations Research & Management Science) , 2004 .

[4]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[5]  David R. Karger,et al.  Techniques for scheduling with rejection , 1998, J. Algorithms.

[6]  Susan A. Slotnick,et al.  Order acceptance with weighted tardiness , 2007, Comput. Oper. Res..

[7]  Ronald G. Askin,et al.  Project selection, scheduling and resource allocation with time dependent returns , 2009, Eur. J. Oper. Res..

[8]  R. A. Blau N-Job, One Machine Sequencing Problems Under Uncertainty , 1973 .

[9]  Bahram Alidaee,et al.  Greedy solutions of selection and ordering problems , 2001, Eur. J. Oper. Res..

[10]  K. Clark,et al.  Creating project plans to focus product development. , 1992, Harvard business review.

[11]  Robin O. Roundy,et al.  Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms , 2005 .

[12]  Christoph H. Loch,et al.  Project Selection Under Uncertainty , 2004 .

[13]  Jerzy Kyparisis,et al.  Note-Project Selection and Sequencing to Maximize Net Present Value of the Total Return , 1992 .

[14]  R. Cooper,et al.  Portfolio management for new product development: results of an industry practices study , 2001 .

[15]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[16]  Walter O. Rom,et al.  Order acceptance using genetic algorithms , 2009, Comput. Oper. Res..

[17]  Herbert F. Lewis,et al.  Multi-period job selection: planning work loads to maximize profit , 2002, Comput. Oper. Res..

[18]  Christoph H. Loch,et al.  Project Selection Under Uncertainty: Dynamically Allocating Resources to Maximize Value , 2004 .

[19]  Prabuddha De,et al.  On the minimization of the weighted number of tardy jobs with random processing times and deadline , 1991, Comput. Oper. Res..

[20]  Aroop K. Mahanty,et al.  THEORY OF PRODUCTION , 1980 .

[21]  Paul S. Adler,et al.  From project to process management: an empirically-based framework for analyzing product development time , 1995 .

[22]  Jay B. Ghosh,et al.  Job selection in a heavily loaded shop , 1997, Comput. Oper. Res..

[23]  Joseph Geunes,et al.  A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times , 2007, Comput. Ind. Eng..

[24]  Jinjiang Yuan,et al.  The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan , 2008, Theor. Comput. Sci..

[25]  S. Tayur,et al.  Due Date Management Policies , 2004 .

[26]  R. Leus,et al.  Capacity allocation and downsizing decisions in project portfolio management , 2008 .