Problem #1 (Transportation) – 30 points (15 points each)
Chapter 6
■ Problem 11 – balanced (12th Edition)
■ Problem 8 – unbalanced (12th Edition)
Problem #2 (Network Flow Models- Shortest Route (All Nodes)) – 20 points
Computer or manual “permanent set” method
Chapter 7
■ Problem 8 - 12th Edition – Shortest Route
■ Must have final Network Solution listed or by illustrated node/branch diagram
Problem #3 (Network Flow Models- Minimal Spanning) – 30 points
Computer or manual “permanent set” method
Chapter 7
■ Computer or manual method
■ Must have final Network Solution listed or by diagram
■ Problem 22 – 12th Edition - Minimal Spanning
■ At $1,000 per mile of piping, what is the total cost of the project based on your solution?
■ At $1,000 per mile of piping, what is the total cost avoidance of the project? (based on the amount of piping not used)
Problem #4 (Queuing Analysis – Single server Model) –20 points
Chapter 13
■ You can use manual math formulas or by computer solution
■ Each basic single-server queuing formula must be explained
■ Scenario: I own a bike repair shop. The arrival and service rates to service a customer’s bicycle, on average, are as follows:
= 6 bicycles per day (based on an 8 hour day)
= 9 bicycles per day (based on an 8 hour day)
1 = # of servers
Based on a first-come-first-serve queue discipline, define Po, P4 , L, Lq, W, Wq, U, and I
Sample Solution