Skip to main content
SpringerLink
Log in

Resource-constrained project scheduling with concave processing rate functions

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

In this paper, we address a resource-constrained project scheduling problem involving a single resource. The resource can be applied at varying consumption rates to the activities of the project. The duration of each activity is defined by a convex, non-increasing time-resource trade-off function. In addition, activities are not preemptable (ie, the resource consumption rate of an activity cannot be altered while the activity is being processed). We explicitly consider variation of the rate at which an activity is performed with variation in resource consumption rate. We designate the number of units (amount of an activity) performed per unit time with variation in resource consumption rate as the processing rate function, and assume this function to be concave. We present a tree-search-based method in concert with the solution of a nonlinear program and the use of dominance properties to determine: (i) the sequence in which to perform the activities of the project, and (ii) the resource consumption rate to allocate to each activity so as to minimize the project duration (makespan). We also present results of an experimental investigation that reveal the efficacy of the proposed methodology. Finally, we present an application of this methodology to a practical setting.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17

Similar content being viewed by others

References

  • Alcaraz J, Maroto C and Ruiz R (2003). Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society 54 (6): 614–626.

    Article  Google Scholar 

  • Balas E (1968). Project Scheduling with Resource Constraints. Fort Belvoir, VA: Carnegie-Mellon University Management Sciences Research Group.

    Google Scholar 

  • Bell CE and Park K (1990). Solving resource-constrained project scheduling problems by A* search. Naval Research Logistics (NRL) 37 (1): 61–84.

    Article  Google Scholar 

  • Berman E (1964). Resource allocation in a PERT network under continuous activity time-cost functions. Management Science 10 (4): 734–745.

    Article  Google Scholar 

  • Bowman E (1959). The schedule-sequencing problem. Operations Research 7 (5): 621–624.

    Article  Google Scholar 

  • Carruthers J and Battersby A (1966). Advances in critical path methods. Journal of the Operational Research Society 17 (4): 359–380.

    Article  Google Scholar 

  • Christofides N, Alvarez-Valdes R and Tamarit J (1987). Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research 29 (3): 262–273.

    Article  Google Scholar 

  • Davis E and Heidorn G (1971). An algorithm for optimal project scheduling under multiple resource constraints. Management Science 17 (12): 803–816.

    Article  Google Scholar 

  • De P, Dunne E, Ghosh J and Wells C (1997). Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45 (2): 302–306.

    Article  Google Scholar 

  • De Reyck B, Demeulemeester E and Herroelen W (1998). Local search methods for the discrete time/resource trade-off problem in project networks. Naval Research Logistics 45 (6): 553–578.

    Article  Google Scholar 

  • Decrko R and Hebert J (1989). Resource constrained project crashing. Omega International Journal of Management Science 17 (1): 69–79.

    Article  Google Scholar 

  • Deckro RF and Hebert JE (2003). Modeling diminishing returns in project resource planning. Computers and Industrial Engineering 44 (1): 19–33.

    Article  Google Scholar 

  • Demeulemeester E, Dodin B and Herroelen W (1993). A random activity network generator. Operations Research 41 (5): 972–980.

    Article  Google Scholar 

  • Demeulemeester E, De Reyck B and Herroelen W (2000). The discrete time/resource trade-off problem in project networks: A branch-and-bound approach. IIE Transactions 32 (11): 1059–1069.

    Google Scholar 

  • Demeulemeester E and Herroelen W (1992). A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38 (12): 1803–1818.

    Article  Google Scholar 

  • Elloumi S and Fortemps P (2010). A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem. European Journal of Operational Research 205 (1): 31–41.

    Article  Google Scholar 

  • Elmaghraby S (1977). Activity Networks. New York: Wiley.

    Google Scholar 

  • Elmaghraby S (1993). Resource allocation via dynamic programming in activity networks. European Journal of Operational Research 64 (2): 199–215.

    Article  Google Scholar 

  • Garey MR, Graham RL, Johnson DS and Yao ACC (1976). Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory, Series A 21 (3): 257–298.

    Article  Google Scholar 

  • Harvey R and Patterson J (1979). An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis. Foundations of Control Engineering 4 (2): 107–117.

    Google Scholar 

  • Hastings N (1972). On resource allocation in project networks. Operational Research Quarterly 23 (2): 217–221.

    Article  Google Scholar 

  • Józefowska J, Mika M, Różycki R, Waligóra G and Węglarz J (2001). Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research 102 (1): 137–155.

    Article  Google Scholar 

  • Kelley J and Walker M (1959). Critical path planning and scheduling. In: 1959 Proceeding of the Eastern Joint Computing Conference 16, ACM, NewYork, pp.160–172.

  • Lova A, Tormos P, Cervantes M and Barber F (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics 117 (2): 302–316.

    Article  Google Scholar 

  • Mingozzi A, Maniezzo V, Ricciardelli S and Bianco L (1998). An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Science 44 (5): 714–729.

    Article  Google Scholar 

  • Nudtasomboom N and Randhawa S (1996). Resource-constrained project scheduling with renewable and non-renewable resources and time-resource tradeoffs. Computers and Industrial Engineering 32 (1): 227–242.

    Article  Google Scholar 

  • Panagiotakopoulos D (1977). A CPM time-cost computational algorithm for arbitrary activity cost functions. INFOR 15 (2): 183–195.

    Google Scholar 

  • Patterson J and Huber W (1974). A horizon-varying, zero-one approach to project scheduling. Management Science 20 (6): 990.

    Article  Google Scholar 

  • Pritsker A, Watters L and Wolfe P (1969). Multiproject scheduling with limited resources: A zero-one programming approach. Management Science 16 (1): 93.

    Article  Google Scholar 

  • Radermacher F (1985). Scheduling of project networks. Annals of Operations Research 4 (1): 227–252.

    Article  Google Scholar 

  • Ranjbar M, De Reyck B and Kianfar F (2007). A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. European Journal of Operational Research 193 (1): 35–48.

    Article  Google Scholar 

  • Ranjbar M and Kianfar F (2007). Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms. Applied Mathematics and Computation 191 (2): 451–456.

    Article  Google Scholar 

  • Seyed-Hosseini S and Sabzehparvar M (2008). A mathematical model for the continuous time/resource trade-off problem. Kuwait Journal of Science and Engineering 35 (1): 197–215.

    Google Scholar 

  • Stinson J, Davis E and Khumawala B (1978). Multiple resource-constrained scheduling using branch and bound. IIE Transactions 10 (3): 252–259.

    Google Scholar 

  • Talbot FB (1982). Resource-constrained project scheduling with time-resource tradeoffs: The non-preemptive case. Management Science 28 (10): 1197–1210.

    Article  Google Scholar 

  • Talbot FB and Patterson JH (1978). An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Management Science 24 (11): 1163–1174.

    Article  Google Scholar 

  • Tseng LY and Chen SC (2009). Two-phase genetic local search algorithm for the multimode resource-constrained project scheduling problem. Evolutionary Computation, IEEE Transactions on 13 (4): 848–857.

    Article  Google Scholar 

  • Van Peteghem V and Vanhoucke M (2009). An artificial immune system for the multi-mode resource-constrained project scheduling problem. In: Cotta C and Cowling P (eds.) Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization. Springer-Verlag, Berlin, Heidelberg, pp 85–96.

    Chapter  Google Scholar 

  • Van Peteghem V and Vanhoucke M (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research 201 (2): 409–418.

    Article  Google Scholar 

  • Węglarz J (1981). Project scheduling with continuously divisible, doubly constrained resources. Management Science 27 (9): 1040–1053.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Virginia Tech, Blacksburg, VA, USA

    Daniel W Steeneck & Subhash C Sarin

Authors
  1. Daniel W Steeneck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subhash C Sarin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniel W Steeneck.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Steeneck, D., Sarin, S. Resource-constrained project scheduling with concave processing rate functions. J Oper Res Soc 66, 794–806 (2015). https://doi.org/10.1057/jors.2014.44

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2014.44

Keywords

Search

Navigation