Question $1$: ISE $361$ SPRING $2023$ ASSIGNMENT DUE DATE: $13/06/202323$:$596$ jobs must be processed through the same machine center and they are labeled as A$,$ B$,$ C$,$ D$,$ E and F according to the order they entered the system. Assume the current time is $1$:$00$ P$.$M$.$ The following table shows the processing times and due dates for each job. JOB A B C D E F PROCESSING TIME $($in minutes$)253015503545($i$)$ FCFS $($ii$)$ SPT $($iii$)$ EDD $($iv$)$ CR $($v$)$ Moore's Algorithm DUE DATE $2$:$05$ P$.$M$.1$:$50$ P$.$M$.1$:$30$ P$.$M$.4$:$00$ P$.$M$.3$:$05$ P$.$M$.2$:$45$ P$.$M$.$ a$)$ Determine the sequences and compute mean flow time, average tardiness, maximum lateness, and the number of tardy jobs for b$)$ Which sequence you found in $($a$)$ would you use to satisfy the following objectives? $($i$)$ Minimize mean flow time $($ii$)$ Minimize average tardiness $($iii$)$ Minimize max lateness $($iv$)$ Minimize the number of tardy jobs $6$ jobs must be processed through the same machine center and they are labeled as A$,$ B$,$ C$,$ D$,$ E and F according to the order they entered the system. Assume the current time is $1$:$00$ P$.$M$.$ The following table shows the processing times and due dates for each job. a$)$ Determine the sequences and compute mean flow time, average tardiness, maximum lateness, and the number of tardy jobs for $($i$)$ FCFS $($ii$)$ SPT $($iii$)$ EDD $($iv$)$ CR $($v$)$ Moore's Algorithm b$)$ Which sequence you found in $($a$)$ would you use to satisfy the following objectives? $($i$)$ Minimize mean flow time $($ii$)$ Minimize average tardiness $($iii$)$ Minimize max lateness $($iv$)$ Minimize the number of tardy jobsQuestion $2$:

$6$ jobs must be processed through the same machine center and they are labeled as A$,$ B$,$ C$,$ D$,$ E$,$ and F according

to the order they entered the system. Assume the current time is $8$:$00$ A$.$M$.$ The following table shows the

processing times and due dates for each job.

a$)$ Determine the sequences and compute mean flow time, average tardiness, maximum lateness, and the

number of tardy jobs for

$($i$)$ FCFS

$($ii$)$ SPT

$($iii$)$ EDD

$($iv$)CR$

$($v$)$ Moore's Algorithm

b$)$ Which sequence you found in $($a$)$ would you use to satisfy the following objectives?

$($i$)$ Minimize mean flow time

$($ii$)$ Minimize average tardiness

$($iii$)$ Minimize max lateness

$($iv$)$ Minimize the number of tardy jobs

Please use $2-$digits after decimal point in vour calculations.