Abstract
This paper first describes an efficient exact algorithm to solve Preemptive RCPSP and next discusses its extension to Non Preemptive RCPSP. In case of Preemptive RCPSP, we propose a very original and efficient branch and bound/price procedure based upon minimal interval order enumeration, which is implemented with the help of the generic SCIP software. We perform tests on the famous PSPLIB instances which provide very satisfactory results. To the best of our knowledge it is the first algorithm able to solve at optimality all the set of j30 instances of PSPLIB in a preemptive way. The two last sections are devoted to the description of some heuristics, which also involve the interval order framework and the basic antichain linear program and which aim at handling larger scale RCPSP preemptive instances, and to a discussion of the way our algorithm may be extended to Non Preemptive RCPSP.
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
Kolisch, R., Padman, R.: Deterministic project scheduling. Omega 48, 249–272 (1999)
Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models and methods. EJOR 112, 3–41 (1999)
Herroelen, W.: Project scheduling–theory and practice. Prod. Oper. Manage. 14(4), 413–432 (2006)
Liu, S.S., Wang, C.J.: RCPSP profit max with cash flow. Aut. Const. 17, 966–74 (2008)
Baptiste, P., Lepape, C.L.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5(1/2), 119–139 (2000)
Brucker, P., Knust, S.: A linear programming and constraint propagation-based lower bound for the RCPSP. EJOR 127(2), 355–362 (2000)
Hartmann, S., Briskorn, D.: A survey of variants of RCPSP. EJOR 207, 1–14 (2010)
Orji, M.J., Wei, S.: Project scheduling under resource constraints: a recent survey. Int. J. Eng. Res. Technol. (IJERT) 2(2), 102–127 (2013)
Herroelen, W., Leus, R.: Project scheduling under uncertainty: survey and research potentials. EJOR 165(2), 289–306 (2005)
Demeulemeester, E., Herroelen, W.: An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. EJOR 90, 334–348 (1996)
Verma, S.: Exact methods for the preemptive resource-constrained project scheduling problem, research and publication. Indian Institute of Management, Ahmedabad, India, 8 March 2006.
Nadjafi, B.A., Shadrokh, S.: The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties. J. Ind. Eng. 1, 35–39 (2008)
Ballestin, F., Valls, V., Quintanilla, S.: Preemption in resource-constrained project scheduling. EJOR 189, 1136–1152 (2008)
Vanhoucke, M., Debels, D.: Impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects. Comput. Indust. Eng. 54, 140–154J (2008)
Vanhoucke, M.: A genetic algorithm for the net present value maximization for resource constrained projects. In: Cotta, C., Cowling, P. (eds.) Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, vol. 5482, pp. 13–24. Springer, Berlin, Heidelberg (2009)
Peteghem, V.V., Vanhoucke, M.: A genetic algorithm for the pre-emptive and non pre-emptive muti-mode resource constraint project scheduling problem. EJOR 201(2), 409–418 (2010)
Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: Exact algorithm for RCPSP based on a new mathematical formulation. Manage. Sci. 44, 714–729 (1998)
Carlier, J., Neron, E.: On linear lower bounds for the resource constrained project scheduling problem. EJOR 149(2), 314–324 (2003)
Damay, A., Quilliot, A., Sanlaville, E.: Linear programming based algorithms for preemptive and non preemptive RCPSP. EJOR 182(3), 1012–1022 (2007)
Roberts, F.S.: Discrete Maths Models. Prentice Hall, Englewood Cliffs (1976)
Quilliot, A., Toussaint, H.: Flow polyedra and RCPSP. RAIRO-RO 46(4), 379–409 (2012)
Schutt, A., Feydy, T., Stuckey, P.J.: Explaining Time-Table-Edge-Finding propagation for the cumulative resource constraint. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, pp. 234–250. Springer, Berlin (2013)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
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
Moukrim, A., Quilliot, A., Toussaint, H. (2015). Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs. In: Fidanova, S. (eds) Recent Advances in Computational Optimization. Studies in Computational Intelligence, vol 580. Springer, Cham. https://doi.org/10.1007/978-3-319-12631-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-12631-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12630-2
Online ISBN: 978-3-319-12631-9
eBook Packages: EngineeringEngineering (R0)