The Talent Scheduling problem (TS) is a practical problem entailed by devising a schedule for shooting a film, which is a typical constraint optimization problem. The current modeling approaches are limited and not efficient enough. We present a more concise and efficient modeling approach for the problem. Besides, we exploit TS as a case study to explore how to utilize parallel constraint solving to speedup this constraint optimization problem.
CITATION STYLE
Liu, K., Löffler, S., & Hofstedt, P. (2019). Solving the Talent Scheduling Problem by Parallel Constraint Programming. In IFIP Advances in Information and Communication Technology (Vol. 559, pp. 236–244). Springer New York LLC. https://doi.org/10.1007/978-3-030-19823-7_19
Mendeley helps you to discover research relevant for your work.