IBM ILOG Solver User's Manual > Local Search > Minimizing Talent Wait Cost Using LNS > About this problem

An excellent overview of this problem can be found in Barbara Smith's tutorial paper: "Constraint Programming in Practice: Scheduling a Rehearsal", research report APES-67-2003. This problem is also present in the Constraint Programming library (http://www.csplib.org) as problem number 39: the rehearsal problem. Here you may find the problem data supplied with Solver as well as references to Smith's tutorial and other information.

The original problem originated from Lancaster University in the 1970s where the objective was to minimize the waiting time of players during an evening rehearsal of several musical pieces. The application to the talent scheduling problem where each actor (or player) has a different rate of pay was described in T. C. E. Cheng, J. Diamond, and B. M. T. Lin: "Optimal scheduling in film production to minimize talent hold cost". Journal of Optimization Theory and Applications. 79:197-206, 1993.