Abstract
This paper proposes an iterative improvement algorithm for solving instances of the Resource Constraint Project Scheduling Problem with Time-Windows (RCPSP/max). The algorithm is based on Iterative Flattening Search (ifs), an effective meta-heuristic strategy proposed over the past years for solving multi-capacity optimization scheduling problems. Given an initial solution, ifs iteratively applies two steps: (1) a subset of solving decisions are randomly retracted from a current solution (relaxation-step); (2) a new solution is incrementally recomputed (flattening-step). At the end, the best solution found is returned. To the best of our knowledge this is the first paper which proposes a version of ifs for solving RCPSP/max instances. The main contribution of this paper is threefold: (1) we succeed in improving 15 out of 90 solutions with respect to the officially published current best, thus demonstrating the general efficacy of ifs; (2) we highlight an intrisic limitation of the original ifs strategy in solving RCPSP/max, such that under certain circumstances the two-step improvement loop can get stuck in a status where no solving decision can be retracted; (3) we propose two different escaping strategies which extend the original ifs procedure. An experimental evaluation ends the paper, comparing the performances of the proposed escaping strategies against the original ifs procedure.
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
Preview
Unable to display preview. Download preview PDF.
References
Hoos, H.H., Stützle, T.: Stochastic Local Search. In: Foundations and Applications. Morgan Kaufmann, San Francisco (2005)
Cesta, A., Oddi, A., Smith, S.F.: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In: AAAI/IAAI. 17th National Conference on Artificial Intelligence, pp. 742–747 (2000)
Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling Project Networks with Resource Constraints and Time Windows. Annals of Operations Research 16, 201–240 (1988)
Michel, L., Van Hentenryck, P.: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling. In: ICAPS 2004. Proceedings of the 14th International Conference on Automated Planning & Scheduling, pp. 200–208 (2004)
Godard, D., Laborie, P., Nuitjen, W.: Randomized Large Neighborhood Search for Cumulative Scheduling. In: ICAPS 2005. Proceedings of the 15th International Conference on Automated Planning & Scheduling, pp. 81–89 (2005)
Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operational Research 112(1), 3–41 (1999)
Neumann, K., Schwindt, C.: Activity-on-Node Networks with Minimal and Maximal Time Lags and Their Application to Make-to-Order Production. Operation Research Spektrum 19, 205–217 (1997)
Schäffter, M.: Scheduling with respect to forbidden sets. Discrete Applied Mathematics 72, 141–154 (1997)
Kolisch, R., Schwindt, C., Sprecher, A.: Benchmark Instances for Project Scheduling Problems. In: Weglarz, J. (ed.) Handbook on Recent Advances in Project Scheduling. Kluwer, Dordrecht (1998)
Cesta, A., Oddi, A., Smith, S.F.: A constraint-based method for project scheduling with time windows. J. Heuristics 8(1), 109–136 (2002)
Dean, T.: Large-scale temporal data bases for planning in complex domains. In: IJCAI, pp. 860–866 (1987)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Cesta, A., Oddi, A., Smith, S.: Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. In: AIPS 1998. Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, pp. 214–223 (1998)
Laborie, P., Ghallab, M.: Planning with Sharable Resource Constraints. In: Proceedings of the 14th Int. Joint Conference on Artificial Intelligence (IJCAI 1995) (1995)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Oddi, A., Cesta, A., Policella, N., Smith, S.F.: Iterative flattening search for resource constrained scheduling. J. Intelligent Manufacturing (2008) (published on-line November, 2008), doi:10.1007/s10845-008-0163-8
Cesta, A., Fratini, S.: The timeline representation framework as a planning and scheduling software development environment. (unpublished manuscript) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oddi, A., Rasconi, R. (2009). Iterative Flattening Search on RCPSP/max Problems: Recent Developments. In: Oddi, A., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2008. Lecture Notes in Computer Science(), vol 5655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03251-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-03251-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03250-9
Online ISBN: 978-3-642-03251-6
eBook Packages: Computer ScienceComputer Science (R0)