Boosting the Performance of Iterative Flattening Search

September 2007

Boosting the Performance of Iterative Flattening Search

Authors:

A. Oddi, N. Policella, A. Cesta, and S. F. Smith

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.
@conference{Oddi-2007-120491,
author = {A. Oddi And N. Policella And A. Cesta And S. F. Smith},
title = {Boosting the Performance of Iterative Flattening Search},
booktitle = {Proceedings of 10th Congress of the Italian Association for Artificial Intelligence (AI*IA '07): Artificial Intelligence and Human-Oriented Computing},
year = {2007},
month = {September},
pages = {447 - 458},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.