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

Calculates partial sum of an integer, Now, consider a function that calcula...

Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L

Define big oh notation, Big oh notation (O) : The upper bound for the funct...

Big oh notation (O) : The upper bound for the function 'f' is given by the big oh notation (O). Considering 'g' to be a function from the non-negative integers to the positive real

Abstract data type-stack, Conceptually, the stack abstract data type mimics...

Conceptually, the stack abstract data type mimics the information kept into a pile on a desk. Informally, first we consider a material on a desk, where we might keep separate stack

Algorithm to find maximum and minimum numbers, Give an algorithm to find bo...

Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.

State the example of pre- and post-conditions, State the example of pre- an...

State the example of pre- and post-conditions Suppose that function f(x) should have a non-zero argument and return a positive value. We can document these pre- and post-condit

Recursive and iterative handling of a binary search tree, This section pres...

This section prescribes additional exercise with the recursive and iterative handling of a binary search tree. Adding to the Binary Search Tree Recursively Add implementation

Graphs, floyd warshall algorithm

floyd warshall algorithm

Procedure of analysis of algorithm, Example 1:  Following are Simple sequen...

Example 1:  Following are Simple sequence of statements Statement 1;  Statement 2; ... ... Statement k; The entire time can be found out through adding the times for

Define min-heap, Define min-heap A min-heap is a complete binary tree i...

Define min-heap A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-hea

Binary search, Explain binary search with an example

Explain binary search with an example

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