IDEAS home Printed from https://ideas.repec.org/a/wly/jnddns/v2016y2016i1n1514959.html

A Cost Optimization Model for Multiresource Leveling Problem without Project Duration Constraint

Author

Listed:
  • Qingyou Yan
  • Qian Zhang
  • Xin Zou

Abstract

The study of traditional resource leveling problem aims at minimizing the resource usage fluctuations and obtaining sustainable resource supplement, which is accomplished by adjusting noncritical activities within their start and finish time. However, there exist limitations in terms of the traditional resource leveling problem based on the fixed project duration. This paper assumes that the duration can be changed in a certain range and then analyzes the relationship between the scarce resource usage fluctuations and project cost. This paper proposes an optimization model for the multiresource leveling problem. We take into consideration five kinds of cost: the extra hire cost when the resource demand is greater than the resource available amount, the idle cost of resource when the resource available amount is greater than the resource demand, the indirect cost related to the duration, the liquidated damages when the project duration is extended, and the incentive fee when the project duration is reduced. The optimal objective of this model is to minimize the sum of the aforementioned five kinds of cost. Finally, a case study is examined to highlight the characteristic of the proposed model at the end of this paper.

Suggested Citation

  • Qingyou Yan & Qian Zhang & Xin Zou, 2016. "A Cost Optimization Model for Multiresource Leveling Problem without Project Duration Constraint," Discrete Dynamics in Nature and Society, John Wiley & Sons, vol. 2016(1).
    • Handle: RePEc:wly:jnddns:v:2016:y:2016:i:1:n:1514959
    DOI: 10.1155/2016/1514959
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2016/1514959
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/1514959?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. A Drexl & A Kimms, 2001. "Optimization guided lower and upper bounds for the resource investment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(3), pages 340-351, March.
    2. Bandelloni, M. & Tucci, M. & Rinaldi, R., 1994. "Optimal resource leveling using non-serial dyanamic programming," European Journal of Operational Research, Elsevier, vol. 78(2), pages 162-177, October.
    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. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    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. Qingyou Yan & Qian Zhang & Xin Zou, 2016. "A Cost Optimization Model for Multiresource Leveling Problem without Project Duration Constraint," Discrete Dynamics in Nature and Society, Hindawi, vol. 2016, pages 1-8, July.
    4. 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).
    5. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    6. Zhu, Xia & Ruiz, Rubén & Li, Shiyu & Li, Xiaoping, 2017. "An effective heuristic for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 257(3), pages 746-762.
    7. Hongbo Li & Linwen Zheng & Hanyu Zhu, 2023. "Resource leveling in projects with flexible structures," Annals of Operations Research, Springer, vol. 321(1), pages 311-342, February.
    8. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.
    9. Marta Gomes & Luís Cavique & Isabel Themido, 2006. "The crew timetabling problem: An extension of the crew scheduling problem," Annals of Operations Research, Springer, vol. 144(1), pages 111-132, April.
    10. Moehring, Rolf & Uetz, Marc & Stork, Frederik & Schulz, Andreas S., 2002. "Solving Project Scheduling Problems by Minimum Cut," Working papers 4231-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    11. Shadrokh, Shahram & Kianfar, Fereydoon, 2007. "A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty," European Journal of Operational Research, Elsevier, vol. 181(1), pages 86-101, August.
    12. Patrick Gerhards, 2020. "The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 901-933, December.
    13. Briskorn, Dirk & Davari, Morteza & Matuschke, Jannik, 2021. "Single-machine scheduling with an external resource," European Journal of Operational Research, Elsevier, vol. 293(2), pages 457-468.
    14. Rodrigues, Sávio B. & Yamashita, Denise S., 2010. "An exact algorithm for minimizing resource availability costs in project scheduling," European Journal of Operational Research, Elsevier, vol. 206(3), pages 562-568, November.
    15. Coughlan, Eamonn T. & Lübbecke, Marco E. & Schulz, Jens, 2015. "A branch-price-and-cut algorithm for multi-mode resource leveling," European Journal of Operational Research, Elsevier, vol. 245(1), pages 70-80.
    16. Inma C Conde & Luis Antonio Palma Martos & María del Rocío Martínez Torres & Francisco Luis Cumbrera Hernández, 2025. "Artificial Neural Network Approach with Multi-Back Propagation and Training–Testing to Solve the Resource Levelling Problem in PERT-CPM," SN Operations Research Forum, Springer, vol. 6(3), pages 1-20, September.
    17. Neumann, K. & Zimmermann, J., 1999. "Resource levelling for projects with schedule-dependent time windows," European Journal of Operational Research, Elsevier, vol. 117(3), pages 591-605, September.
    18. André Schnabel & Carolin Kellenbrink & Stefan Helber, 2018. "Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints," Business Research, Springer;German Academic Association for Business Research, vol. 11(2), pages 329-356, September.
    19. Karen Puttkammer & Rainer Kleber & Tobias Schulz & Karl Inderfurth, 2011. "Simultane Maschinenbelegungs- und Personaleinsatzplanung in KMUs anhand eines Fallbeispiels aus der Druckereibranche," FEMM Working Papers 110010, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    20. Nicholas G. Hall & Marc E. Posner, 2026. "Resource leveling with subcontracting: algorithms and complexity," Journal of Scheduling, Springer, vol. 29(1), pages 39-50, February.

    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:jnddns:v:2016:y:2016:i:1:n:1514959. 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/3059 .

    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.