Solving Talent Scheduling with Dynamic Programming

Authors:
Maria Garcia de la Banda;Peter J. Stuckey;Geoffrey Chu
Affiliations:
Faculty of Information Technology, Monash University, Melbourne, Victoria 3145, Australia;National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Melbourne, Victoria 3010, Australia;National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Melbourne, Victoria 3010, Australia
Venue:
INFORMS Journal on Computing
Year:
2011

Citing 9
Cited 3

Mapping the genome: some combinatorial problems arising in molecular biology

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Optimal scheduling in film production to minimize talent hold cost

Journal of Optimization Theory and Applications
Relaxation and clustering in a local search framework: application to linear placement

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Multi-scale Algorithm for the Linear Arrangement Problem

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A method for solving the minimization of the maximum number of open stacks problem within a cutting process

Computers and Operations Research
Automating branch-and-bound for dynamic programs

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Minimizing the maximum number of open stacks by customer search

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A generic method for identifying and exploiting dominance relations

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Explaining alldifferent

ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Improving combinatorial optimization: extended abstract

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.