IDEAS home Printed from https://ideas.repec.org/a/vrs/otamic/v9y2017i1p1627-1637n10.html
   My bibliography  Save this article

An integration of spreadsheet and project management software for cost optimal time scheduling in construction

Author

Listed:
  • Valenko Tadej
  • Klanšek Uroš

    (University of Maribor, Faculty of Civil Engineering, Transportation Engineering and Architecture, Smetanova ulica 17, 2000 Maribor, Slovenia)

Abstract

Successful performance and completion of construction projects highly depend on an adequate time scheduling of the project activities. On implementation of time scheduling, the execution modes of activities are most often required to be set in a manner that enables in achieving the minimum total project cost. This paper presents an approach to cost optimal time scheduling, which integrates a spreadsheet application and data transfer to project management software (PMS). At this point, the optimization problem of project time scheduling is modelled employing Microsoft Excel and solved to optimality using Solver while organization of data is dealt by macros. Thereupon, Microsoft Project software is utilized for further managing and presentation of optimized time scheduling solution. In this way, the data flow between programs is automated and possibilities of error occurrence during scheduling process are reduced to a minimum. Moreover, integration of spreadsheet and PMS for cost optimal time scheduling in construction is performed within well-known program environment that increases the possibilities of its wider use in practice. An application example is shown in this paper to demonstrate the advantages of proposed approach.

Suggested Citation

  • Valenko Tadej & Klanšek Uroš, 2017. "An integration of spreadsheet and project management software for cost optimal time scheduling in construction," Organization, Technology and Management in Construction, Sciendo, vol. 9(1), pages 1627-1637, December.
    • Handle: RePEc:vrs:otamic:v:9:y:2017:i:1:p:1627-1637:n:10
    DOI: 10.1515/otmcj-2016-0028
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/otmcj-2016-0028
    Download Restriction: no
    File URL: https://libkey.io/10.1515/otmcj-2016-0028?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. HazIr, Öncü & Erel, Erdal & Günalay, Yavuz, 2011. "Robust optimization models for the discrete time/cost trade-off problem," International Journal of Production Economics, Elsevier, vol. 130(1), pages 87-95, March.
    2. HazIr, Öncü & Haouari, Mohamed & Erel, Erdal, 2010. "Robust scheduling and robustness measures for the discrete time/cost trade-off problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 633-643, December.
    3. 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.
    4. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, 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. Zsolt T. Kosztyán & István Szalkai, 2020. "Multimode resource-constrained project scheduling in flexible projects," Journal of Global Optimization, Springer, vol. 76(1), pages 211-241, January.
    2. 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.
    3. Ö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.
    4. 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).
    5. 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.
    6. Said, Samer S. & Haouari, Mohamed, 2015. "A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 628-636.
    7. Junguang Zhang & Dan Wan, 2021. "Determination of early warning time window for bottleneck resource buffer," Annals of Operations Research, Springer, vol. 300(1), pages 289-305, May.
    8. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
    9. Can Akkan & Ayla Gülcü & Zeki Kuş, 2022. "Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation," Journal of Scheduling, Springer, vol. 25(4), pages 477-501, August.
    10. Zhang, Jingwen & Elmaghraby, Salah E., 2014. "The relevance of the “alphorn of uncertainty” to the financial management of projects under uncertainty," European Journal of Operational Research, Elsevier, vol. 238(1), pages 65-76.
    11. Shichang Xiao & Shudong Sun & Jionghua (Judy) Jin, 2017. "Surrogate Measures for the Robust Scheduling of Stochastic Job Shop Scheduling Problems," Energies, MDPI, vol. 10(4), pages 1-26, April.
    12. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    13. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    14. Zhengwen He & Nengmin Wang & Pengxiang Li, 2014. "Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective," Annals of Operations Research, Springer, vol. 213(1), pages 203-220, February.
    15. Balouka, Noemie & Cohen, Izack, 2021. "A robust optimization approach for the multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 291(2), pages 457-470.
    16. Xue Li & Zhengwen He & Nengmin Wang & Mario Vanhoucke, 2022. "Multimode time-cost-robustness trade-off project scheduling problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1173-1202, July.
    17. Jonas Ingels & Broos Maenhout, 2017. "Employee substitutability as a tool to improve the robustness in personnel scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 623-658, July.
    18. 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.
    19. Xiong, Jian & Xing, Li-ning & Chen, Ying-wu, 2013. "Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns," International Journal of Production Economics, Elsevier, vol. 141(1), pages 112-126.
    20. Ingels, Jonas & Maenhout, Broos, 2019. "Optimised buffer allocation to construct stable personnel shift rosters," Omega, Elsevier, vol. 82(C), pages 102-117.

    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:otamic:v:9:y:2017:i:1:p:1627-1637:n:10. 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.