Reference no: EM132573670

The following table contains 12 billing inquiries that had errors and must go through two validation processes (balance check and DRG match). For some billing inquiries, the balance check is as easy as matching two numbers on the forms, whereas other times the inquiry must be checked via a computer system that takes extra time to access and is not very user friendly. The DRG match follows in about the same vein. Some DRG matches are resolved quickly (e.g., the DRG was written improperly or digits transposed); other times the inquiry must be verified via telephone with accounting, and that adds time. The inquiries are screened in batches of 12 (hence the 12 listed in the table), and the approximate time requirements in minutes are listed for each process for each inquiry. At present the staff completes the claims using a first-come, first-served (FCFS) sequencing rule. However, there is an idea that this method creates too much idle time and does not process the inquiries in the fastest time. Compute the total time to complete the jobs using FCFS and using Johnson's rule, and compare how each method performs with regard to idle time and total time to finish all jobs.

Inquiry              # Balance Ck               DRG Match

22                        8                         20

62                         10                           5

73                           15                         3

67                            15                       3

51                            5                       20

27                              25                  25

17                              50                   5

33                               15                 10

91                                 1                 20

21                                 25                  1

87                                  5                   5

55                                   15                 10

Question 1: Create Gantt charts for both the FCFS and Johnson's rule methods.