This work is licensed under a Creative Commons Attribution 4.0 International License. The Lancaster rehearsal problem was first described in the following paper, although it does not give the data [denardo2012dynamic].
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 [cheng1993optimal].
A constraint programming model and solutions for the rehearsal and Film1 problems are described in [smith2003constraint].
[denardo2012dynamic]
Dynamic programming: models and applications
Courier Dover Publications
2012
[smith2003constraint]
Constraint programming in practice: Scheduling a rehearsal
Re-search Report APES-67-2003, APES group,
2003
[cheng1993optimal]
Optimal scheduling in film production to minimize talent hold cost
Journal of Optimization Theory and Applications 79(3), 479–492,
1993
This work is licensed under a Creative Commons Attribution 4.0 International License.