A pure flow shop has three machines and all the jobs visit these machines. The processing time of…

A pure flow shop has three machines and all
the jobs visit these machines. The processing time of each job in each machine
is given in Table 18.15.

Don't use plagiarized sources. Get Your Custom Essay on
A pure flow shop has three machines and all the jobs visit these machines. The processing time of…
For as low as $7/Page
Order Essay

(a) Use the SPT rule to schedule the jobs
in the flow shop and draw a Gantt chart for the schedule.

(b) Compare the performance of the SPT rule
with the EDD rule using the following performance criteria:

i. Mean tardiness

ii. Mean flow time

iii. Number of tardy jobs

iv. Make span

(c) Compute the utilization of the three
machines for both the schedules.

(Hint: Convert it into a two machine
problem. First alternative is to combine processing times of m/c1 and m/c2 into
a single equivalent machine. Alternative 2 is to combine the processing times
m/ c2 and m/c3. Solve using Johnsons rule and choose the best alternative)

Leave a Reply

Your email address will not be published. Required fields are marked *

*

*

*