Operations Research

Assignment
MILK SUPPLY NETWORK MODEL & FAST FOOD QUEUING SYSTEM

Mohammad Imad Shahid Khan

Section A Bachelor of Business Management (2013-2016) | December 1, 2014
School of Business, Alliance University

Group 10, Section A, Bachelor of Business Management (2013-2016)

Table of Contents
Assignment # 2 ............................................................................................................................................ 2
Objective ....................................................................................................................................................2
Network Model New York City .............................................................................................................2
Milk Demand ............................................................................................................................................. 3
Formulation of LPP .................................................................................................................................. 4
Assignment # 3 ............................................................................................................................................. 5
Objective ....................................................................................................................................................5
Queuing System.........................................................................................................................................5
About the Service ..................................................................................................................................... 6
Queuing Model ......................................................................................................................................... 6
Assumptions: ......................................................................................................................................... 6
Notations ................................................................................................................................................... 6
Representation ...........................................................................................................................................7
Calculation of the operating characteristics of queuing model ........................................................... 8

PAGE 1

Group 10, Section A, Bachelor of Business Management (2013-2016)

Assignment # 2
OBJECTIVE
To design a network for milk distribution of a dairy firm in a location connecting all the
major supply location with population > 10,000 and formulate to minimize the total
distribution cost.

NETWORK MODEL NEW YORK CITY

Using the Minimum Spanning Tree Technique, in the next page we made two distinct
routes 10 ton truck, based on the population of the distribution areas. Comparing the cost
of using 5 ton truck to serve this large population is not cost-effective, so we did not
include the said size truck.

PAGE 2

Group 10, Section A, Bachelor of Business Management (2013-2016)

MILK DEMAND
Manhattan 1.7 million people 0.1 lts per person = , or

170,000
10,000

Similarly, as per the population given by the Baruch College, City University of New York
Bronx 140,000 liters or 14 trucks of 10 ton capacity
Queens 220,000 liters or 22 trucks of 10 ton capacity
Brooklyn - 250,000 liters or 25 trucks of 10 ton capacity.
Staten Island 50,000 liters or 1 truck of 10 ton capacity.

Distribution Cost for the route (1-2), (2-5) & (2-6)

= [(17 + 14 + 22) ( 30) (3 1.6)] + [(22)
30 (9 1.6)] + [(14) 30 (8 1.6)]
= , /
Distribution Cost for the route (1-4-3)
= [(25 + 1) 30 (10 1.6)] + [(1) 30
(17 1.6)] = , /

PAGE 3

Group 10, Section A, Bachelor of Business Management (2013-2016)

Therefore, Total Distribution Cost = Rs 32, 832/

FORMULATION OF LPP

1.

Defining the Decision Variables

X12 - Origin to Manhattan

X13 Origin to Staten Island
X14 Origin to Brooklyn
X26 - Manhattan to Bronx
X25 Manhattan to Queens
X65 Bronx to Queens
X45 Queens to Brooklyn
X53 Brooklyn to Staten Island
2. Developing the Objective Function
Minimize
= (30 1.6) [(3 (17 + 14 + 22)) 12 + (20 1)13 + (10 25)14 + (8 14)26 +
(9 22) 25 + (11 22)65 + (8.5 25)45 + (17 1)53 ]
3. Building Constraints
=

PAGE 4

Group 10, Section A, Bachelor of Business Management (2013-2016)

Assignment # 3
OBJECTIVE
To study the queuing system followed by McDonalds branch at New BEL Road, Bangalore

QUEUING SYSTEM

The McDonalds branch was found to follow a Multiple-Server Model on the basis of an
FCFS (First Come First Serve) model. Being a relatively new branch, it seems to have
certain space constraints having 3 counters and 3 respective queues for customers. While
the counters were at the ground floor, the dining floor was located on the first floor
Counter#1

n=5

Counter#2

n=5

Counter#3

n=5

Diagrammatic Representation of the Queuing System

PAGE 5

Group 10, Section A, Bachelor of Business Management (2013-2016)

ABOUT THE SERVICE

The McDonalds branch at the New BEL Road starts its service at 10:00 am and ends by
10:00 pm every day. Having its proximity with institutes like MS Ramaiah Colleges,
National Institute of Advanced Studies and various offices like SLK Software, it has a huge
customer following among the students and workers in the region. The service counter is
handled by single individual worker backed by a kitchen staff.
As instructed to choose the peak hours, we decided to go at 12:30 pm and recorded the
customers arrival and McDonalds service rate for the period of 2 hours, during which we
happen to observe the proficiency of the staff in maintaining in efficiency in keeping the
process streamlined. Even with the presence of an hour glass, which sets deadline around
3 minutes and 15 seconds most of the customers were served earlier before the hour
glass deadline.

QUEUING MODEL

The Queuing Model was observed to be of the notation M/M/3 where the Customer
arrival rate was of Poisson Distribution and the Customer service rate was Exponential
service-time distribution, having 3 queues.

Assumptions:
1. Unlimited Queue Length.
2. Infinite Calling population.

NOTATIONS
Average Arrival Rate
1/ Average Time between Arrivals
Average Service Rate for each Server/Counter
1/ Average Service Time
s Number of Servers/Counters
n Nmber of units/customers in the queue

PAGE 6

Group 10, Section A, Bachelor of Business Management (2013-2016)

REPRESENTATION
Time Interval
(Recorded
cumulatively in every
5 min)

Customer
Service
Service
Service
Arrival
Counter#1 Counter#2 Counter#3
Rate

12:30

Closed (0)

12:35

Closed (0)

12:40

Closed (0)

12:45

Closed (0)

12:50

Closed (0)

12:55

13:00

13:05

13:10

13:15

13:20

13:25

13:30

13:35

13:40

13:45

13:50

15

13:55

14:00

14:05

14:10

14:15

11

Closed (0)

14:20

Closed (0)

14:25

Closed (0)

14:30

Total

122

66

54

70

Average Arrival Rate =

122
2 60

= 1.0166

1/ Average Time between Arrivals =

1
1.0166

= 0.9836

PAGE 7

Group 10, Section A, Bachelor of Business Management (2013-2016)

Average Service Rate for each Server/Counter =

1/ Average Service Time =

1
1.5833

66+54+70
2 60

= 1.5833

= 0.6315

s Number of Servers/Counters = 3 Counters

customers

n Number of units/customers in the queue = 5

CALCULATION OF THE OPERATING CHARACTERISTICS OF QUEUING

MODEL

Probability that the Service Facility is Idle,

0 =

1
!

1
)]
!

[=1
( ) ] [ ( ) (
=0

1
1 1.0166 3
31.5833
) ((31.5833)1.0166)]
3! 1.5833

(1.045925 103 )[ (

0.0550 5.5%
Probability of n=5 customers in the system,
For > , =

1

( )
!

0 = 7.32%

Average number of customers in the system,

()
( 1)! (

2 )

0 +

= 0.644 ~ 1

PAGE 8