Solving Talent Scheduling with Dynamic Programming

References

• Adelson R. M., Norman J. M., Laporte G. A dynamic programming formulation with diverse applications. Oper. Res. Quart. (1976) 27(1):119–121Crossref, Google Scholar
• Ambühl C., Mastrolilli M., Svensson O. Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. Proc. 48th Annual IEEE Sympos. Foundations Comput. Sci. (2007) (IEEE, Washington, DC) 329–337Crossref, Google Scholar
• Becceneri J. C., Yannasse H. H., Soma N. Y. A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Comput. Oper. Res. (2004) 31(4):2315–2332Crossref, Google Scholar
• Cheng T. C. E., Diamond J. E., Lin B. M. T. Optimal scheduling in film production to minimize talent hold cost. J. Optim. Theory Appl. (1993) 79(3):479–492Crossref, Google Scholar
• Chu G., Stuckey P. J., Gent I. Minimizing the maximum number of open stacks by customer search. Proc. 15th Internat. Conf. Principles and Practice of Constraint Programming (2009) 5732(Springer, Berlin) 242–257Lecture Notes in Computer ScienceCrossref, Google Scholar
• CSPLib CSPLib: A problem library for constraints. (2008) . http://www.csplib.orgGoogle Scholar
• Faggioli E., Bentivoglio C. A. Heuristic and exact methods for the cutting sequencing problem. Eur. J. Oper. Res. (1998) 110(3):564–575Crossref, Google Scholar
• Garey M. R., Johnson D. D., Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. (1976) 1:237–267Crossref, Google Scholar
• Hur S.-W., Lillis J. Relaxation and clustering in a local search framework: Application to linear placement. Proc. 36th ACM/IEEE Conf. Design Automation Conf. (1999) (ACM, New York) 360–366Crossref, Google Scholar
• Karp R. M. Mapping the genome: Some combinatorial problems arising in molecular biology. Proc. 25th Annual ACM Sympos. Theory Comput. (1993) 278–285Crossref, Google Scholar
• Koren Y., Harel D., Kučera L. A multi-scale algorithm for the linear arrangement problem. Graph-Theoretic Concepts in Computer Sci., 28th Internat. Workshop (2002) 2573(Springer, Berlin) 296–309Lecture Notes in Computer ScienceCrossref, Google Scholar
• Puchinger J., Stuckey P. J., Glück R., de Moor O. Automating branch-and-bound for dynamic programs. Proc. ACM/SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM '08) (2008) (ACM, New York) 81–89 http://doi.acm.org/10.1145/1328408.1328421Crossref, Google Scholar
• Rose D. J. Triangulated graphs and the elimination process. J. Math. Appl. (1970) 32(3):597–609Google Scholar
• Smith B. M. Constraint programming in practice: Scheduling a rehearsal. (2003) . Technical Report APES-67-2003, APES Research Group, St. Andrews University, St. Andrews, ScotlandGoogle Scholar
• Smith B. M., Van Beek P. Caching search states in permutation problems. Proc. 11th Internat. Conf. Principles and Practice of Constraint Programming—CP 2005 (2005) 3709(Springer, Berlin) 637–651Lecture Notes in Computer ScienceCrossref, Google Scholar
• Verfaillie G., Lemaitre M., Schiex T. Russian doll search for solving constraint optimization problems. Proc. National Conf. Artificial Intelligence (AAAI96) (1996) (Association for the Advancement of Artificial Intelligence, Menlo Park, CA) 181–187Google Scholar
• Yannasse H. H. On a pattern sequencing problem to minimize the maximum number of open stacks. Eur. J. Oper. Res. (1997) 100(3):454–463Crossref, Google Scholar
• Yuen B. J. Heuristics for sequencing cutting patterns. Eur. J. Oper. Res. (1991) 55(2):183–190Crossref, Google Scholar
• Yuen B. J. Improved heuristics for sequencing cutting patterns. Eur. J. Oper. Res. (1995) 87(1):57–64Crossref, Google Scholar
• Yuen B. J., Richardson K. V. Establishing the optimality of sequencing heuristics for cutting stock problems. Eur. J. Oper. Res. (1995) 84(3):590–598Crossref, Google Scholar