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
Contributor : Hal Ifip <>
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


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views