Question: A mathematical programming system named SilverScreener uses a 0-1 integer programming model to help theater managers decide which movies to show on a weekly basis

A mathematical programming system named SilverScreener uses a 0-1 integer programming model to help theater managers decide which movies to show on a weekly basis in a multiple-screen theater (Interfaces, May/June 2001). Suppose that management of Valley Cinemas would like to investigate the potential of using a similar scheduling system for their chain of multiple-screen theaters. Valley selected a small two-screen movie theater for the pilot testing and would like to develop an integer programming model to help schedule movies for the next four weeks. Six movies are available. The first week each movie is available, the last week each movie can be shown, and the maximum number of weeks that each movie can run are shown here

A mathematical programming system named SilverScreener uses a 0-

The overall viewing schedule for the theater is composed of the individual schedules for each of the six movies. For each movie a schedule must be developed that specifies the week the movie starts and the number of consecutive weeks it will run. For instance, one possible schedule for movie 2 is for it to start in week 1 and run for two weeks. Theater policy requires that once a movie is started, it must be shown in consecutive weeks. It cannot be stopped and restarted again. To represent the schedule possibilities for each movie, the following decision variables were developed:

A mathematical programming system named SilverScreener uses a 0-

For example, x532 = 1 means that the schedule selected for movie 5 to begin in week 3 and run for two weeks. For each movie, a separate variable is given for each possible schedule.
a. Three schedules are associated with movie 1. List the variables that represent these schedules.
b. Write a constraint requiring that only one schedule be selected for movie 1.
c. Write a constraint requiring that only one schedule be selected for movie 5.
d. What restricts the number of movies that can be shown in week 1? Write a constraint that restricts the number of movies selected for viewing in week 1.
e. Write a constraint that restricts the number of movies selected for viewing in week3.

First Week Available Last Week Available Max. Run (weeks) Movie f if movie i is scheduled to start in week j and run for w weeks 0 otherwise

Step by Step Solution

3.33 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Variable for movie 1 x 111 x 112 x 121 b Only 1 schedule for movie 1 x 111 x ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

148-M-O-G-L-P (159).docx

120 KBs Word File

Students Have Also Explored These Related Optimization Questions!