IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v217y2014i1p95-11610.1007-s10479-014-1555-0.html
   My bibliography  Save this article

Multi-project scheduling with two-stage decomposition

Author

Listed:
  • Anıl Can
  • Gündüz Ulusoy

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. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Anıl Can & Gündüz Ulusoy, 2014. "Multi-project scheduling with two-stage decomposition," Annals of Operations Research, Springer, vol. 217(1), pages 95-116, June.
    • Handle: RePEc:spr:annopr:v:217:y:2014:i:1:p:95-116:10.1007/s10479-014-1555-0
    DOI: 10.1007/s10479-014-1555-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-014-1555-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-014-1555-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
    2. Rainer Kolisch & Arno Sprecher & Andreas Drexl, 1995. "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, INFORMS, vol. 41(10), pages 1693-1703, October.
    3. A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
    4. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    5. Giuseppe Confessore & Stefano Giordani & Silvia Rismondo, 2007. "A market-based multi-agent system model for decentralized multi-project scheduling," Annals of Operations Research, Springer, vol. 150(1), pages 115-135, March.
    6. Sönke Hartmann, 2001. "Project Scheduling with Multiple Modes: A Genetic Algorithm," Annals of Operations Research, Springer, vol. 102(1), pages 111-135, February.
    7. Hartmann, Sonke & Kolisch, Rainer, 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 394-407, December.
    8. Hartmann, Sönke & Kolisch, R., 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 11180, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    9. Hans, E.W. & Herroelen, W. & Leus, R. & Wullink, G., 2007. "A hierarchical approach to multi-project planning under uncertainty," Omega, Elsevier, vol. 35(5), pages 563-577, October.
    10. Antonio Lova & Pilar Tormos, 2001. "Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling," Annals of Operations Research, Springer, vol. 102(1), pages 263-286, February.
    11. M.L. Mittal & Arun Kanda, 2009. "Two-phase heuristics for scheduling of multiple projects," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 4(2), pages 159-177.
    12. Lawrence, Stephen R. & Morton, Thomas E., 1993. "Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics," European Journal of Operational Research, Elsevier, vol. 64(2), pages 168-187, January.
    13. Matthew J. Liberatore & George J. Titus, 1983. "The Practice of Management Science in R&D Project Management," Management Science, INFORMS, vol. 29(8), pages 962-974, August.
    14. Yang, Kum-Khiong & Sum, Chee-Chuong, 1997. "An evaluation of due date, resource allocation, project release, and activity scheduling rules in a multiproject environment," European Journal of Operational Research, Elsevier, vol. 103(1), pages 139-154, November.
    15. Speranza, M. Grazia & Vercellis, Carlo, 1993. "Hierarchical models for multi-project planning and scheduling," European Journal of Operational Research, Elsevier, vol. 64(2), pages 312-325, January.
    16. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. I. Kurtulus & E. W. Davis, 1982. "Multi-Project Scheduling: Categorization of Heuristic Rules Performance," Management Science, INFORMS, vol. 28(2), pages 161-172, February.
    18. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    19. Kolisch, Rainer & Hartmann, Sönke, 1999. "Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10966, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    20. Tsubakitani, Shigeru & Deckro, Richard F., 1990. "A heuristic for multi-project scheduling with limited resources in the housing industry," European Journal of Operational Research, Elsevier, vol. 49(1), pages 80-91, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Feifei Li & Zhe Xu, 2018. "A multi-agent system for distributed multi-project scheduling with two-stage decomposition," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-24, October.
    2. He, Yukang & Jia, Tao & Zheng, Weibo, 2023. "Tabu search for dedicated resource-constrained multiproject scheduling to minimise the maximal cash flow gap under uncertainty," European Journal of Operational Research, Elsevier, vol. 310(1), pages 34-52.
    3. Gómez Sánchez, Mariam & Lalla-Ruiz, Eduardo & Fernández Gil, Alejandro & Castro, Carlos & Voß, Stefan, 2023. "Resource-constrained multi-project scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 309(3), pages 958-976.
    4. Wuliang Peng & Jiali lin & Jingwen Zhang & Liangwei Chen, 2022. "A bi-objective hierarchical program scheduling problem and its solution based on NSGA-III," Annals of Operations Research, Springer, vol. 308(1), pages 389-414, January.
    5. Arda Turkgenci & Huseyin Guden & Mehmet Gülşen, 2021. "Decomposition based extended project scheduling for make-to-order production," Operational Research, Springer, vol. 21(2), pages 801-825, June.
    6. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.
    7. Sergey Kovalev, 2015. "Maximizing total tardiness on a single machine in $$O(n^2)$$ O ( n 2 ) time via a reduction to half-product minimization," Annals of Operations Research, Springer, vol. 235(1), pages 815-819, December.
    8. Bredael, Dries & Vanhoucke, Mario, 2023. "Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates," European Journal of Operational Research, Elsevier, vol. 308(1), pages 54-75.
    9. Mohammad Rostami & Morteza Bagherpour, 2020. "A lagrangian relaxation algorithm for facility location of resource-constrained decentralized multi-project scheduling problems," Operational Research, Springer, vol. 20(2), pages 857-897, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Browning, Tyson R. & Yassine, Ali A., 2010. "Resource-constrained multi-project scheduling: Priority rule performance revisited," International Journal of Production Economics, Elsevier, vol. 126(2), pages 212-228, August.
    2. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    3. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    4. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    5. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    6. Bredael, Dries & Vanhoucke, Mario, 2023. "Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates," European Journal of Operational Research, Elsevier, vol. 308(1), pages 54-75.
    7. Van Peteghem, Vincent & Vanhoucke, Mario, 2014. "An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances," European Journal of Operational Research, Elsevier, vol. 235(1), pages 62-72.
    8. Krüger, Doreen & Scholl, Armin, 2009. "A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times," European Journal of Operational Research, Elsevier, vol. 197(2), pages 492-508, September.
    9. Gómez Sánchez, Mariam & Lalla-Ruiz, Eduardo & Fernández Gil, Alejandro & Castro, Carlos & Voß, Stefan, 2023. "Resource-constrained multi-project scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 309(3), pages 958-976.
    10. Peteghem, Vincent Van & Vanhoucke, Mario, 2010. "A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 409-418, March.
    11. Rob Eynde & Mario Vanhoucke, 2020. "Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling," Journal of Scheduling, Springer, vol. 23(3), pages 301-325, June.
    12. Feifei Li & Zhe Xu, 2018. "A multi-agent system for distributed multi-project scheduling with two-stage decomposition," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-24, October.
    13. He, Naihui & Zhang, David Z. & Yuce, Baris, 2022. "Integrated multi-project planning and scheduling - a multiagent approach," European Journal of Operational Research, Elsevier, vol. 302(2), pages 688-699.
    14. Wuliang Peng & Jiali lin & Jingwen Zhang & Liangwei Chen, 2022. "A bi-objective hierarchical program scheduling problem and its solution based on NSGA-III," Annals of Operations Research, Springer, vol. 308(1), pages 389-414, January.
    15. V. Van Peteghem & M. Vanhoucke, 2008. "A Genetic Algorithm for the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 08/494, Ghent University, Faculty of Economics and Business Administration.
    16. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    17. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustín Barrios-Sarmiento, 2022. "An adaptative bacterial foraging optimization algorithm for solving the MRCPSP with discounted cash flows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 221-248, July.
    18. Nima Zoraghi & Aria Shahsavar & Babak Abbasi & Vincent Peteghem, 2017. "Multi-mode resource-constrained project scheduling problem with material ordering under bonus–penalty policies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 49-79, April.
    19. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    20. Buddhakulsomsiri, Jirachai & Kim, David S., 2006. "Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting," European Journal of Operational Research, Elsevier, vol. 175(1), pages 279-295, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:217:y:2014:i:1:p:95-116:10.1007/s10479-014-1555-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.