find the sequence which minimizes the makespan for this two serial machine problem.

Show all your work in the excel spreadsheet for full credit

processing time at

Jobs	M1	M2	due dates
A	5	4	10
B	3	4	11
C	1	2	6
D	3	1	13
E	2	3	9

continuation of question -

find the sequence which minimize the makespan for this two serial machine problem.

Provide the name of the algorithm/heuristic that worked best in this example.

-continuation question

find the sequence which minimizes the makespan for this two serial problem.

Why is this algorithm or heuristics applicable?

Continuation of Question-

Find the sequence which minimizes the makespan for this two serial machine problem.

Explain the logic of the algorithm in brief