Skip to main content

Scheduling the Brazilian Soccer Tournament with Fairness and Broadcast Objectives

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3867)

Abstract

The Brazilian soccer tournament is organized every year by the Brazilian Soccer Confederation. Its major sponsor is TV Globo, the largest media group and television network in Brazil, which imposes constraints on the games to be broadcast. Scheduling the games of this tournament is a very constrained problem, with two objectives: breaks minimization (fairness) and the maximization of the revenues from TV broadcasting. We propose an integer programming decomposition strategy to solve this problem to optimality. Numerical results obtained for the 2005 and 2006 editions of the tournament are reported and compared.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartsch, T., Drexl, A., Kröger, S.: Scheduling the professional soccer leagues of Austria and Germany. Computers and Operations Research 33, 1907–1937 (2006)

    CrossRef  MATH  Google Scholar 

  2. Della Croce, F., Oliveri, D.: Scheduling the Italian football league: An ILP-based approach. Computers and Operations Research 33, 1963–1974 (2006)

    CrossRef  MATH  Google Scholar 

  3. Easton, K., Nemhauser, G.L., Trick, M.: Sports scheduling. In: Leung, J.T. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 52.1–52.19. CRC Press, Boca Raton, FL (2004)

    Google Scholar 

  4. Ehrgott, M.: Multiple Criteria Optimization: Classification and Methodology. Shaker, Aachen (1997)

    Google Scholar 

  5. Goossens, D., Spieksma, F.: Scheduling the Belgian soccer league. In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, pp. 420–422 (August 2006)

    Google Scholar 

  6. Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research 46, 1–8 (1998)

    CrossRef  Google Scholar 

  7. Noronha, T.F., Ribeiro, C.C., Duran, G., Souyris, S., Weintraub, A.: A branch-and-cut algorithm for scheduling the highly constrained Chilean soccer tournament. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 174–186. Springer, Heidelberg (2007)

    Google Scholar 

  8. Urrutia, S., Ribeiro, C.C.: Maximizing breaks and bounding solutions to the mirrored traveling tournament problem. Discrete Applied Mathematics 154, 1932–1938 (2006)

    CrossRef  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Edmund K. Burke Hana Rudová

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ribeiro, C.C., Urrutia, S. (2007). Scheduling the Brazilian Soccer Tournament with Fairness and Broadcast Objectives. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77345-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77344-3

  • Online ISBN: 978-3-540-77345-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics