An enhanced branch-and-bound algorithm for the talent scheduling problem

The talent scheduling problem is a simplified version of the real-world film shooting problem, which aims to determine a shooting sequence so as to minimize the total cost of the actors involved. In this article, we first formulate the problem as an integer linear programming model. Next, we devise a branch-and-bound algorithm to solve the problem. The branch-and-bound algorithm is enhanced by several accelerating techniques, including preprocessing, dominance rules and caching search states. Extensive experiments over two sets of benchmark instances suggest that our algorithm is superior to the current best exact algorithm. Finally, the impacts of different parameter settings, algorithm components and instance generation distributions are disclosed by some additional experiments.

[1]  Bertrand M. T. Lin,et al.  Optimal scheduling in film production to minimize talent hold cost , 1993 .

[2]  Peter J. Stuckey,et al.  Solving Talent Scheduling with Dynamic Programming , 2011, INFORMS J. Comput..

[3]  Stefan Hougardy,et al.  A simple approximation algorithm for the weighted matching problem , 2003, Inf. Process. Lett..

[4]  Stefan Voß,et al.  Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..

[5]  D. Michie.  “Memo” Functions and Machine Learning , 1968, Nature.

[6]  William Pugh.  An improved replacement strategy for function caching , 1988, LFP '88.

[7]  Andrew Lim,et al.  A Branch-and-Bound Algorithm for the Talent Scheduling Problem , 2014, IEA/AIE.

[8]  J. Hilden.  Elimination of recursive calls using a small table of “randomly” selected function values , 1976 .

[9]  Michael Affenzeller,et al.  An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective , 2012, Eur. J. Oper. Res..

[10]  Barbara M. Smith.  Caching Search States in Permutation Problems , 2005, CP.

[11]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[12]  E T.C..  Optimal Scheduling in Film Production to Minimize Talent Hold Cost , 2004 .

[13]  Süleyman Tüfekci,et al.  A genetic algorithm for the talent scheduling problem , 1994, Comput. Oper. Res..

[14]  Bilal Toklu,et al.  An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations , 2012, Comput. Oper. Res..

[15]  Barbara M. Smith.  Constraint Programming in Practice: Scheduling a Rehearsal , 2003 .

[16]  Andrew Lim,et al.  The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach , 2012, Eur. J. Oper. Res..

[17]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

[18]  Ulrich Derigs,et al.  A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem , 2008, OR Spectr..

[19]  J. M. Norman,et al.  A Dynamic Programming Formulation with Diverse Applications , 1976 .

[20]  José Rui Figueira,et al.  A reduction dynamic programming algorithm for the bi-objective integer knapsack problem , 2013, Eur. J. Oper. Res..

[21]  Mohammad Ranjbar,et al.  Two branch-and-bound algorithms for the robust parallel machine scheduling problem , 2012, Comput. Oper. Res..

[22]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.