Markus E  Puttlitz and Martin W  P  Savelsbergh with whom we collaborated on using SWO
in a hybrid AI OR approach Many useful discussions came out of that collaboration and without them we would not have had access to the Lucent problems  Markus also wrote the framework for the scheduling experiments and the TABU and IP implementations The authors also thank the members of CIRL and James Crawford at i Technologies for their helpful comments and suggestions  We would like to thank Andrew Parkes in particular for suggestions and insights in the graph coloring domain This effort was sponsored by the Air Force Office of Scientific Research  Air Force Ma teriel Command   SAF  under grant number F
by the Defense Advanced Research Projects Agency  DARPA  and Rome Laboratory  Air Force Materiel Command SF under agreements F
and F
and by the National Science Foundation under grant number CDA
S Government is authorized to reproduce and distribute reprints for Governmen The tal purposes notwithstanding any copyright annotation thereon  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily rep resenting the official policies or endorsements  either expressed or implied  of the Defense Advanced Research Projects Agency Rome Laboratory the Air Force Office of Scientific Research the National Science Foundation or the S Government Most of the work reported in this paper was done while both authors were at CIRL

## References

TCCClements D  Crawford J  Joslin D  Nemhauser  G  Puttlitz  M
Savelsbergh M
Heuristic optimization  A hybrid AI OR approach  In Proceedings of the Workshop on Industrial Constraint-Directed Scheduling In conjunction with the Third International Conference on Principles and Practice of Constraint Program ming CP
Crawford J Dalal M
Walser J
Abstract local search  In Proceedings of the AIPS-98 Workshop on Planning as Combinatorial Search  In conjunction with the Fourth International Conference on Artificial Intelligence Planning Systems  AIPS
An approach to resource constrained project scheduling In Proceed¬
Crawford J M
ings of the 1996 Artificial Intelligence and Manufacturing Research Planning Workshop pp Exploring the k colorable landscape with iterated Culberson J C
Luo F
greedy  In (Johnson & Trick, 1996) pp Feo T A
Resende  M   G
Greedy randomized adaptive search procedures Journal of Global Optimization  6 Johnson D S
Garey M R
Computers and Intractability: A Guide to the Theory of NP-Completeness  W  H  Freeman Glover F
Laguna M
Tabu Search Kluwer