Hierarchical models for multi-project planning and scheduling

Abstract We propose a model-based approach to nonpreemptive multi-project management problems, based on a hierarchical two-stage decomposition of the planning and scheduling process. Two performance criteria are considered: the net present value, which includes investment costs, operating costs, revenues, penalties for late completion; and the service level, expressed as the agreement between the completion times of the different projects and the customer needs. The resulting hierarchy of integer programming models is aimed at assisting the planners in understanding the interrelations among the allocation of resources, the timing of the activities, the cash flows. A class of branch-and-bound procedures is then proposed for the solution of these integer programming models.

[1]  J. H. Patterson,et al.  An Algorithm for a general class of precedence and resource constrained scheduling problems , 1989 .

[2]  Samuel Corenstein An Algorithm for Project (Job) Sequencing with Resource Constraints , 1972, Oper. Res..

[3]  Egon Balas,et al.  PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS. , 1968 .

[4]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[5]  I. Kurtulus,et al.  Multi-Project Scheduling: Categorization of Heuristic Rules Performance , 1982 .

[6]  James H. Patterson,et al.  Project scheduling: The effects of problem structure on heuristic performance , 1976 .

[7]  A. H. Russell Cash Flows in Networks , 1970 .

[8]  J. MacGregor Smith,et al.  A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems , 1988 .

[9]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[10]  Richard F. Deckro,et al.  A multiple objective programming framework for tradeoffs in project scheduling , 1990 .

[11]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[12]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[13]  Salah E. Elmaghraby,et al.  The scheduling of activities to maximize the net present value of projects , 1990 .

[14]  Robert A. Russell,et al.  A comparison of heuristics for scheduling projects with cash flows and resource restrictions , 1986 .

[15]  J. Patterson,et al.  Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach , 1977 .

[16]  Subhash C. Narula,et al.  Multi-Project Scheduling: Analysis of Project Performance , 1985 .

[17]  Edward W. Davis,et al.  An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints , 1971 .

[18]  James H. Patterson,et al.  An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems , 1978 .

[19]  L. Valadares Tavares Optimal resource profiles for program scheduling , 1987 .

[20]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[21]  James H. Patterson,et al.  A Horizon-Varying, Zero-One Approach to Project Scheduling , 1974 .

[22]  R. Słowiński Multiobjective network scheduling with efficient use of renewable and nonrenewable resources , 1981 .

[23]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .