Holooly Plus Logo

Question 6.3: Assign the three departments shown in Table 6.6 to locations......

Assign the three departments shown in Table 6.6 to locations A, B, and C, which are separated by the distances shown in Table 6.5 , in such a way that transportation cost is minimized. Note that Table 6.6 summarizes the flows in both directions. Use this heuristic: Assign departments with the greatest interdepartmental work flow first to locations that are closest to each other.

TABLE 6.5 Distance between locations (meters)
From To LOCATION
A B C
A 20 40
B 30
C

 

TABLE 6.6 Interdepartmental work flow (loads per day)
From To DEPARTMENT
1 2 3
1 30 170
Dept. 2 100
3
Step-by-Step
The 'Blue Check Mark' means that this solution was answered by an expert.
Learn more on how do we answer questions.

Ranking departments according to highest work flow and locations according to highest interlocation distances helps in making assignments.

From these listings, you can see that departments 1 and 3 have the highest interdepartmental work flow, and that locations A and B are the closest. Thus, it seems reasonable to consider assigning 1 and 3 to locations A and B, although it is not yet obvious which department should be assigned to which location. Further inspection of the work flow list reveals that 2 and 3 have higher work flow than 1 and 2, so 2 and 3 should probably be located more closely than 1 and 2. Hence, it would seem reasonable to place 3 between 1 and 2, or at least centralize that department with respect to the other two. The resulting assignments might appear as illustrated in Figure 6.11 .

If the cost per meter to move any load is $1, you can compute the total daily transportation cost for this assignment by multiplying each department’s number of loads by the trip distance, and summing those quantities:

At $1 per load meter, the cost for this plan is $7,600 per day. Even though it might appear that this arrangement yields the lowest transportation cost, you cannot be absolutely positive of that without actually computing the total cost for every alternative and comparing it to this one. Instead, rely on the choice of reasonable heuristic rules such as those demonstrated above to arrive at a satisfactory, if not optimal, solution.

Trip Distance
(meters)
Department
Pair
Work
Flow
A–B 20 1–3 170
B–C 30 2–3 100
A–C 40 1–2 30
Department Number of
Loads Between
Location Distance To: Loads × Distance
1 2:30 A C: 40 30 × 40 = 1,200
3: 170 B: 20 170 × 20 = 3,400
2 3: 100 C B: 30 100 × 30 = 3,000
B: 30 100 × 30 = \underline{3,000}
7,600
figure 6.11

Related Answered Questions