A software company won tender to install a network and Wi-Fi facility in four different places. By working with a limited number of staff, the contractor has to arrange job sequencing so that the tasks can be completed with minimum cost. Table 2 provides the data for a 4-job problem. Tabu Search (TS) algorithm is an approach to search for the optimal solution for job sequencing for many years. In this case, it found that the sequence 2-4-1-3 provides the best sequence available during the search.

Based on the best sequence 2-4-1-3, answer the following questions.

a. Calculate the completion time, holding time, and delay time for each job.

b. Calculate the holding cost, and the late penalty cost for each job.

c. Calculate the total cost associated with the sequence 2-4-1-3.

d. In your opinion, why Tabu Search (TS) is one of the best approaches to find the optimal solution for job sequencing

Table 2 Due date Job Processing time in days 12 Holding cost (RM/day) 4 16 Penalty cost (RM/day) 8 20 10 8 22 2 N 3 4 12 6 4 6 28 4 6 Table 2 Due date Job Processing time in days 12 Holding cost (RM/day) 4 16 Penalty cost (RM/day) 8 20 10 8 22 2 N 3 4 12 6 4 6 28 4 6