Abstract
In the work a resource-constrained project scheduling problem (RCPSP) is considered. This classical NP-hard problem evokes interest from both theoretical and applied points of view. Thus we can divide effective (i.e. polynomial) approximation algorithms in two groups: fast heuristic algorithms for the whole problem and generalizations and algorithms with performance guarantee for particular cases. In first section we consider the statement of the problem and some generalizations. Along with renewable resources we consider consumable resources which can be stored to be used at any moment after the moment of allocation. A polynomial optimal algorithm for solving the problem with consumable resources only was suggested by Gimadi, Sevastianov and Zalyubovsky [2]. So we can consider polynomially solved relaxation of RCPSP. In this relaxation instead of each renewable resource we have consumable resource which is allocated at each moment of time in one and the same amount. Then we can use information about the solution of this relaxation for approximate solving the original problem in polynomial time (for example, the order of starting times can be used as a heuristic for serial scheduling scheme). Furthermore, the optimal value of relaxation gives the lower bound for the optimal value of the original 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.
References
Gimadi E, Sevastianov S, Zalyubovsky S (2000) Polynomial solvability of project scheduling problems with storable resources and due dates. Discrete analysis and operations research, 7,2: 9–34
Gimadi E, Sevastianov S, Zalyubovsky V (2001) On the Project Scheduling Problem under Stored Resource Constraints. Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation. Antibes-Juan les Pins, France: 703–706
Gimadi E, Zalyubovskii V, Sharygin P (1997) The problem of strip packing: an asymptotically exact approach. Russian Mathematics (Iz. VUZ), Allerton Press Inc., 41,12: 32–42.
Kolish R (1996) Serial and Parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90: 320–333
Coffman E, Garey M, Johnson D, Tarjan K (1980) Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9,4: 804–826
Baker B, Brown D, Kartseff H (1981) A 5/4 algorithm for two-dimensional packing. Journal of algorithms
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rykov, I.A. (2007). Approaches to Solving RCPSP Using Relaxed Problem with Consumable Resources. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_87
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)