IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n451090.html

Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set

Author

Listed:
  • Yi Han
  • Ikou Kaku
  • Jianhu Cai
  • Yanlai Li
  • Chao Yang
  • Lili Deng

Abstract

This paper presents a shuffled frog leaping algorithm (SFLA) for the single‐mode resource‐constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period. The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management. A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects. Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second. This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved.

Suggested Citation

  • Yi Han & Ikou Kaku & Jianhu Cai & Yanlai Li & Chao Yang & Lili Deng, 2013. "Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:451090
    DOI: 10.1155/2013/451090
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/451090
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/451090?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
    ---><---

    References listed on IDEAS

    as
    1. Surafel Luleseged Tilahun & Hong Choon Ong, 2012. "Modified Firefly Algorithm," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-12, November.
    2. Lipu Zhang & Yinghong Xu & Yousong Liu, 2012. "An Elite Decision Making Harmony Search Algorithm for Optimization Problem," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-15, July.
    3. Yingcheng Xu & Li Wang & Yuexiang Yang, 2013. "Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-12, February.
    4. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    5. Surafel Luleseged Tilahun & Hong Choon Ong, 2012. "Modified Firefly Algorithm," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    6. Al-Fawzan, M. A. & Haouari, Mohamed, 2005. "A bi-objective model for robust resource-constrained project scheduling," International Journal of Production Economics, Elsevier, vol. 96(2), pages 175-187, May.
    7. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1998. "A heuristic for network project scheduling with random activity durations depending on the resource allocation," International Journal of Production Economics, Elsevier, vol. 55(2), pages 149-162, July.
    8. Yingcheng Xu & Li Wang & Yuexiang Yang, 2013. "Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    9. Lipu Zhang & Yinghong Xu & Yousong Liu, 2012. "An Elite Decision Making Harmony Search Algorithm for Optimization Problem," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    Full references (including those not matched with items on IDEAS)

    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. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    2. Shuhao Yu & Shanlin Yang & Shoubao Su, 2013. "Self‐Adaptive Step Firefly Algorithm," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    3. Phinit Tontragunrat & Sujin Bureerat, 2013. "Antioptimisation of Trusses Using Two‐Level Population‐Based Incremental Learning," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    4. Akemi Gálvez & Andrés Iglesias, 2013. "Firefly Algorithm for Polynomial Bézier Surface Parameterization," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    5. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    6. Mohammed Azmi Al-Betar & Ahamad Tajudin Khader & Mohammed A. Awadallah & Mahmmoud Hafsaldin Alawan & Belal Zaqaibeh, 2013. "Cellular Harmony Search for Optimization Problems," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    7. 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.
    8. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    9. 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).
    10. KIlIç, Murat & Ulusoy, Gündüz & Serifoglu, Funda Sivrikaya, 2008. "A bi-objective genetic algorithm approach to risk mitigation in project scheduling," International Journal of Production Economics, Elsevier, vol. 112(1), pages 202-216, March.
    11. Lee, Heejung & Suh, Hyo-Won, 2008. "Estimating the duration of stochastic workflow for product development process," International Journal of Production Economics, Elsevier, vol. 111(1), pages 105-117, January.
    12. Xiao, Jing & Wu, Zhou & Hong, Xi-Xi & Tang, Jian-Chao & Tang, Yong, 2016. "Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP," European Journal of Operational Research, Elsevier, vol. 251(1), pages 22-35.
    13. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    14. Vega-Velázquez, Miguel Ángel & García-Nájera, Abel & Cervantes, Humberto, 2018. "A survey on the Software Project Scheduling Problem," International Journal of Production Economics, Elsevier, vol. 202(C), pages 145-161.
    15. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    16. Goli, Alireza, 2024. "Efficient optimization of robust project scheduling for industry 4.0: A hybrid approach based on machine learning and meta-heuristic algorithms," International Journal of Production Economics, Elsevier, vol. 278(C).
    17. Tien-Fu Liang & Tien-Shou Huang & Ming-Feng Yang, 2012. "Application of fuzzy mathematical programming to imprecise project management decisions," Quality & Quantity: International Journal of Methodology, Springer, vol. 46(5), pages 1451-1470, August.
    18. Zigao Wu & Shaohua Yu & Tiancheng Li, 2019. "A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling," Mathematics, MDPI, vol. 7(6), pages 1-19, June.
    19. Janusz Kulejewski & Nabi Ibadov & Jerzy Rosłon & Jacek Zawistowski, 2021. "Cash Flow Optimization for Renewable Energy Construction Projects with a New Approach to Critical Chain Scheduling," Energies, MDPI, vol. 14(18), pages 1-15, September.
    20. Kemmoé Tchomté, Sylverin & Gourgand, Michel, 2009. "Particle swarm optimization: A study of particle displacement for solving continuous and combinatorial optimization problems," International Journal of Production Economics, Elsevier, vol. 121(1), pages 57-67, September.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2013:y:2013:i:1:n:451090. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.