2. In a job-shop, there are three machines. Currently, there are three jobs waiting to be processed. Their process description matrix and processing time (in hours) matrix are as follows: D=1,1,22,1,13,1,11,2,12,2,33,2,21,3,32,3,23,3,3T=452674347 a) Use heuristic algorithm to determine the non-delay schedule. b) Draw Gantt chart for your best schedule