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

Explain critical path and chain, 1.  Using the traditional method of CPM: ...

1.  Using the traditional method of CPM: a.  What activities are on the critical path? b.  What is the expected total lead time of the project? 2.  Using CCPM: a.  What

Explain the prim''s minimum spanning tree algorithm, Question 1. Explai...

Question 1. Explain the different types of traversal on binary tree 2. Explain the Prim's minimum spanning tree algorithm 3. Differentiate fixed and variable storage allo

Explain the stack, QUESTION Explain the following data structures: ...

QUESTION Explain the following data structures: (a) List (b) Stack (c) Queues Note : your explanation should consist of the definition, operations and examples.

Write a program for linear search, In the book the following methods are pr...

In the book the following methods are presented: static void selectionSort(Comparable[] list) static void insertionSort(Comparable[] list) static boolean linearSearch(Comparable

Implementing abstract data types, Implementing abstract data types A co...

Implementing abstract data types A course in data structures and algorithms is hence a course in implementing abstract data types. It may seem that we are paying a lot of atten

Kruskal algorithm for minimum spanning, Implementations of Kruskal's algori...

Implementations of Kruskal's algorithm for Minimum Spanning Tree. You are implementing Kruskal's algorithm here. Please implement the array-based Union-Find data structure.

Acyclic graphs, Acyclic Graphs In a directed graph a path is said to fo...

Acyclic Graphs In a directed graph a path is said to form a cycle is there exists a path (A,B,C,.....P) such that A = P. A graph is called acyclic graph if there is no cycle in

Pipelining., How branching takes place in Instruction pipeline. Explain wit...

How branching takes place in Instruction pipeline. Explain with suitable examples

Process of channel access, Channel access In first generation systems, ...

Channel access In first generation systems, every cell supports a number of channels. At any given time a channel is allocated to only one user. Second generation systems also

Methods of collision resolution, Methods of Collision Resolution 1)  Co...

Methods of Collision Resolution 1)  Collision Resolution by separate chaining  2)  Collision Resolution by open addressing

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