1a special case of LPP (Linear Programming Problem) in which the main objective is to transport a product from various sources to various destinations at total minimum cost.
Transportation Model
2It is designed to find the best arrangement for transportation such that the transportation cost is minimum.
Transportation Model
3What are the two common objectives of transportation problems?
1. Minimize the cost of shipping units to destination, or
2. Maximize the profit of shipping units to destination
4a point of demand in a transportation problem
destination
5is the source or supply location in transportation problem.AP stands for?RP
origin
6are squares, which represent routes where no quantity is shipped between a source and a destination
Unused squares
7used square in the transportation problem are called?
stone squares
8Types of Transportation Problems:
1. Balanced transportation problem
2. Unbalanced transportation problem
9The sum of supply and sum of demand are same.
Balanced transportation problem
10The sum of supply and sum of demand are different.
Unbalanced transportation problem
11Methods to solve Transportation Model
1. Northwest Corner Rule (NCR)
2. Minimum Cost Method (MCM) or Greedy Method
3. Vogel’s Approximation Method (VAM)
12A procedure for obtaining an initial feasible solution to a transportation problem that starts with allocating units to the upper left-hand corner of any transportation problem.
Northwest Corner Rule (NCR)
13 a systematized procedure used to find an initial feasible solution to a transportation problem; it is easy to use and provides good (but not optimal) solution.
Minimum Cost Method (MCM) or Greedy Method
14An algorithm that finds an initial feasible solution to a transportation problem by considering the “penalty cost” of not using the cheapest available route.
Vogel’s Approximation Method (VAM)
15Industrial applications of Transportation Model
1. Minimize the transportation cost from source to destination.
2. Determine lowest cost location for new industries, offices, warehouse, etc.
3. Determine the number of products to be manufactured according to demand.
4. Courier Services: Helps in taking proper decisions to find the best route for transportation.
16determines whether there is a cell with no allocation that would reduce cost if used.
stepping-stone method
17arises in a variety of decision-making situations; typical assignment problems involve assigning jobs to machines, agents to tasks, sales personnel to sales territories, contracts to bidders, and so on.
assignment problem
18is a special application of Linear Programming Problem (LPP), in which the main objective is to assign the work or task to a group of individuals
Assignment model
19The assignment problem is classified into
1. balanced assignment problem and
2. unbalanced assignment problem.
20If the number of rows is equal to the number of columns, then the problem is termed as?
balanced assignment problem
21Typical Examples of Assignment Problems:
1. Auction Model
2. Job Problem
3. Marriage Problem
22A number of goods has to be evenly distributed to an equal number of customer. Every customer has its own price idea on the good he is interested. Goal is to maximize the all-round price.
Auction Model
23A number of work assignments has to be distributed to an equally number of workers or machines. The evaluation will be the qualification of a worker or the costs to assign the order to a machine.
Job Problem
24A father wants to minimize his marriage gift and wants to maximize the sympathy of his daughters to the men
Marriage Problem
25is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods.
Hungarian method
26Hungarian method was developed and published in 1955 by?
Harold Kuhn
27"Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians:
Dénes Kőnig and Jenő Egerváry.
28is an assignment problem where the number of facilities is not equal to the number of jobs.
Unbalanced Assignment problem
29are broken down into individual tasks or activities, which are arranged in logical sequence.
Projects
30is prepared, which presents visually the relationship between all the activities involved and the cost for different activities.
network diagram
31helps designing, planning, coordinating, controlling and in decision-making in order to accomplish the project economically in the minimum available time with the limited available resources.
Network analysis
32Managerial applications of network analysis are as follows:
1. Assembly line scheduling,
2. Research and development,
3. Inventory planning and control,
4. Shifting of manufacturing plant from one site to another,
5. Launching of new products and advertising campaigns,
6. Control of traffic flow in cities,
7. Budget and audit procedures,
8. Launching space programs,
9. Installation of new equipment,
10. Long-range planning and developing staffing plans, etc.
33A number of network techniques, given below have been developed in recent times:
1. PERT- Program Evaluation and Review Technique
2. CPM- Critical Path Method
3. RAMS- Resource Allocation and Multi-project Scheduling
4. PEP- Program Evolution Procedure
5. COPAC- Critical Operating Production Allocation Control
6. MAP- Manpower Allocation Procedure
7. RPSM- Resource Planning and Scheduling Method
8. LCS- Least Cost Scheduling
9. MOSS- Multi-Operation Scheduling System
10. PCS- Project Control System
11. GERT- Graphical Evaluation Review Technique.
34PERT stands for?
Program Evaluation and Review Technique
35CPM stands for?
Critical Path Method
36RAMS stands for?
Resource Allocation and Multi-project Scheduling
37PEP stands for?
Program Evolution Procedure
38COPAC stands for?
Critical Operating Production Allocation Control
39MAP stands for?
Manpower Allocation Procedure
40RPSM stands for?
Resource Planning and Scheduling Method
41LCS stands for?
Least Cost Scheduling
42MOSS stands for?
Multi-Operation Scheduling System
43PCS stands for?
Project Control System
44GERT stands for?
Graphical Evaluation Review Technique
45is used for planning projects of all sizes, and it is a useful way of showing what work is scheduled to be done on a specific time (seconds, minutes, hours, days, weeks, months or year).
Gantt chart
46developed the Gantt Chart as a graphical aid to scheduling jobs on machines in 1918.
Henry L. Gantt
47This application was the first of what has become known as project scheduling techniques.
Gantt chart
48The _____ axis of a Gantt chart shows the tasks that need to be completed, while the ______ axis represents time.
vertical
horizontal
49is the length of time an activity can be delayed without increasing the project completion time.
Slack