Skip to main content

A Hybrid Metaheuristic for the Multi-mode Resource Investment Problem with Tardiness Penalty

  • Conference paper
  • First Online:
Operations Research Proceedings 2016

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

In this work we propose and analyze a hybrid approach for the multi-mode resource investment problem with tardiness penalty (MRIPT). The MRIPT is a project scheduling problem where, for a given deadline, the objective is to minimize the costs of resources allocated to the project as well as tardiness penalty costs for not respecting the given deadline. For each project activity multiple execution modes with differing resource requirements and durations are given. In particular, we propose a large neighborhood search where destroy operators are applied to a feasible solution to obtain subproblems. These subproblems are solved with MIP-based recreate operators to obtain an improved solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Demeulemeester, E.: Minimizing resource availability costs in time-limited project networks. Manag. Sci. 41(10), 1590–1598 (1995)

    Article  Google Scholar 

  2. Hsu, C.C., Kim, D.S.: A new heuristic for the multi-mode resource investment problem. J. Oper. Res. Soc. 56(4), 406–413 (2005)

    Article  Google Scholar 

  3. Kolisch, R., Sprecher, A.: PSPLIB—a project scheduling problem library. Eur. J. Oper. Res. 96(1), 205–216 (1997)

    Article  Google Scholar 

  4. Möhring, R.H.: Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper. Res. 32(1), 89–120 (1984)

    Article  Google Scholar 

  5. Ranjbar, M., Kianfar, F., Shadrokh, S.: Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl. Math. Comput. 196(2), 879–888 (2008)

    Google Scholar 

  6. Rodrigues, S.B., Yamashita, D.S.: An exact algorithm for minimizing resource availability costs in project scheduling. Eur. J. Oper. Res. 206(3), 562–568 (2010)

    Article  Google Scholar 

  7. Shadrokh, S., Kianfar, F.: A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. Eur. J. Oper. Res. 181(1), 86–101 (2007)

    Article  Google Scholar 

  8. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: International Conference on Principles and Practice of Constraint Programming, pp. 417–431. Springer (1998)

    Google Scholar 

  9. Van Peteghem, V., Vanhoucke, M.: An artificial immune system algorithm for the resource availability cost problem. Flex. Serv. Manuf. J. 25(1–2), 122–144 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Patrick Gerhards .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Gerhards, P., Stürck, C. (2018). A Hybrid Metaheuristic for the Multi-mode Resource Investment Problem with Tardiness Penalty . In: Fink, A., Fügenschuh, A., Geiger, M. (eds) Operations Research Proceedings 2016. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-55702-1_68

Download citation

Publish with us

Policies and ethics