IDEAS home Printed from https://ideas.repec.org/a/vrs/organi/v41y2008i4p153-158n4.html
   My bibliography  Save this article

Cost Optimal Project Scheduling

Author

Listed:
  • Klanšek Uroš

    (Faculty of Civil Engineering, University of Maribor, Smetanova 17, 2000 Maribor)

  • Pšunder Mirko

    (Faculty of Civil Engineering, University of Maribor, Smetanova 17, 2000 Maribor)

Abstract

This paper presents the cost optimal project scheduling. The optimization was performed by the nonlinear programming approach, NLP. The nonlinear total project cost objective function is subjected to the rigorous system of the activity precedence relationship constraints, the activity duration constraints and the project duration constraints. The set of activity precedence relationship constraints was defined to comprise Finish-to-Start, Start-to-Start, Start-to-Finish and Finish-to-Finish precedence relationships between activities. The activity duration constraints determine relationships between minimum, maximum and possible duration of the project activities. The project duration constraints define the maximum feasible project duration. A numerical example is presented at the end of the paper in order to present the applicability of the proposed approach.

Suggested Citation

  • Klanšek Uroš & Pšunder Mirko, 2008. "Cost Optimal Project Scheduling," Organizacija, Sciendo, vol. 41(4), pages 153-158, July.
  • Handle: RePEc:vrs:organi:v:41:y:2008:i:4:p:153-158:n:4
    DOI: 10.2478/v10051-008-0017-3
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/v10051-008-0017-3
    Download Restriction: no

    File URL: https://libkey.io/10.2478/v10051-008-0017-3?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. N.R. Achuthan & A. Hardjawidjaja, 2001. "Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm," Annals of Operations Research, Springer, vol. 108(1), pages 55-74, November.
    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. Klaus Mittenzwei & Wolfgang Britz, 2018. "Analysing Farm‐specific Payments for Norway using the Agrispace Model," Journal of Agricultural Economics, Wiley Blackwell, vol. 69(3), pages 777-793, September.
    2. Ni, Yuanming & Steinshamn, Stein I. & Kvamsdal, Sturla F., 2022. "Negative shocks in an age-structured bioeconomic model and how to deal with them," Economic Analysis and Policy, Elsevier, vol. 76(C), pages 15-30.
    3. 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.
    4. Huiyi Cao & Kamil A. Khan, 2023. "General convex relaxations of implicit functions and inverse functions," Journal of Global Optimization, Springer, vol. 86(3), pages 545-572, July.
    5. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    6. Artur M. Schweidtmann & Alexander Mitsos, 2019. "Deterministic Global Optimization with Artificial Neural Networks Embedded," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 925-948, March.
    7. Conrado Borraz-Sánchez & Russell Bent & Scott Backhaus & Hassan Hijazi & Pascal Van Hentenryck, 2016. "Convex Relaxations for Gas Expansion Planning," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 645-656, November.
    8. Andreas Lundell & Jan Kronqvist & Tapio Westerlund, 2022. "The supporting hyperplane optimization toolkit for convex MINLP," Journal of Global Optimization, Springer, vol. 84(1), pages 1-41, September.
    9. Tosoni, E. & Salo, A. & Govaerts, J. & Zio, E., 2019. "Comprehensiveness of scenarios in the safety assessment of nuclear waste repositories," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 561-573.
    10. Santos, Lucas F. & Costa, Caliane B.B. & Caballero, José A. & Ravagnani, Mauro A.S.S., 2022. "Framework for embedding black-box simulation into mathematical programming via kriging surrogate model applied to natural gas liquefaction process optimization," Applied Energy, Elsevier, vol. 310(C).
    11. Durand-Lasserve, Olivier & Almutairi, Hossa & Aljarboua, Abdullah & Pierru, Axel & Pradhan, Shreekar & Murphy, Frederic, 2023. "Hard-linking a top-down economic model with a bottom-up energy system for an oil-exporting country with price controls," Energy, Elsevier, vol. 266(C).
    12. Masaki Kimizuka & Sunyoung Kim & Makoto Yamashita, 2019. "Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods," Journal of Global Optimization, Springer, vol. 75(3), pages 631-654, November.
    13. Michael D. Teter & Johannes O. Royset & Alexandra M. Newman, 2019. "Modeling uncertainty of expert elicitation for use in risk-based optimization," Annals of Operations Research, Springer, vol. 280(1), pages 189-210, September.
    14. Rastinejad, Justin & Putnam, Sloane & Stuber, Matthew D., 2023. "Technoeconomic assessment of solar technologies for the hybridization of industrial process heat systems using deterministic global dynamic optimization," Renewable Energy, Elsevier, vol. 216(C).
    15. Emmanuel Ogbe & Xiang Li, 2019. "A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 75(3), pages 595-629, November.
    16. Leon Lasdon & Judith S. Liebman, 1998. "The Teachers' Forum: Teaching Nonlinear Programming Using Cooperative Active Learning," Interfaces, INFORMS, vol. 28(4), pages 119-132, August.
    17. Aidin Delgoshaei & Timon Rabczuk & Ahad Ali & Mohd Khairol Anuar Ariffin, 2017. "An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources," Annals of Operations Research, Springer, vol. 259(1), pages 85-117, December.
    18. Marian Leimbach & Anselm Schultes & Lavinia Baumstark & Anastasis Giannousakis & Gunnar Luderer, 2017. "Solution algorithms for regional interactions in large-scale integrated assessment models of climate change," Annals of Operations Research, Springer, vol. 255(1), pages 29-45, August.
    19. Ximing Cai & Daene C. McKinney & Leon S. Lasdon & David W. Watkins, 2001. "Solving Large Nonconvex Water Resources Management Models Using Generalized Benders Decomposition," Operations Research, INFORMS, vol. 49(2), pages 235-245, April.
    20. Watson, Harry A.J. & Vikse, Matias & Gundersen, Truls & Barton, Paul I., 2018. "Optimization of single mixed-refrigerant natural gas liquefaction processes described by nondifferentiable models," Energy, Elsevier, vol. 150(C), pages 860-876.

    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:vrs:organi:v:41:y:2008:i:4:p:153-158:n:4. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.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.