In a job-shop, there are three machines. Currently, there are three jobs waiting to be processed....

 

Transcribed Image Text:

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: 1,1,2 1,2,1 1,3,3 2,3,2 2,2,3 3,1,1 3,2,2 3,3,3/ D = 2,1,1 T = 4 6 3 5 7 4 2 4 7/ a) Use heuristic algorithm to determine the non-delay schedule. b) Draw Gantt chart for your best schedule. 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: 1,1,2 1,2,1 1,3,3 2,3,2 2,2,3 3,1,1 3,2,2 3,3,3/ D = 2,1,1 T = 4 6 3 5 7 4 2 4 7/ a) Use heuristic algorithm to determine the non-delay schedule. b) Draw Gantt chart for your best schedule.

Answer rating: 100% (QA)

To solve part a of this question we need to use a heuristic algorithm to determine the nondelay schedule for the given jobs and machines based on the job process order D matrix and the processing times T matrix The D matrix represents the order in which each job must be processed by the machines while the T matrix represents the time it takes for each job on each machine The entries in the D matrix such as 12 mean that the first operation of the job is on machine 1 the second operation is on machine 2 and so forth The heuristic algorithm typically involves choosing the jobmachine combination with the shortest processing time ... View the full answer