The following table shows jobs to be processed at a machine. Determine the processing sequence that will minimize total number of late jobs.   Job Processing Time (days) Due Date (days)   A 3   4    B 2   5    C 5 10   D 2 11   E 4 13   F 9 201. Job is the first job that is late in the given sequence.2. Job has the largest processing time out of these 5 jobs.3. Optimal sequence is with on

Which of the following algorithms tends to minimize the process flow time?Group of answer choicesshortest job firstlongest job firstearliest deadline firstfirst come first served

n a network flow diagram, two jobs (i,j) and (i,k) of ‘9’and ‘6’ days duration leaves the node ‘i’ then which ofthe following will be Late start time for ‘i’, if it is provided that both (i,j) and (i,k) finish late on 12th and 8th dayrespectively?Select correct option:6th day2nd day3rd day1st day

Jobs A, B, and C require processing at work centre 1 then work centre 2, with the processing times at each work centre shown below. What is the job sequence using Johnson's rule?  Job WC#1 WC#2  A 8 2  B 7 3  C 5 9

You are given a job that has been divided into N tasks. The task cannot be divided any further. Each of the N tasks takes Si number of seconds to complete. Your job will be completed when all your tasks are completed. You have K workers at your disposal to help you complete the tasks. But as per the nature of the job, a worker can only be allocated continuous tasks. A worker can work only on a single task at any given point in time. However, the workers can work in parallel on different tasks. You have to find the minimum possible time in which you can complete the job.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines. The first line of each test case contains N and K - the number of tasks and available workers for the current job, separated by space. The next line contains N positive integers - denoting the time taken to complete the ith task.Output FormatFor each test case, print the minimum possible time in which you can complete the job, separated by a new line.Constraints50 points1 <= N,K <= 20100 points1 <= N,K <= 10000General Constraints1 <= T <= 501 <= Si <= 103ExampleInput610 31 10 13 4 5 12 23 12 18 88 417 27 22 45 26 32 45 162 274 617 374 24 61 81 66 76 512 154 104 215 30 10 50Output3866741596455ExplanationTest Case 1: The arrangement for which we can achieve minimum possible time is as follows:[1 10 13 4 5] - Worker 1[12 23] - Worker 2[12 18 8] - Worker 3Test Case 2: The arrangement for which we can achieve minimum possible time is as follows:[17 27 22] - Worker 1[45] - Worker 2[26 32] - Worker 3

A production manager must determine the processing sequence for seven jobs through the grinding and de-burring departments. The same sequence will be followed in each department. The manager’s goal is to move the jobs through the two departments as quickly as possible. The site supervisor of the grinding department wants the SPT rule to be used to minimize the work-in-process inventory in the department.   PROCESSING TIME (HOURS)    Job  Grinding   Deburring  A 3 6  B 2 4  C 1 5  D 4 3  E 9 4  F 8 7  G 6 2a. Prepare a schedule using the SPT priority rule for the grinding department (using the grinding times).multiple choice 1C-B-A-D-G-F-ED-C-B-E-F-G-AA-B-C-D-E-F-GG-D-E-A-B-C-Fb-1. What is the total flow time in the grinding department for the SPT sequence?Grinding total flow time             hoursb-2. What is the make-span for the seven jobs in both the grinding and de-burring departments (using the sequence found in part a)?Make-span             hoursc-1. Determine a sequence that will minimize the make-span in both departments.multiple choice 2C-B-A-F-E-D-GC-D-F-B-A-G-EA-B-C-D-E-F-GG-D-E-A-B-C-Fc-2. Does using the SPT rule in the grinding department result in smallest make-span?multiple choice 3YesNo