We develop a search procedure for project scheduling problems with multiple resource constraints as well as precedence constraints. The procedure is applied to three popular search heuristics, ...

The goal is to minimise the tour costs consisting of wage, hotel costs, travelling expenses and penalty fees for possibly omitted customers. We present a mixed integer linear programming (MILP) model ...

SPRITE is a “heuristic search algorithm”—meaning that it may not nab all possible solutions. But its speed makes it a useful first step.