Analysis of Revenue Maximization Under Two Movie‐Screening Policies

Abstract

A few weeks before the start of a major season, movie distributors arrange a private screening of the movies to be released during that season for exhibitors and, subsequently, solicit bids for these movies (from exhibitors). Since the number of such solicitations far exceeds the number of movies that can be feasibly screened at a multiplex (i.e., a theater with multiple screens), the problem of interest for an exhibitor is that of choosing a subset of movies for which to submit bids to the distributors. We consider the problem of the selection and screening of movies for a multiplex to maximize the exhibitor's cumulative revenue over a fixed planning horizon. The release times of the movies that can potentially be selected during the planning horizon are known a priori. If selected for screening, a movie must be scheduled through its obligatory period, after which its run may or may not be extended. The problem involves two primary decisions: (i) the selection of a subset of movies for screening from those that can potentially be screened during the planning horizon and (ii) the determination of the duration of screening for the selected movies. We investigate two basic and popular screening policies: preempt-resume and non-preempt. In the preempt-resume policy, the screening of a movie can be preempted and resumed in its post-obligatory period. In the non-preempt policy, a movie is screened continuously from its release time until the time it is permanently withdrawn from the multiplex. We show that optimizing under the preempt-resume policy is strongly NP-hard while the problem under the non-preempt policy is polynomially solvable. We develop efficient algorithms for the problem under both screening policies and show that the revenue obtained from the preempt-resume policy can be significantly higher as compared with that from the non-preempt policy. Our work provides managers of multiplexes with valuable insights into the selection and screening of movies and offers an easy-to-use computational tool to compare the revenues obtainable from adopting these popular policies.

Sentiment Manipulation in Online Platforms: An Analysis of Movie Tweets

“…For example, Swami et al (2001) studied movie exhibitors' decision to keep or replace a movie currently in the theater and proposed optimal replacement policies. Dawande et al (2010) studied movie-screening policies and provided managerial insights regarding the revenue maximizing selection and screening of movies. Somlo et al (2011) proposed a method to improve movies' distribution planning and location selection problem.…”

Demand driven operations management in motion picture exhibition

“…The work of Dawande et al (2010) and Raut et al (2009) provides a compelling foundation for further research in the niche area of genetic algorithms for movie scheduling. Dawande et al (2010) develop a GA heuristic to solve the nonconsecutive scheduling problem, which performs favorably when benchmarked against optimal results. In Raut et al (2009), the GA is compared to three greedy heuristic methods: (1) a simple revenue-based heuristic,…”

“…However, the movie screen problem has unique constraints, such as play-period restrictions, in which the movie must play for a minimum number of weeks, and the requirement that it must play consecutively. More notably, movie scheduling problems differ from machine scheduling problems because the value of the job (movie) is not fixed (Dawande et al 2010).…”

“…The ESP problem has been addressed in the literature on both macro and micro levels, with empirical studies (e.g., Eliashberg et al 2001) demonstrating that quantitative models yield an incremental lift in attendance. The macro level addresses the problem of selecting which films to play at a location and for how many weeks (Dawande et al 2010, Somlo 2005, Somlo et al 2011, Swami et al 1999; the micro problem involves identifying the time segments and auditoriums in which to play films in a multiplex (Eliashberg et al 2009a).…”

An Integrated Logistic Model for Predictable Disasters

“…The literature that motivates the integrated/coordinated decision problems is rich in a commercial supply chain environment (e.g., Dawande et al. , Rajapakshe , et al. , ).…”