Using the information in Problem 24, develop a sequence based on the longest processing time priority rule.

Question:

Using the information in Problem 24, develop a sequence based on the longest processing time priority rule. Prioritize based on prep time. In the case of ties, select the house that has the longest paint time.

(a) Calculate the makespan.

(b) Calculate the mean job flow time associated with this sequence.

(c) Calculate the average number of jobs in the system with this sequence.


Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Operations Management

ISBN: 978-0470325049

4th edition

Authors: R. Dan Reid, Nada R. Sanders

Question Posted: