The local search technique implemented in this chapter builds on top of the techniques introduced in the previous two chapters. In particular, we use the same tabu search implementation, the N1NHood neighborhood, and the same critical path calculation. In fact, the central change in the implementation for this chapter is the creation of a new neighborhood to allow activities to be relocated from one resource to another. The new neighborhood implementation requires a number of minor changes in the other objects.