Solving Talent Scheduling with Dynamic Programming

DOI10.1287/ijoc.1090.0378zbMath1243.90059OpenAlexW2153633961MaRDI QIDQ2899107

Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey

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)

Related Items (6)

Talent hold cost minimization in film production ⋮ An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling ⋮ Dominance breaking constraints

This page was built for publication: Solving Talent Scheduling with Dynamic Programming