Consider the jobs in Table 4.22. Use Moore’s algorithm to find the sequence that minimizes the number of tardy jobs. Assume that processing can start at time zero.

TABLE 4.20 Data for Exercise 4.14 Activity Description Time (Min) Immediate Predecessor A Open and stack applications 0.20 —

B Process enclosed letter; make note of and handle any special requirements 0.37 A C Check off form 1 for page 1 of application 0.21 A D Check off form 2 for page 2 of application; file original copy of application 0.18 A E Calculate credit limit from standardized tables according to forms 1 and 2 0.19 C and D F Supervisor checks quotation in light of special processing of letter and notes type of form letter, address, and credit limit to return to applicant 0.39 B and D G Secretary types details on form letter and mails 0.36 E, F TABLE 4.21 Data for Exercise 4.15 Job Arrival Time

(Min)

Estimated Processing Time (Min) Due Date Importance

(Weight)

A 3 23 76 20 B 6 12 54 18 C 8 34 87 27 D 12 16 98 12 E 15 8 37 10 F 20 19 62 23 TABLE 4.22 Data for Exercise 4.16 Job A B C D E F Due date 15 6 9 23 20 30 Processing Time 10 3 4 8 10 6