Abstract
A novel resource-leveling algorithm is presented based on entropy concepts, restating the resource-leveling heuristic known as the “Minimum Moment Method”, as an “Entropy Maximization Method” and improving on its efficiency. The proposed resource-leveling algorithm makes use of the general theory of entropy and two of its principal properties (subadditivity and maximality) to restate resource leveling as a process of maximizing the entropy found in a project’s resource histogram. Entropy in this resource-centric problem domain is defined as the ratio of allocated daily resource units over the total number of resource units to complete the project. Entropy’s subadditivity and maximality properties state that if a system consists of two subdomains having n and m components respectively, then the total system entropy is less than or equal to the sum of the subdomains’ entropy, and that the entropy is maximum when all admissible outcomes have equal probabilities of occurrence (maximal uncertainty is reached for the equiprobability distribution of possible outcomes).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adeli H, Park HS (1995) Optimization of space structures by neural dynamics. Neural Netw 8(5):769–781
Ballestín F, Schwindt C, Zimmermann J (2007) Resource leveling in make-to-order production: modeling and heuristic solution method. Int J Oper Res 4(1):50–62
Brinkmann K, Neumann K (1996) Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: the resource-levelling and minimum project-duration problems. J Decis Syst 5:129–156
Brucker P, Knust S, Schoo A, Thiel O (1998) A branch and bound algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 107(2):272–288
Burgess AR, Killebrew JB (1962) Variation in activity level on a cyclic arrow diagram. J Ind Eng 13:76–83
Christodoulou SE, Ellinas G (2010) Scheduling resource-constrained projects with ant colony optimization artificial agents. J Comput Civil Eng 24(1):45–55
Christodoulou SE, Ellinas G, Aslani P (2009a) Disorder considerations in resource-constrained scheduling. Constr Manag Econ 27(3):229–240
Christodoulou SE, Ellinas G, Aslani P (2009b) Entropy-based scheduling of resource-constrained construction projects. Automat Constr 18(7):919–928
Christodoulou SE, Ellinas G, Michaelidou-Kamenou A (2010) Minimum moment method for resource leveling using entropy maximization. J Constr Eng M ASCE 136(5):518–527
Garmsiri M, Abassi MR (2012) Resource leveling scheduling by an ant colony-based model. J Ind Eng Int 8(7)
Harris RB (1978) Precedence and arrow networking techniques for construction. Wiley, New York
Harris RB (1990) Packing method for resource leveling (Pack). J Constr Eng M ASCE 116(2):331–350
Hegazy T (1999) Optimization of resource allocation and leveling using genetic algorithms. J Constr Eng M ASCE 125(3):167–175
Hegazy T, Shabeeb AK, Elbeltagi E, Cheema T (2000) Algorithm for scheduling with multiskilled constrained resources. J Constr Eng M ASCE 126(6):414–421
Hiyassat MAS (2000) Modification of minimum moment approach in resource leveling. J Constr Eng M ASCE 126(4):278–284
Hiyassat MAS (2001) Applying modified minimum moment method to multiple resource leveling. J Constr Eng M ASCE 127(3):192–198
Martinez J, Ioannou P (1993) Resource leveling based on the modified moment heuristic. In: Proceedings of 5th international conference on civil and building engineering, Anaheim, pp 287–294
Neumann K, Zimmermann J (1999) Resource leveling for projects with schedule-dependent time windows. Eur J Oper Res 117(3):714–729
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
Ranjbar M (2013) A path-relinking metaheuristic for the resource levelling problem. J Oper Res Soc 64:1071–1078
Rubinstein RY, Kroese DP (2004) The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning. Springer, New York
Seibert JE, Evans GW (1991) Time-constrained resource leveling. J Constr Eng M ASCE 117(3):503–520
Senouci AB, Adeli H (2001) Resource scheduling using neural dynamics model of Adeli and Park. J Constr Eng M ASCE 127(1):28–34
Takamoto M, Yamada N, Kobayashi Y, Nonaka H (1995) Zero-one quadratic programming algorithm for resource leveling of manufacturing process schedules. Syst Comput Jpn 26(10):68–76
Zhang H, Li X, Li H, Huang F (2005) Particle swarm optimization-based schemes for resource-constrained project scheduling. Automat Constr 14(3):393–404
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Christodoulou, S.E., Michaelidou-Kamenou, A., Ellinas, G. (2015). Heuristic Methods for Resource Leveling Problems. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol.1. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05443-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-05443-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05442-1
Online ISBN: 978-3-319-05443-8
eBook Packages: Business and EconomicsBusiness and Management (R0)