Skip to main content
SpringerLink
Log in

A Branch-and-Bound Algorithm for the Talent Scheduling Problem

  • Conference paper
Modern Advances in Applied Intelligence (IEA/AIE 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8481))

Abstract

The talent scheduling problem is a simplified version of the real-world film shooting problem, which aims to determine a shooting sequence so as to minimize the total cost of the actors involved. We devise a branch-and-bound algorithm to solve the problem. A novel lower bound function is employed to help eliminate the non-promising search nodes. Extensive experiments over the benchmark instances suggest that our branch-and-bound algorithm performs better than the currently best exact algorithm for the talent scheduling problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de la Banda, M.G., Stuckey, P.J., Chu, G.: Solving talent scheduling with dynamic programming. INFORMS Journal on Computing 23(1), 120–137 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  2. Adelson, R.M., Norman, J.M., Laporte, G.: A dynamic programming formulation with diverse applications. Operational Research Quarterly, 119–121 (1976)

    Google Scholar 

  3. Cheng, T.C.E., Diamond, J.E., Lin, B.M.T.: Optimal scheduling in film production to minimize talent hold cost. Journal of Optimization Theory and Applications 79(3), 479–492 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Smith, B.M.: Constraint programming in practice: Scheduling a rehearsal. Research Report APES-67-2003, APES group (2003)

    Google Scholar 

  5. Smith, B.M.: Caching search states in permutation problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 637–651. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Nordström, A.L., Tufekci, S.: A genetic algorithm for the talent scheduling problem. Computers & Operations Research 21(8), 927–940 (1994)

    Article  MATH  Google Scholar 

  7. Fink, A., Voß, S.: Applications of modern heuristic search methods to pattern sequencing problems. Computers and Operations Research 26(1), 17–34 (1999)

    Article  MATH  Google Scholar 

  8. Karp, R.M.: Reducibility among combinatorial problems. Springer (1972)

    Google Scholar 

  9. Drake, D.E., Hougardy, S.: A simple approximation algorithm for the weighted matching problem. Information Processing Letters 85(4), 211–213 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Michie, D.: “memo” functions and machine learning. Nature 218(5136), 19–22 (1968)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sun Yat-Sen University, Guangdong, China

    Xiaocong Liang, Zizhen Zhang & Songshan Guo

  2. Huazhong University of Science and Technology, Wuhan, China

    Hu Qin

  3. Nanjing University, Nanjing, China

    Andrew Lim

Authors
  1. Xiaocong Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zizhen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hu Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Songshan Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas State University, TX 78666, San Marcos, USA

    Moonis Ali

  2. Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, No. 415, Chien Kung Road, 80778, Kaohsiung, Taiwan

    Jeng-Shyang Pan

  3. Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan

    Shyi-Ming Chen

  4. Department of Electronics Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan (ROC)

    Mong-Fong Horng

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Liang, X., Zhang, Z., Qin, H., Guo, S., Lim, A. (2014). A Branch-and-Bound Algorithm for the Talent Scheduling Problem. In: Ali, M., Pan, JS., Chen, SM., Horng, MF. (eds) Modern Advances in Applied Intelligence. IEA/AIE 2014. Lecture Notes in Computer Science(), vol 8481. Springer, Cham. https://doi.org/10.1007/978-3-319-07455-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07455-9_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07454-2

  • Online ISBN: 978-3-319-07455-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation