Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Now we find the optimum sequence of the 6 jobs in two machines H and Kas usual in the following tables J4 J4 J4 J4

image text in transcribed
image text in transcribed

Now we find the optimum sequence of the 6 jobs in two machines H and Kas usual in the following tables J4 J4 J4 J4 3 3 J3 Job seq J J J6 J 16 J3 J J6 J2 Js Jz Hence the optimal sequencing is J 13 1 16 12 15 Table to find minimum elapsed time Js Total M Time in Time out J5 Js out 0 2 2 8 7 10 12 10 21 21 21 33 33 33 42 42 17 8 2 7 M Time in Time 37 45 M3 Idle Idle time time M M3 Time in Time out 8 8 20 2 12 20 29 20 29 42 22 42 55 1 39 55 69 11 69 77 3 Minimum total elapsed time 77 Hrs Idle time for M 77 42 35 Idle time for M 17 77 45 17 32 49 8 0 0 0 0 0

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Precalculus

Authors: Ron Larson, Scott T Meier

8th Edition

1111787379, 9781111787370

More Books

Students also viewed these Mathematics questions