Skip to main content

Advertisement

Springer Nature Link
Log in

Multi-project scheduling with two-stage decomposition

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider a non-preemptive, zero time lag multi-project scheduling problem with multiple modes and limited renewable and nonrenewable resources. A two-stage decomposition approach is adopted to formulate the problem as a hierarchy of 0-1 mathematical programming models. In stage one; each project is reduced to a macro-activity with macro-modes. The macro-activities are combined into a single macro-activity network over which the macro-activity scheduling problem (MP) is defined, where the objective is the maximization of the net present value with positive cash flows and the renewable resource requirements are time-dependent. An exact solution procedure and a genetic algorithm (GA) approach are proposed for solving the MP. A GA is also employed to generate an initial solution for the exact solution procedure. The first stage terminates with a post-processing procedure to distribute the remaining resource capacities. Using the start times and the resource profiles obtained in stage one, each project is scheduled in stage two for minimum makespan. Three new test problem sets are generated with 81, 84 and 27 problems each, and three different configurations of solution procedures are tested.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Bock, D. B., & Patterson, J. H. (1990). A comparison of due date setting, resource assignment and job preemption heuristics for multi-project scheduling problem. Decision Sciences, 21, 387–402.

    Article  Google Scholar 

  • Confessore, G., Giordani, S., & Rismondo, S. (2007). A market-based multi-agent system model for decentralized multi-project scheduling. Annals of Operations Research, 150, 115–135.

    Article  Google Scholar 

  • Gonçalves, J. F., Mendes, J. J. M., & Resende, M. G. C. (2008). A genetic algorithm for the resource constrained multi-project problem. European Journal of Operational Research, 189, 1171–1190.

    Article  Google Scholar 

  • Hans, E. W., Herroelen, W., Leus, R., & Wullink, G. (2007). A hierarchical approach to multi-project planning under uncertainty. Omega, 35, 563–577.

    Article  Google Scholar 

  • Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics, 45, 733–750.

    Article  Google Scholar 

  • Hartmann, S. (2001). Project scheduling with multiple modes: A genetic algorithm. Annals of Operations Research, 102, 733–750.

    Article  Google Scholar 

  • Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 127(2), 394–407.

    Article  Google Scholar 

  • Herroelen, W. S., Van Dommelen, P., & Demeulemeester, E. L. (1997). Project network models with discounted cash flows: A guided tour through recent developments. European Journal of Operational Research, 100, 97–121.

    Article  Google Scholar 

  • Homberger, J. (2007). A multi-agent system for the decentralized resource-constrained multi-project scheduling problem. International Transactions in Operational Research, 14, 565–589.

    Article  Google Scholar 

  • Homberger, J. (2012). A (μ, λ)-coordination mechanism for agent-based multi-project scheduling. OR Spectrum, 34, 107–132.

    Article  Google Scholar 

  • Kim, S. O., & Schniederjans, M. J. (1989). Heuristic framework for the resource constrained multi-project scheduling problem. Computers and Operations Research, 16, 541–556.

    Article  Google Scholar 

  • Kolisch, R. (1995). Project scheduling under resource constraints-efficient heuristics for several problem classes. Heidelberg: Physica-Verlag.

    Book  Google Scholar 

  • Kolisch, R. (1996). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90, 320–333.

    Article  Google Scholar 

  • Kolisch, R., & Drexl, A. (1997). Local search for non-preemptive multi-mode resource-constrained project scheduling. IIE Transactions, 29, 987–999.

    Google Scholar 

  • Kolisch, R., & Hartmann, S. (1999). Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. In J. Weglarz (Ed.), Project scheduling: Recent models, algorithms and applications (pp. 147–178). Amsterdam: Kluwer Academic Publishers.

    Chapter  Google Scholar 

  • Kolisch, R., & Sprecher, A. (1996). PSPLIB—A project scheduling problem library. European Journal of Operational Research, 96, 205–216.

    Article  Google Scholar 

  • Kolisch, R., Sprecher, A., & Drexl, A. (1995). Characterization of generation of a general class of resource-constrained project scheduling problems. Management Science, 41, 1693–1703.

    Article  Google Scholar 

  • Kumanan, S., Jegan, J. G., & Raja, K. (2006). Multi-project scheduling using an heuristic and a genetic algorithm. International Journal of Advanced Manufacturing Technology, 31, 360–366.

    Article  Google Scholar 

  • Kurtulus, I., & Davis, E. W. (1982). Multi-project scheduling: Categorization of heuristic rules performance. Management Science, 28, 161–172.

    Article  Google Scholar 

  • Kurtulus, I. S., & Narula, S. C. (1985). Multi-project scheduling: Analysis of project performance. IIE Transactions, 17, 58–66.

    Article  Google Scholar 

  • Lawrence, S. R., & Morton, E. T. (1993). Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics. European Journal of Operational Research, 64, 168–187.

    Article  Google Scholar 

  • Lee, Y., Kumara, S. R. T., & Chatterjee, K. (2003). Multiagent based dynamic resource scheduling for distributed multiple projects using a market mechanism. Journal of Intelligent Manufacturing, 14, 471–484.

    Article  Google Scholar 

  • Liberatore, J. M., Pollack-Johnson, B., & Smith, A. S. (2001). Project Management in construction: Software use and research directions. Journal of Construction Engineering and Management, 127, 101–107.

    Article  Google Scholar 

  • Liberatore, J. M., & Titus, G. J. (1983). The practice of management in R&D project management. Management Science, 29, 962–974.

    Article  Google Scholar 

  • Lova, A., & Tormos, P. (2001). Analysis of scheduling schemes and heuristic rules performance in resource-constrained multi-project scheduling. Annals of Operations Research, 102, 263–286.

    Article  Google Scholar 

  • Mittal, M. L., & Kanda, A. (2009). Two-phase heuristics for scheduling of multiple projects. International Journal of Operational Research, 4, 159–177.

    Article  Google Scholar 

  • Payne, J. H. (1995). Management of multiple simultaneous projects: A state-of-the-art review. International Journal of Project Management, 13, 163–168.

    Article  Google Scholar 

  • Pritsker, L. J., Walters, A. A. B., & Wolfe, P. M. (1969). Multi-project scheduling with limited resources: A zero one programming approach. Management Science, 16, 93–108.

    Article  Google Scholar 

  • Şerifoğlu, F. (1997). A new uniform order-based crossover operator for genetic algorithm applications to multi-component combinatorial optimization problems. Unpublished Ph.D. Dissertation, Boğaziçi University, Istanbul.

  • Speranza, M. G., & Vercellis, C. (1993). Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, 64, 312–325.

    Article  Google Scholar 

  • Tsubakitani, S., & Deckro, R. F. (1990). A heuristic for multi-project scheduling with limited resources in the housing industry. European Journal of Operational Research, 49, 80–91.

    Article  Google Scholar 

  • Yang, K. K., & Sum, C. (1993). A comparison of resource allocation and activity scheduling rules in a dynamic multi-project scheduling environment. Journal of Operations Management, 11, 207–218.

    Article  Google Scholar 

  • Yang, K. K., & Sum, C. (1997). An evaluation of due date, resource allocation, project release, and activity scheduling rules in a multi-project environment. European Journal of Operational Research, 103, 139–154.

    Article  Google Scholar 

  • Zapata, J. C., Hodge, B. M., & Reklaitis, G. V. (2008). The multimode resource constrained multi-project scheduling problem: Alternative formulations. AIChE Journal, 54, 2101–2119.

    Article  Google Scholar 

Download references

Acknowledgement

We gratefully acknowledge the support given by the Scientific and Technological Research Council of Turkey through Project Number MAG 109M571.

Author information

Authors and Affiliations

  1. Sabancı University, Orhanlı, Tuzla, 34956, Istanbul, Turkey

    Anıl Can & Gündüz Ulusoy

Authors
  1. Anıl Can
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Gündüz Ulusoy
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Gündüz Ulusoy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Can, A., Ulusoy, G. Multi-project scheduling with two-stage decomposition. Ann Oper Res 217, 95–116 (2014). https://doi.org/10.1007/s10479-014-1555-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-014-1555-0

Keywords