IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i14p2234-d1698367.html
   My bibliography  Save this article

Simple k -Crashing Plan with a Good Approximation Ratio

Author

Listed:
  • Ruixi Luo

    (School of Intelligent Systems Engineering, Shenzhen Campus of Sun Yat-sen University, No. 66, Gongchang Road, Guangming District, Shenzhen 518107, China)

  • Kai Jin

    (School of Intelligent Systems Engineering, Shenzhen Campus of Sun Yat-sen University, No. 66, Gongchang Road, Guangming District, Shenzhen 518107, China)

  • Zelin Ye

    (School of Intelligent Systems Engineering, Shenzhen Campus of Sun Yat-sen University, No. 66, Gongchang Road, Guangming District, Shenzhen 518107, China)

Abstract

In project management, a project is typically described as an activity-on-edge network, where each activity/job is represented as an edge of some network N (which is a directed acyclic graph). To speed up the project (i.e., reduce the duration), the manager can crash a few jobs (namely, reduce the length of the corresponding edges) by investing extra resources into those jobs. Greedily and repeatedly choosing the cheapest solution to crash the project by one unit is the simplest way to achieve the crashing goal and has been implemented countless times throughout the history. However, the algorithm does not guarantee an optimum solution and analysis of it is limited. Through theoretical analysis, we prove that the above algorithm has an approximation ratio upper bound of 1 1 + … + 1 k for this k -crashing problem.

Suggested Citation

  • Ruixi Luo & Kai Jin & Zelin Ye, 2025. "Simple k -Crashing Plan with a Good Approximation Ratio," Mathematics, MDPI, vol. 13(14), pages 1-20, July.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:14:p:2234-:d:1698367
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/14/2234/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/14/2234/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nicolai Siemens, 1971. "A Simple CPM Time-Cost Tradeoff Algorithm," Management Science, INFORMS, vol. 17(6), pages 354-363, February.
    2. Marcin Anholcer & Helena Gaspars-Wieloch, 2011. "Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 5-18.
    3. Steve Phillips, Jr. & Mohamed I. Dessouky, 1977. "Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept," Management Science, INFORMS, vol. 24(4), pages 393-400, December.
    4. Wu, Y & Li, C, 1994. "Minimal cost project networks: The cut set parallel difference method," Omega, Elsevier, vol. 22(4), pages 401-407, July.
    5. Kamburowski, J., 1995. "On the minimum cost project schedule," Omega, Elsevier, vol. 23(4), pages 463-465, August.
    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. Chen, Shih-Pin & Tsai, Ming-Jiun, 2011. "Time-cost trade-off analysis of project networks in fuzzy environments," European Journal of Operational Research, Elsevier, vol. 212(2), pages 386-397, July.
    2. Mitchell, George, 1995. "On the minimum cost project schedule--Note by the editor," Omega, Elsevier, vol. 23(4), pages 468-468, August.
    3. Chapman, C. B., 1995. "On the minimum cost project schedule--Some comments," Omega, Elsevier, vol. 23(4), pages 467-468, August.
    4. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    5. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    6. A B Hafızoğlu & M Azizoğlu, 2010. "Linear programming based approaches for the discrete time/cost trade-off problem in project networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 676-685, April.
    7. Williams, Terry, 1999. "Towards realism in network simulation," Omega, Elsevier, vol. 27(3), pages 305-314, June.
    8. Osama Mohamed ElSahly & Salma Ahmed & Akmal Abdelfatah, 2023. "Systematic Review of the Time-Cost Optimization Models in Construction Management," Sustainability, MDPI, vol. 15(6), pages 1-20, March.
    9. Marcin Anholcer & Helena Gaspars-Wieloch, 2011. "Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 5-18.
    10. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
    11. Helena Gaspars, 2006. "A conception of a new algorithm for the project time-cost analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 16(3-4), pages 5-27.
    12. Kamburowski, J., 1995. "On the minimum cost project schedule," Omega, Elsevier, vol. 23(4), pages 463-465, August.
    13. Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha, 2017. "Finding an optimal Nash equilibrium to the multi-agent project scheduling problem," Journal of Scheduling, Springer, vol. 20(5), pages 475-491, October.
    14. Laslo, Zohar & Keren, Baruch & Ilani, Hagai, 2008. "Minimizing task completion time with the execution set method," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1513-1519, June.
    15. Šůcha, Přemysl & Agnetis, Alessandro & Šidlovský, Marko & Briand, Cyril, 2021. "Nash equilibrium solutions in multi-agent project scheduling with milestones," European Journal of Operational Research, Elsevier, vol. 294(1), pages 29-41.
    16. Alessandro Agnetis & Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha, 2020. "Price of anarchy and price of stability in multi-agent project scheduling," Annals of Operations Research, Springer, vol. 285(1), pages 97-119, February.
    17. Choi, Yunsik & Delise, Lisa A. & Lee, Brandon W. & Neely, Jerry, 2021. "Effective staffing of projects for reconciling conflict between cost efficiency and quality," International Journal of Production Economics, Elsevier, vol. 234(C).
    18. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    19. Janiak, Adam, 1998. "Minimization of the makespan in a two-machine problem under given resource constraints," European Journal of Operational Research, Elsevier, vol. 107(2), pages 325-337, June.
    20. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:gam:jmathe:v:13:y:2025:i:14:p:2234-:d:1698367. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.