Talent hold cost minimization in film production

DOI10.3934/JIMO.2016013MaRDI QIDQ2358484zbMATH OpenOpenAlexFDO

Authors Hsiao-Lan Huang, T. C. Edwin Cheng, B. M. T. Lin

Publication date 15 June 2017

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2016013

zbMATH Keywords

lower boundschedulingtalent hold cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• Optimal scheduling in film production to minimize talent hold cost
• An enhanced branch-and-bound algorithm for the talent scheduling problem
• Solving talent scheduling with dynamic programming
• A genetic algorithm for the talent scheduling problem
• A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem

Cites work

• A Dynamic Programming Formulation with Diverse Applications
• A generalized insertion algorithm for the seriation problem
• A genetic algorithm for the talent scheduling problem
• Mapping the genome
• Optimal scheduling in film production to minimize talent hold cost
• Solving a family of permutation problems on 0-1 matrices
• Solving talent scheduling with dynamic programming
• The seriation problem and the travelling salesman problem

Cited in

(2)

• Solving talent scheduling with dynamic programming
• An enhanced branch-and-bound algorithm for the talent scheduling problem

This page was built for publication: Talent hold cost minimization in film production

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