Skip to Main content Skip to Navigation
Conference papers

Solving the Talent Scheduling Problem by Parallel Constraint Programming

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-02331320
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, October 24, 2019 - 12:51:00 PM
Last modification on : Thursday, October 24, 2019 - 12:54:40 PM
Long-term archiving on: : Saturday, January 25, 2020 - 3:37:42 PM

File

483292_1_En_19_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Ke Liu, Sven Löffler, Petra Hofstedt. Solving the Talent Scheduling Problem by Parallel Constraint Programming. 15th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), May 2019, Hersonissos, Greece. pp.236-244, ⟨10.1007/978-3-030-19823-7_19⟩. ⟨hal-02331320⟩

Share

Metrics

Record views

55

Files downloads

4