As you can see, Johnson's algorithm gives a solution of 112.7 units.

While this is obviously not the optimal (worse than List Scheduling by Shortest Processing Time which gave us a solution of 97.3 units) its still considerably better than a random permutation which gave us 133 units!

	Name	Job	Processing Time	Ready Time	Machine
Task 1:	Brown	3.6	.875	1
Task 2:	Brown	2.4	.875	2
Task 3:	Brown	4.25	.875	3
Task 4:	Greeen	2	4.83	1
Task 5:	Green	4.08	4.83	2
Task 6:	Green	4.21	4.83	3
Task 7:	Beige	1.6	4.38	1
Task 8:	Beige	2.6	4.38	2
Task 9:	Beige	4.0	4.38	3