VED ANALYSIS

It attempts to classify the items used into three broad categories, namely Vital, Essential,
and Desirable. The analysis classifies items on the basis of their criticality for the industry or
company. Vital: Vital category items are those items without which the production activities
or any other activity of the company, would come to a halt, or at least be drastically
affected. Essential: Essential items are those items whose stock out cost is very high for
the company. Desirable: Desirable items are those items whose stock-out or shortage causes
only a minor disruption for a short duration in the production schedule. The cost incurred is
very nominal. VED Analysis is very useful to categorize items of spare parts and components.
QUEUING PROBLEM
Queuing theory is the study of how systems cope with a variable demand for service.
Queuing problems occur when the service doesn't match the level of demand, for example
when a supermarket doesn't have enough cashiers on a busy morning. In IT, queuing
problems crop up when requests reach a system faster than it can process them.In queuing
theory, problems occur when there's too much service as well as too little. A store that
schedules four cashiers for a shift and sees three of them standing idle has a queuing
problem, for instance. Queuing problems occur in many situations: When cars wait to get
onto the freeway; when patients sit too long in the doctor's waiting room; or when many
callers ask the police for assistance at once.

The characteristics listed below would provide sufficient information.

The arrival pattern : How customers arrive e.g. singly or in groups (batch or bulk arrivals)How
the arrivals are distributed in time (e.g. what is the probability distribution of time between
successive arrivals (the inter-arrival time distribution))Whether there is a finite population of
customers or (effectively) an infinite number.

The service mechanism : A description of the resources needed for service to beginHow
long the service will take (the service time distribution)
The queue discipline: The queue discipline is the order or manner in which customers
from the queue are selected for service.
The number of customers allowed in the system. In certain cases, a service system is
unable to accommodate more than the required number of customers at a time. No further
customers are allowed to enter until space becomes available to accommodate new
customers. Such type of situations are referred to as finite (or limited) source queue.
Examples of finite source queues are cinema halls, restaurants, etc.
The number of service channels.
The Travelling Salesman Problem (often called TSP) is a classic algorithmic problem in the
field of computer science. It is focused on optimization. In this context better solution often
means a solution that is cheaper. TSP is a mathematical problem. The traveling salesman
problem is a problem in graph theory requiring the most efficient (i.e., least total
distance) Hamiltonian cycle a salesman can take through each of cities.
BALANCED AND UNBALANCED TRANSPORTATION PROBLEM
A transportation model in which the total supply and total demand are unequal is
called unbalanced. It is always possible to balance an unbalanced transportation problem.
Since Total supply = Total demand, the problem is balanced.