Part A: Scheduling 1. Consider a one-machine-six-jobs scheduling problem. All the jobs are available for scheduling at the beginning of the planning horizon itself. The processing times and due dates of the jobs are given in Table 1 Table 1: Job 1 Job 2 Job 3 Job 4 Job 5 Job 6 Processing Time(min.) 12 9 15 13 12 9 Due (minutes from start 25 45 55 30 90 70 of planning horizon (a) Use LPT, SPT, FCFS, RAN, EDD, and CR to arrive at a schedule (b) For each of the schedules, compute the following performance measures: i. Mean flow time ii. Make span iii. Mean completion time iv. Mean lateness v. Mean tardiness vi. Number of tardy jobs (c) Identify the rule that performs the best for each of these performance criteria