Boosting the Performance of Iterative Flattening Search

  • Angelo Oddi
  • Nicola Policella
  • Amedeo Cesta
  • Stephen F. Smith
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4733)

Abstract

Iterative Flattening search is a local search schema introduced for solving scheduling problems with a makespan minimization objective. It is an iterative two-step procedure, where on each cycle of the search a subset of ordering decisions on the critical path in the current solution are randomly retracted and then recomputed to produce a new solution. Since its introduction, other variations have been explored and shown to yield substantial performance improvement over the original formulation. In this spirit, we propose and experimentally evaluate further improvements to this basic local search schema. Specifically, we examine the utility of operating with a more flexible solution representation, and of integrating iterative-flattening search with a complementary tabu search procedure. We evaluate these extensions on large benchmark instances of the Multi-Capacity Job-Shop Scheduling Problem (mcjssp) which have been used in previous studies of iterative flattening search procedures.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Policella, N., Smith, S.F., Cesta, A., Oddi, A.: Generating Robust Schedules through Temporal Flexibility. In: ICAPS 2004. Proceedings of the 14th International Conference on Automated Planning & Scheduling, pp. 209–218 (2004)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)CrossRefGoogle Scholar
  8. 8.
    Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science 42, 797–813 (1996)MATHCrossRefGoogle Scholar
  9. 9.
    Nuijten, W., Aarts, E.: A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling. European Journal of Operational Research 90(2), 269–284 (1996)MATHCrossRefGoogle Scholar
  10. 10.
    Lawrence, S.: Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Technical report, Graduate School of Industrial Administration, Carnegie Mellon University (1984)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Angelo Oddi
    • 1
  • Nicola Policella
    • 2
  • Amedeo Cesta
    • 1
  • Stephen F. Smith
    • 3
  1. 1.ISTC-CNR, RomeItaly
  2. 2.European Space Agency, DarmstadtGermany
  3. 3.The Robotics Institute, Carnegie Mellon UniversityUSA

Personalised recommendations