Consider a three-machine four-job routes with the following data: Job Routing-machine/processing time in hours 1 A/10 B/6
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider a three-machine four-job routes with the following data:
Job | Routing-machine/processing time in hours | |||
1 | A/10 | B/6 | C/10 | B/8 |
2 | A/6 | C/10 | B/8 | |
3 | C/10 | B/4 | A/4 | C/8 |
4 | B/6 | A/10 |
All jobs are released at time 0. Develop the schedule generated using the least work remaining rule* for selecting jobs to process. Use only jobs currently in queue at the machine when making scheduling selections. Construct a Gantt chart and compute the make-span for the schedule.
*Gives priority to the job that has the least work remaining to complete the job.
Related Book For
Posted Date: