Results 1 
4 of
4
Applications of Modern Heuristic Search Methods to Pattern Sequencing Problems
 COMPUTERS & OPERATIONS RESEARCH
, 1999
"... 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 simultane ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
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.
Caching search states in permutation problems
 In van Beek [19
"... Abstract. When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment will not occur again. However, we show that for some problems recording assignments is useful, because other assi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment will not occur again. However, we show that for some problems recording assignments is useful, because other assignments can lead to the same state of the search. We demonstrate this in two classes of permutation problem, a satisfaction problem and an optimization problem. Caching states visited has proved effective in reducing both search effort and runtime for difficult instances of each class, and the space requirements are manageable. 1
Constraint Programming in Practice: Scheduling a Rehearsal Report
, 2003
"... The basic principles of constraint programming (constraint satisfaction problems, search, constraint propagation) are introduced by discussing how constraint programming can be used to solve a specific optimization problem. A set of orchestral pieces is to be rehearsed and the problem requires fi ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The basic principles of constraint programming (constraint satisfaction problems, search, constraint propagation) are introduced by discussing how constraint programming can be used to solve a specific optimization problem. A set of orchestral pieces is to be rehearsed and the problem requires finding a sequence that will minimize the time that players are at the rehearsal but not playing, if they arrive for the first piece they are involved in and leave after the last. A constraint programming model of this problem is presented. A similar problem arises in `talent scheduling' in shooting a film; improvements to the basic model are given that allow a larger instance of this kind to be solved.
Solving Talent Scheduling with Dynamic Programming
"... We give a dynamic programming solution to the problem of scheduling scenes to minimize the cost of the talent. Starting from a basic dynamic program, we show a number of ways to improve the dynamic programming solution, by preprocessing and restricting the search. We show how by considering a bounde ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We give a dynamic programming solution to the problem of scheduling scenes to minimize the cost of the talent. Starting from a basic dynamic program, we show a number of ways to improve the dynamic programming solution, by preprocessing and restricting the search. We show how by considering a bounded version of the problem, and determining lower and upper bounds, we can improve the search. We then show how ordering the scenes from both ends can drastically reduce the search space. The final dynamic programming solution is, orders of magnitude faster than competing approaches, and finds optimal solutions to larger problems than were considered previously.