Carry out an additional iteration of the above example.

Example 10.3-6 (Job Sequencing) This problem was solved in Example 10.3-2 using TS and in Example 10.3-4 using SA. We repeat the problem statement here for convenience (a fifth job is added to render the example more viable). Jobs are sequenced on a single machine. Each job j has a processing time t; and a due date d;. If job j is completed earlier than its due date, a holding cost h; per unit time is incurred. A tardy job j results in a penalty cost p; per unit time. Table 10.13 provides the data for a 5-job scheduling problem. Define Orch Sx = Job sequence used in iteration ko N(sk) = Neighborhood sequences of sk Zk = Total cost (holding+ penalty) of sequence Sk Job,j Penalty cost, p; ($/day) TABLE 10.13 Data for a Single-Machine 5-Job Sequencing Problem Processing time in days, T; Due date, dj Holding cost, h; ($/day) 1 10 15 3 2 8 20 3 6 10 5 4 7 30 5 12 6 10 22 10 8 15 4 Example 10.3-6 (Job Sequencing) This problem was solved in Example 10.3-2 using TS and in Example 10.3-4 using SA. We repeat the problem statement here for convenience (a fifth job is added to render the example more viable). Jobs are sequenced on a single machine. Each job j has a processing time t; and a due date d;. If job j is completed earlier than its due date, a holding cost h; per unit time is incurred. A tardy job j results in a penalty cost p; per unit time. Table 10.13 provides the data for a 5-job scheduling problem. Define Orch Sx = Job sequence used in iteration ko N(sk) = Neighborhood sequences of sk Zk = Total cost (holding+ penalty) of sequence Sk Job,j Penalty cost, p; ($/day) TABLE 10.13 Data for a Single-Machine 5-Job Sequencing Problem Processing time in days, T; Due date, dj Holding cost, h; ($/day) 1 10 15 3 2 8 20 3 6 10 5 4 7 30 5 12 6 10 22 10 8 15 4