Draw the process flow diagram, Data Structure & Algorithms

Assignment Help:

Draw the process flow diagram:

Anand   Dairy (AD) sources 150,000 litres of milk daily from large number of local villagers .The milk is collected from 4:00 AM to 6:00 am and stored in bulk cold storage .It is then processed and packaged into 500 ml pouches. The milk processing stages have a capacity to process 15,000 litres per hour. AD has 30 packaging lines of which only 20 are currently in use. Each packaging line employs 5 workers and can package 500 litres per hour .The 20 packaging lines thus employ 100 full time workers.  Each worker is paid Rs10 per hour during regular time (4:00A.M to 2:00 P.M) and Rs 12 per hour of overtime. The dairy works one shift starting from 4:00 A.M and has a policy to not to have any overnight storage of milk.

AD has enough storage capacity for unprocessed milk. Additionally, it has capacity to store 20,000 litres of processed and packaged milk in its finished goods (FG) warehouse, and any additional storage capacity can be rented at Rs 100 per 100 litres per day. From this FG warehouse AD serve daily retail demand  of 150,000 litres of milk through a network of milk dealers .Milk dealers arrive uniformly from 6:00 A. M to 4: 00 P.M with their milk vans that can hold 2500 litres of packaged milk each.

Till recently AD has enjoyed a monopoly, and milk dealers had no choice but to wait with their vans to collect their delivery. However with Baroda dairy setting up operations AD fears losing some of its dealers to its competitor.AD is quick to realise that its main concern is the long waiting time for its dealers with their milk vans. In order to retain its dealers AD has started compensating them for their wait at the rate of Rs 200 per hour for a waiting van.

Questions

1. Draw the process flow diagram

2. Determine the time when the first 500 ml pack will exit the packaging line .Determine the time when the first milk van is completely filled up and ready for despatch.

3. Determine the daily overtime wages cost for AD. Calculate the daily compensation that AD has to pay its waiting customers if the daily demand remains constant at 150,000 litres

4. AD is concerned with cost it has to incur due to waiting vans. So it decided to hire 5 additional workers to operate one additional packaging line. For this proposal calculate a) daily regular time cost  b) daily overtime cost  c) daily finished goods storage cost  d) daily milk van  waiting time cost

5. Consider the situation when 20 packaging lines are in use. Evaluate the following alternate proposals

a) Operate one additional packing line b) Operate  5 additional packing lines c) Operate  10 additional packing lines.


Related Discussions:- Draw the process flow diagram

Indexed sequential files, Indexed Sequential Files An index is inserted...

Indexed Sequential Files An index is inserted to the sequential file to provide random access. An overflow area required to be maintained to permit insertion in sequence. I

Queue, 1. Show the effect of each of the following operations on queue q. A...

1. Show the effect of each of the following operations on queue q. Assume that y (type Character) contains the character ‘&’. What are the final values of x and success (type boole

Show that towers of hanoi is o (2n), Question 1 Discuss the advantages of ...

Question 1 Discuss the advantages of implementation checks preconditions Question 2 Write a ‘C' program to search for an item using binary search Question 3 Show that To

Algorithm, Describe different methods of developing algorithms with example...

Describe different methods of developing algorithms with examples.

Algorithm to merge the lists together, Q. Let X = (X1, X2, X3,....Xn) and Y...

Q. Let X = (X1, X2, X3,....Xn) and Y= (Y1, Y2, Y3,....Xm) be the two linked lists respectively. Write down an algorithm to merge the lists together to get the linked list Z such th

How will you represent a max-heap sequentially, How will you represent a ma...

How will you represent a max-heap sequentially? Max heap, also known as the descending heap, of size n is an almost complete binary tree of n nodes such that the content of eve

Array-based representation of a binary tree, Assume a complete binary tree ...

Assume a complete binary tree T with n nodes where each node has an item (value). Label the nodes of the complete binary tree T from top to bottom & from left to right 0, 1, ..., n

Row major representation, Row Major Representation In memory the primar...

Row Major Representation In memory the primary method of representing two-dimensional array is the row major representation. Under this representation, the primary row of the a

Insertion of an element in a linear array, To delete an element in the list...

To delete an element in the list at the end, we can delete it without any difficult. But, assume if we desire to delete the element at the straining or middle of the list, then, we

Algorithm for dfs, Step 1: Choose a vertex in the graph and make it the sou...

Step 1: Choose a vertex in the graph and make it the source vertex & mark it visited. Step 2: Determine a vertex which is adjacent to the source vertex and begun a new search if

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd