Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

Abstract We consider the so-called parallel and serial scheduling method for the classical resource-constrained project scheduling problem. Theoretical results on the class of schedules generated by each method are provided. Furthermore, an in-depth computational study is undertaken to investigate the relationship of single-pass scheduling and sampling for both methods. It is shown that the performance-ranking of priority rules does not differ for single-pass scheduling and sampling, that sampling improves the performance of single-pass scheduling significantly, and that the parallel method cannot be generally considered as superior.

[1]  Robert J Willis,et al.  An iterative scheduling technique for resource-constrained project scheduling , 1992 .

[2]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[3]  J. B. Ritter,et al.  The Critical-Path Method , 1965 .

[4]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

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

[6]  Andreas Drexl,et al.  Scheduling of Project Networks by Job Assignment , 1991 .

[7]  Salah E. Elmaghraby,et al.  On the measurement of complexity in activity networks , 1980 .

[8]  Dale F. Cooper,et al.  Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation , 1976 .

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

[10]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[11]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[12]  Jerzy Kamburowski,et al.  Optimal Reductions of Two-Terminal Directed Acyclic Graphs , 1992, SIAM J. Comput..

[13]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[14]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[15]  Linus Schrage,et al.  A More Portable Fortran Random Number Generator , 1979, TOMS.

[16]  Albert Battersby,et al.  Advances in Critical Path Methods , 1966 .

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

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

[19]  Arne Thesen,et al.  Heuristic Scheduling of Activities under Resource and Precedence Restrictions , 1976 .

[20]  N. A. J. Hastings,et al.  On Resource Allocation in Project Networks , 1972 .

[21]  F. Radermacher.  Scheduling of project networks , 1985 .

[22]  Colin E. Bell,et al.  Solving resource-constrained project scheduling problems by A* search , 1990 .

[23]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[24]  Osman Oguz,et al.  A comparative study of computational procedures for the resource constrained project scheduling problem , 1994 .

[25]  F K Levy,et al.  Multiship, multishop, workload‐smoothing progfum , 1962 .

[26]  V. Jorge Leon,et al.  Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling , 1995 .

[27]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

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

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

[30]  R. K. Sachdeva,et al.  Distributed simulation of resource constrained project scheduling , 1989, Comput. Oper. Res..

[31]  J. D. Wiest,et al.  A Heuristic Model for Scheduling Large Projects with Limited Resources , 1967 .

[32]  Rainer Kolisch,et al.  Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem , 1995 .

[33]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[34]  David D. Bedworth,et al.  Integrated Production, Control Systems: Management, Analysis, and Design , 1982 .

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

[36]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

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

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

[39]  E. Beale,et al.  Applications of Mathematical Programming Techniques. , 1971 .

[40]  J. Carlier,et al.  Une méthode arborescente pour résoudre les problèmes cumulatifs , 1991 .

[41]  Elsayed A. Elsayed,et al.  Algorithms for project scheduling with resource constraints , 1982 .

[42]  Elliott N. Weiss,et al.  Local search techniques for the generalized resource constrained project scheduling problem , 1993 .

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

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

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

[46]  E. W. Davis,et al.  Project Planning by Network Analysis. , 1972 .

[47]  Colin E. Bell,et al.  A new heuristic solution method in resource‐constrained project scheduling , 1991 .

[48]  José Manuel Tamarit Goerlich,et al.  Algoritmos heurísticos deterministas y aleatorios en secuenciación de proyectos con recursos limitados , 1989 .

[49]  James Herbert Patterson,et al.  Alternate Methods of Project Scheduling with Limited Resources , 1973 .

[50]  Gary E. Whitehouse,et al.  GENRES: An extension of Brooks Algorithm for project scheduling with resource constraints , 1979 .

[51]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[52]  Willy Herroelen,et al.  On the use of the complexity index as a measure of complexity in activity networks , 1996 .

[53]  James H. Patterson,et al.  Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming Approach , 1976 .

[54]  F. F. Boctor,et al.  Some efficient multi-heuristic procedures for resource-constrained project scheduling , 1990 .

[55]  Ramón Alvarez-Valdés Olaguíbel,et al.  Chapter 5 – HEURISTIC ALGORITHMS FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING: A REVIEW AND AN EMPIRICAL ANALYSIS , 1989 .

[56]  Gündüz Ulusoy,et al.  Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling , 1989 .

[57]  Andreas Drexl,et al.  Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .