Optimal scheduling in film production to minimize talent hold cost

DOI10.1007/BF00940554zbMath0797.90049OpenAlexW1967715706MaRDI QIDQ1321428

Bertrand M. T. Lin, Jeffrey E. Diamond, Cheng, T. C. Edwin

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940554

zbMATH Keywords

branch-and-boundNP-hardnessheuristic solutioncombinatorial modelnear-optimal solutions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (6)

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 Review for Submodular Optimization on Machine Scheduling Problems ⋮ A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem ⋮ An application of parallel virtual machine framework to film production problem

Cites Work

• Some simplified NP-complete graph problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal scheduling in film production to minimize talent hold cost