Optimal scheduling in film production to minimize talent hold cost

Edwin Tai Chiu Cheng, J. E. Diamond, B. M T Lin

Research output: Journal article publicationJournal articleAcademic researchpeer-review

28 Citations (Scopus)


The problem of minimizing the cost due to talent hold days in the production of a feature film is considered. A combinatorial model is developed for the sequencing of shooting days in a film shoot. The problem is shown to be strongly NP-hard. A branch-and-bound solution algorithm and a heuristic solution method for large instances of the problem (15 shooting days or more) are developed and implemented on a computer. A number of randomly generated problem instances are solved to study the power and speed of the algorithms. The computational results reveal that the heuristic solution method is effective and efficient in obtaining near-optimal solutions.
Original languageEnglish
Pages (from-to)479-492
Number of pages14
JournalJournal of Optimization Theory and Applications
Issue number3
Publication statusPublished - 1 Dec 1993


  • branch-and-bound algorithms
  • NP-hardness
  • Scheduling

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics
  • Management Science and Operations Research


Dive into the research topics of 'Optimal scheduling in film production to minimize talent hold cost'. Together they form a unique fingerprint.

Cite this