This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with respect to some given objective function. We consider two di#erent objectives: Minimization of the number of simultaneously open stacks and minimization of the average order spread. Both objectives require the adaptive evaluation of changed solutions to allow an e#cient application of neighbourhood search techniques.

Problems of sequencing cutting patterns arise in several industries. Given a set of cutting patterns and a given objective, a sequencing problem consists of finding a permutation of patterns that optimises the objective. Single objective problems are NP-hard. Heuristics and metaheuristics provide suitable solution approaches.