The scenario below depicts a Job Shop with 3 machines and 3 Jobs. Each Job has 3 sub-tasks to be accomplished in each of the machines respectively. None of the Jobs have any ready times. Our objective here is to minimize the MAKESPAN.

	Name	Job	Processing Time	Machine
Task 1:	Pink	4.26	1
Task 2:	Pink	2.6	2
Task 3:	Pink	4.24	3
Task 4:	Purple	3	1
Task 5:	Purple	1.2	2
Task 6:	Purple	2.04	3
Task 7:	Green	4.44	1
Task 8:	Green	2.96	2
Task 9:	Green	4.24	3