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

Dijkstra's algorithm, Q. Explain Dijkstra's algorithm for finding the short...

Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding

Process of decision making under uncertainty, (a) Describe the steps involv...

(a) Describe the steps involved in the process of decision making under uncertainty. (b) Explain the following principles of decision making: (i) Laplace, (ii) Hurwicz. (c

Define stack lifo, A stack is a last in, first out (LIFO) abstract data typ...

A stack is a last in, first out (LIFO) abstract data type and sequential data structure. A stack may have any abstract data type as a component, but is characterized by two fundame

Depth First Search Through Un-weighted Connected Graph , Q. Write down the ...

Q. Write down the algorithm which does depth first search through an un-weighted connected graph. In an un-weighted graph, would breadth first search or depth first search or neith

Design a binary search tree, Binary Search Tree usage: Write a progra...

Binary Search Tree usage: Write a program to compare the time taken for a search in a skewed tree, a balanced tree, and a random tree. Speci cally, your program should do the

Variable length codes, Variable length codes (Niveau I) Code the following ...

Variable length codes (Niveau I) Code the following sequence of integers (2, 4, 2, 8, 3, 1, 4, 5, 13, 2) with • unary codes • ? codes • d codes • Rice codes (for a suitable l) and

Kruskals algorithm, Krushkal's algorithm uses the concept of forest of tree...

Krushkal's algorithm uses the concept of forest of trees. At first the forest contains n single node trees (and no edges). At each of the step, we add on one (the cheapest one) edg

#, if two relations R and S are joined, then the non matching tuples of bot...

if two relations R and S are joined, then the non matching tuples of both R and S are ignored in

Abstract data type- queue, A significant aspect of Abstract Data Types is t...

A significant aspect of Abstract Data Types is that they explain the properties of a data structure without specifying the details of its implementation. The properties might be im

Explain thread, Thread By changing the NULL lines in a binary tree to ...

Thread By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack

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