Consider the example of no name computers presented in this


Question: Consider the example of No name computers presented in this section.

a. What is the minimum cycle time that is possible? What is the minimum number of stations that would theoretically be required to achieve this cycle time?

b. Based on the ranked positional weight technique, how many stations are actually required for the cycle time indicated in part (a)?

c. Suppose that the owner of the company that sells No name computers finds that he is receiving orders for approximately 100 computers per day. How many separate assembly lines are required assuming

(i) the best five-station balance,

(ii) the best six-station balance (both determined in the text), and

(iii) the balance you obtained in part

(b) Discuss the trade-offs involved with each choice.

Request for Solution File

Ask an Expert for Answer!!
Data Structure & Algorithms: Consider the example of no name computers presented in this
Reference No:- TGS02265047

Expected delivery within 24 Hours