[meteor_slideshow slideshow=”arp1″]
The problem that we will be discussing is the allocation problem that Cinema Paradiso (as well as any other DVD on-line rental company) has to solve on a daily basis. Every day, the company will have an updated list of customers who are due to be sent either one, two or three movies that day. Each of these customers has its own Wish List of the movies ranked in order of preference, where the movies on the 1st positions are the ones, which are the most preferred to be received by customers in the next dispatch. The collection of all the Wish Lists of all the customers (who need to be sent one or more movies on the day) can be seen as the list representing the collection of movies from where we need to choose which ones to send to which customers. Cinema Paradiso has only a limited number of copies available in
their current stock and may not be able to satisfy all their customers if many of them want the same movie on the same day. The collection of all the Wish Lists changes on a daily basis since every day movies are being sent to customers. Also, the stock levels of copies for each movie may fluctuate on a daily basis.
The basic requirement for Cinema Paradiso is to create an allocation model (process, system) that would help them maximise overall satisfaction of all the customers on a daily basis.
[meteor_slideshow slideshow=”arp2″]
A-Research-Paper.com is committed to deliver a custom paper/essay which is 100% original and deliver it within the deadline. Place your custom order with us and experience the different; You are guaranteed; value for your money and a premium paper which meets your expectations, 24/7 customer support and communication with your writer. Order Now
Use the order calculator below and get started! Contact our live support team for any assistance or inquiry.
[order_calculator]