Skip to main content
SpringerLink
Log in

Optimal scheduling in film production to minimize talent hold cost

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lohtka, P., Private Communication, 1989.

  2. Hehner, B.,Making It: The Business of Film and Television in Canada, Academy of Canadian Cinema and Television, Ottawa, Canada, 1987.

    Google Scholar 

  3. Garey, M. R., Johnson, D. S., andStockmeyer, L.,Some Simplified NP-Complete Graph Problems, Theoretical Computer Science, Vol. 1, pp. 237–267, 1976.

    Google Scholar 

  4. Garey, M. R., andJohnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, New York, 1979.

    Google Scholar 

  5. French, S.,Sequencing and Scheduling: An Introduction to the Mathematics of Job Shop, John Wiley and Sons, New York, New York, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management, Hong Kong Polytechnic, Kowloon, Hong Kong

    T. C. E. Cheng (Professor and Head)

  2. Department of Mechanical and Industrial Engineering, University of Manitoba, Winnipeg, Manitoba, Canada

    J. E. Diamond (Doctoral Student)

  3. Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, Republic of China

    B. M. T. Lin (Lecturer)

Authors
  1. T. C. E. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. E. Diamond
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. M. T. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by W. Stadler

This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant OPG-0036424. The authors are thankful to two anonymous referees for their helpful comments on an earlier version of this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

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 79, 479–492 (1993). https://doi.org/10.1007/BF00940554

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940554

Key Words

Search

Navigation