Summary
Most work in project scheduling problems has been done with so-called regular objective functions, where a solution S never dominates another solution S’ if no activity is scheduled earlier in S than in S’. This has provided with techniques and metaheuristic frameworks to create heuristic algorithms for these kinds of problems, something which does not exist in the nonregular case. One of these problems is the Resource Renting Problem, which models the renting of resources. In this paper we compare the quality of three algorithms for this problem, one adapted from the regular case, another specially designed for the problem and a third that might be adapted for other problems. We will also show that two of these algorithms are capable of outperforming a branch-and-bound procedure that exists for the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ballestín, F. (2008). Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags. In: Cotta, C., van Hemert, J. (eds) Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70807-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-70807-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70806-3
Online ISBN: 978-3-540-70807-0
eBook Packages: EngineeringEngineering (R0)