Applied Statistics and Probability for Engineers, 6th Edition
Authors: Douglas C. Montgomery, George C. Runger
ISBN-13: 978-1118539712
See our solution for Question 39E from Chapter 2 from Applied Statistics and Probability for Engineers by Montgomery.
Problem 39E
Chapter:
Problem:
Step-by-Step Solution
Given Information
A manufacturing process consists of 10 operations.
Five machining operations must be completed before any of the remaining five assembly operations can begin. Within each set of five, operations can be completed in any order.
Step-2: Possible Number of combinations
Number of ways of arranging N items out of given N items is called permutation. The total number of permutations of First 5 machining operation is \[{S_1} = 5!\]The total number of permutations of last 5 machining operation is \[{S_2} = 5!\]Total number of operations are \[\begin{array}{l}{S_1} = 5!\\\\S = {S_1} \times {S_2}\\\\S = 5! \times 5!\\\\\boxed{S = 1440}\end{array}\]
A manufacturing process consists of 10 operations.
Five machining operations must be completed before any of the remaining five assembly operations can begin. Within each set of five, operations can be completed in any order.
Step-2: Possible Number of combinations
Number of ways of arranging N items out of given N items is called permutation. The total number of permutations of First 5 machining operation is \[{S_1} = 5!\]The total number of permutations of last 5 machining operation is \[{S_2} = 5!\]Total number of operations are \[\begin{array}{l}{S_1} = 5!\\\\S = {S_1} \times {S_2}\\\\S = 5! \times 5!\\\\\boxed{S = 1440}\end{array}\]