Solving talent scheduling with dynamic programming

DOI10.1287/IJOC.1090.0378MaRDI QIDQ2899107zbMATH OpenOpenAlexFDO

Authors Maria Garcia De La Banda, Peter J. Stuckey, Geoffrey Chu

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1090.0378

zbMATH Keywords

dynamic programming optimization scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Optimal scheduling in film production to minimize talent hold cost
• Talent hold cost minimization in film production
• A genetic algorithm for the talent scheduling problem
• An enhanced branch-and-bound algorithm for the talent scheduling problem
• A dynamic programming method for single machine scheduling

Cited in

(10)

• Optimal scheduling in film production to minimize talent hold cost
• Dominance breaking constraints
• Talent hold cost minimization in film production
• A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling
• An enhanced branch-and-bound algorithm for the talent scheduling problem
• Network-based approximate linear programming for discrete optimization
• Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
• Lower bounds for minimizing two types of unnecessary costs in the film and television industry
• Domain-independent dynamic programming
• Optimization in dubbing scheduling

This page was built for publication: Solving talent scheduling with dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899107)