A Multi-Stage Decomposition Approach for a Resource Constrained Project Scheduling Problem

  • P. Serafini
  • M. G. Speranza
Part of the CISM International Centre for Mechanical Sciences book series (CISM, volume 320)


A Decision Support System for a resource constrained scheduling problem is described. Great attention is given to the interactive algorithmic support. The DSS is based upon a decomposition of the problem which adheres to the associated decision process. Combinatorial algorithms are introduced in order to support each of the resulting subproblems. The subproblems are described, together with the main features of the implemented prototype.


Schedule Problem Critical Path Precedence Constraint Feasible Schedule Resource Assignment 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Adams, J., E. Balas and D. Zawack, 1988, “The Shifting Bottleneck Procedure for Job Shop Scheduling”, Management Science, 34, 391–401MathSciNetCrossRefMATHGoogle Scholar
  2. Anthonisse, J.M., K. M. Van Hee and J.K. Lenstra, 1988, “Resource-Constrained Project Scheduling: an International Exercise in DSS Development”, Decision Support Systems, 4, 12Google Scholar
  3. Carlier, J., 1982, “The One-Machine Sequencing Problem”, European J. of Operational Research, 11, 42–47MathSciNetCrossRefMATHGoogle Scholar
  4. Carlier, J. Anl E. Pinson. 1986, “Une méthode arborescente pour optimiser la durée d’un job-shop”, Le cahiers de l’Institut de Mathématiques Appliquées, Angers, ISSN 02942755Google Scholar
  5. Christofides, N., R. Alvarez-Valdes and J.M. Tamarit, 1987, “Project Scheduling under Resource Constraints”, European J. of Operational Research, 29, 262–273MathSciNetCrossRefMATHGoogle Scholar
  6. Fisher, H. and G.L. Thompson, 1963, “Probabilistic learning. Combinations of local Job Shop Scheduling Rules”, Industrial Scheduling, J.F. Muth and G.L. Thompson, eds., Prentice Hall, Englewood Cliffs, N.J., 225–251Google Scholar
  7. Garey, M.R. and D.S. Johnson, 1979, Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman, San FranciscoMATHGoogle Scholar
  8. Goldberg, A.V. and R.E. Tarjan, 1987, “Solving Minimum-Cost Flow Problems by Successive Approximation”, Proc. 19th Annual ACM Symposium on Theory of Computing, 7–18Google Scholar
  9. Goldberg, A.V. and R.E. Tarjan, 1990, “Finding Minimum Cost Circulations by Successive Approximation”, Mathematics of Operations Research, 15, 430–466MathSciNetCrossRefMATHGoogle Scholar
  10. Lancia, G., 1990, “Combinatorial and Network Flow Algorithms for Optimal Project Scheduling”, Thesis, Faculty of Sciences, University of Udine (in English)Google Scholar
  11. Lenstra J.K. and A.H.G. Rinnooy Kan, 1985, “Sequencing and Scheduling”, Combinatorial Optimization: Annotated Bibliographies, M. O’hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds., Wiley and SonsGoogle Scholar
  12. Patterson, J.H., 1984, “A Comparison of Exact Approaches for Solving the Multiple Constrained Resource Project Scheduling Problem”, Management Science, 30, 854–867CrossRefGoogle Scholar
  13. Rinnooy Kan, A.H.K., 1976, Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The HagueGoogle Scholar
  14. Rockafellar, R. T., 1984, Network Flows and Monotropic Optimization,Wiley andGoogle Scholar
  15. Serafini, P. and M.G. Speranza, 1988, “Resource Assignment in a DSS for Project scheduling”, Proceedings of the Conference “Multiobjective Problems of Mathematical Programming, Yalta October 26 — November 2 1988Google Scholar
  16. Serafini, P. and W. Ukovich, 1988, “A Decision Support System Based on the Job Shop Problem in Real Manufacturing”, Methodology and Software for Interactive Decision Support, IIASA ed., Springer, BerlinGoogle Scholar
  17. Serafini, P., W. Ukovich, H. Kirchner, F. Giardina and F. Tiozzo, 1989, “Job Shop Scheduling: a Case Study”, Operations Research Models In Flexible Manufacturing Systems, F. Archetti, M. Lucertini and P. Serafini, eds., Springer, ViennaGoogle Scholar
  18. Silver, M.S., 1988, “Descriptive Analysis for Computer-Based Decision Support”, Op. Res., 36, 904–916CrossRefGoogle Scholar
  19. Speranza, M.G. and C. Vercellis, 1990, “Hierarchical Models for Multi-Project Planning and Scheduling”, Proceedings of the “Second Workshop on Project Management and Scheduling, Compiegne, France, June 20–22, 1990Google Scholar

Copyright information

© Springer-Verlag Wien 1991

Authors and Affiliations

  • P. Serafini
    • 1
  • M. G. Speranza
    • 1
  1. 1.Università di UdineUdineItaly

Personalised recommendations