Clicking on a random permutation to solve the problem yields us a Tardiness of 10.28.

The order of operation would be Job 1 on Machine 2, Job 5 on Machine 2, Job 4 on Machine 1, followed by Job 2 on Machine 2 and then Job 3 on Machine 1.

	Name	length	readytime	due date	Weight
Job 1	1	1.4	9.48	4
Job 2	3.4	2	9	4
Job 3	3.88	2	6	3
Job 4	5	5	11	4
Job 5	5	3	10	1

Now let's try a different algorithm. Say List Scheduling by Weighted Shortest Processing Time: