prob039: The Rehearsal Problem

References

• The Lancaster rehearsal problem was first described in the following paper, although it does not give the data:
  R.M. Adelson, J.M. Norman and G. Laporte. "A Dynamic Programming Formulation with Diverse Applications", Operational Research Quarterly, 27:119--121 (1976).
• The talent scheduling problem and a heuristic to solve it are described the following paper. It uses data (from a film called Mob Story) which is the basis of the Film1 instance:
  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).
• A constraint programming model and solutions for the rehearsal and Film1 problems are described in:
  Barbara Smith, "Constraint Programming in Practice: Scheduling a Rehearsal" , Research Report APES-67-2003, September 2003. (Abstract)

Back to CSPLib home page.