Skip to main content

Advertisement

Log in

Integration of resource investment problem with quantity discount problem in material ordering for minimizing resource costs of projects

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

Minimizing the costs in a project is highly tied with the way the required resources are provided. The resource investment problem deals with how to employ the renewable resources such that the related costs are minimized. Furthermore, the material ordering problem alludes to outlining a proper plan for supplying the nonrenewable resources (materials) to minimize the associated costs. The present paper studies the integration of the resource investment problem with the quantity discount problem in material ordering to thoroughly investigate the resource costs of projects in a single circumstance. The integrated model is presented and mathematically formulated. Three hybrid procedures are proposed for the model, each of which includes a genetic algorithm combined with a dynamic programming, a simulated annealing or a particle swarm optimization algorithm. The mathematical formulations of some small instances are solved to be the subject of an exact comparison with hybrid procedures. The proposed procedures are tested on a set of 810 benchmarks known in the literature. The computational experiments reported by algorithms validate the efficiency of the hybrid genetic algorithm and dynamic programming for the model more than other hybrid approaches.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Afshar-Nadjafi B, Arani M (2014) Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure. Adv Oper Res. doi:10.1155/2014/740670

    Google Scholar 

  • Akbalik A, Rapine C (2012) Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost. Oper Res Lett 40(5):390–397

    Article  Google Scholar 

  • Akbalik A, Rapine C (2013) The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases. Eur J Oper Res 229(2):353–363

    Article  Google Scholar 

  • Aquilano NJ, Smith DE (1980) A formal set of algorithms for project scheduling with critical path method material requirements planning. J Oper Manag 1(2):57–67

    Article  Google Scholar 

  • Arjmand M, Najafi AA (2015) Solving a multi-mode bi-objective resource investment problem using meta-heuristic algorithms. Adv Comput Tech Electromagn 1(2015):41–58. doi:10.5899/2015/acte-00195

    Article  Google Scholar 

  • Benton WC, Park S (1996) A classification of literature on determining the lot size under quantity discounts. Eur J Oper Res 92(2):219–238

    Article  Google Scholar 

  • Brahimi N, Dauzere-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. Eur J Oper Res 168(1):1–16

    Article  Google Scholar 

  • Callerman TE, Whybark DC (1977) Purchase quantity discounts in an MRP environment. Discussion paper, School of Business, Indiana

  • Chung C, Chiang DT, Lu C (1987) An optimal algorithm for the quantity discount problem. J Oper Manag 7(1–2):165–177

    Article  Google Scholar 

  • Colak E, Azizoglu M (2014) A resource investment problem with time/resource trade-offs. J Oper Res Soc 65(5):777–790

    Article  Google Scholar 

  • Demeulemeester EL (1995) Minimizing resource availability costs in time limited project networks. Manag Sci 41(10):1590–1598

    Article  Google Scholar 

  • Dodin B, Elimam AA (2001) Integrated project scheduling and material planning with variable activity duration and rewards. IIE Trans 33(11):1005–1018

    Article  Google Scholar 

  • Drexl A, Kimms A (2001) Optimization guided lower and upper bounds for the resource investment problem. J Oper Res Soc 52(3):340–351

    Article  Google Scholar 

  • Erabsi A, Sepil C (1999) A modified heuristic procedure for materials management in project networks. Int J Ind Eng Theory 6(2):132–140

    Google Scholar 

  • Federgruen A, Lee CY (1990) The dynamic lot size model with quantity discount. Nav Res Logist 37(5):707–713

    Article  Google Scholar 

  • Goossens D, Maas A, Spieksma F, Van De Klundert J (2007) Exact algorithms for a procurement problem with total quantity discounts. Eur J Oper Res 178(2):603–626

    Article  Google Scholar 

  • Hwanga HC, Heuvelb WVD, Wagelmansb APM (2013) The economic lot-sizing problem with lost sales and bounded inventory. IIE Trans 45(8):912–924

    Article  Google Scholar 

  • Karimi B, Ghomi SF, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31(5):365–378

    Article  Google Scholar 

  • Koulinas GK, Anagnostopoulos KP (2012) Construction resource allocation and leveling using a threshold accepting based hyper-heuristic algorithm. ASCE J Constr Eng Manag 138(7):854–863

    Article  Google Scholar 

  • Koulinas GK, Anagnostopoulos KP (2013) A new tabu search-based hyperheuristic algorithm for solving construction leveling problems with limited resource availabilities. Autom Constr 31:169–175

    Article  Google Scholar 

  • Lee AHI, Kang HY, Lai CM (2011) Solving lot-sizing problem with quantity discount and transportation cost. Int J Syst Sci 44(4):760–774. doi:10.1080/00207721.2011.618644

    Article  Google Scholar 

  • Lee AHI, Kang HY, Lai CM, Wan-Yu H (2013) An integrated model for lot sizing with supplier selection and quantity discounts. Appl Math Model 37(7):4733–4746

    Article  Google Scholar 

  • Lin YJ, Ho CH (2011) Integrated inventory model with quantity discount and price-sensitive demand. Top 19(1):177–188

    Article  Google Scholar 

  • Manerba D, Mansini R (2012) An exact algorithm for the capacitated total quantity discount problem. Eur J Oper Res 222(2):287–300

    Article  Google Scholar 

  • Manerba D, Mansini R (2014) An effective metaheuristic for the capacitated total quantity discount problem. Comput Oper Res 41:1–11

    Article  Google Scholar 

  • Manne AS (1958) Programming of economic lot sizes. Manag Sci 4(2):115–135

    Article  Google Scholar 

  • Mendoza A, Ventura JA (2008) Incorporating quantity discounts to the EOQ model with transportation costs. Int J Prod Econ 113(2):754–765

    Article  Google Scholar 

  • Mirmohammadi SH, Shadrokh S, Kianfar F (2009) An efficient optimal algorithm for the quantity discount problem in material requirement planning. Comput Oper Res 36(6):1780–1788

    Article  Google Scholar 

  • Möhring RH (1984) Minimizing costs of resource requirements in project networks subject to a fix completion time. Oper Res 32(1):89–120

    Article  Google Scholar 

  • Munson CL, Hu J (2010) Incorporating quantity discounts and their inventory impacts into the centralized purchasing decision. Eur J Oper Res 201(2):581–592

    Article  Google Scholar 

  • Munson CL, Jackson J (2015) Quantity discounts: an overview and practical guide for buyers and sellers. Found Trends Technol Inf Oper Manag 8(1–2):1–130

    Google Scholar 

  • Myers RH, Montgomery DC (1995) Response surface methodology: process and product optimization using designed experiments. Wiley, London

    Google Scholar 

  • Najafi AA, Niaki STA, Shahsavar M (2009) A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations. Comput Oper Res 36(11):2994–3001

    Article  Google Scholar 

  • Neumann K, Zimmermann J (2000) Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. Eur J Oper Res 127(2):425–443

    Article  Google Scholar 

  • Nübel H (1999) A branch and bound procedure for the resource investment problem subject to temporal constraints. Technical Report 574, University of Karlsruhe

  • Nübel H (2001) The resource renting problem subject to temporal constraints. OR Spektrum 23(3):574–586

    Article  Google Scholar 

  • Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, Berlin

    Google Scholar 

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

    Google Scholar 

  • Sabzehparvar M (2008) A mathematical model for the multi-mode resource investment problem. J Ind Eng Int 4(7):3

    Google Scholar 

  • Sajadieh MS, Shadrokh S, Hassanzadeh F (2009) Concurrent project scheduling and material planning: a genetic algorithm approach. Sci Iran 16(2):91–99

    Google Scholar 

  • Schmitt T, Faaland B (2004) Scheduling recurrent construction. Nav Res Log 51(8):1102–1128

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Shahsavar M, Najafi AA, Niaki STA (2010) An efficient genetic algorithm to maximize net present value of project payments under inflation and bonus–penalty policy in resource investment problem. Adv Eng Softw 41(7–8):1021–1030

    Google Scholar 

  • Shahsavar M, Najafi AA, Niaki STA (2015) Three self-adaptive multi-objective evolutionary algorithms for a triple-objective project scheduling problem. Comput Ind Eng 87:4–15

    Article  Google Scholar 

  • Smith-Daniels DE, Aquilano NJ (1984) Constrained resource project scheduling subject to material constraints. J Oper Manag 4(4):369–387

    Article  Google Scholar 

  • Smith-Daniels DE, Smith-Daniels VL (1987) Optimal project scheduling with materials ordering. IIE Trans 19(4):122–129

    Article  Google Scholar 

  • Tiwari RN, Dharmar S, Rao JR (1987) Fuzzy goal programming—an additive model. Fuzzy Set Syst 24(1):27–34

    Article  Google Scholar 

  • Wagner HM, Within TM (1958) Dynamic version of economic lot size model. Manag Sci 5(1):89–96

    Article  Google Scholar 

  • www.neos-server.org

  • Yamashita DS, Armentano VA, Laguna M (2006) Scatter search for project scheduling with resource availability cost. Eur J Oper Res 169(2):623–637

    Article  Google Scholar 

  • Zimmermann J, Engelhardt H (1998) Lower bounds and exact algorithms for resource leveling problems. Technical Report 517, University of Karlsruhe

  • Zoraghi N, Najafi AA, Niaki STA (2012) An integrated model of project scheduling and material ordering: a hybrid simulated annealing and genetic algorithm. J Optim Ind Eng 10:19–27

    Google Scholar 

  • Zoraghi N, Najafi AA, Niaki STA (2015) Resource constrained project scheduling with material ordering: two hybridized meta-heuristic approaches. IJE Trans C Asp 28(6):896–902

    Google Scholar 

  • Zoraghi N, Shahsavar A, Abbasi B, Van Peteghem V (2016) Multi-mode resource-constrained project scheduling problem with material ordering under bonus–penalty policies. TOP. doi:10.1007/s11750-016-0415-2

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aria Shahsavar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shahsavar, A., Zoraghi, N. & Abbasi, B. Integration of resource investment problem with quantity discount problem in material ordering for minimizing resource costs of projects. Oper Res Int J 18, 315–342 (2018). https://doi.org/10.1007/s12351-016-0266-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-016-0266-5

Keywords

Navigation