Question 1 Run Scenario 1 with 40 policies in process (WIP = 40), 10 at each workstation. Watch the red policy as it goes through the system. What is the turnaround time (TAT) (round to the nearest hour)? Question 2 What would the TAT be in Scenario 1 if there were 240 units in the system initially (round to the nearest hour)? Question 3 Suppose you walk into a similar organization as Scenario 1 that has a 15-step process running at steady state. You count total WIP of 720 units and are told that the slowest workstation (bottleneck) has a task time of 5.0 minutes. What is your estimate of the turnaround time for the whole process, in hours? Question 4 Before the floater is assigned in Scenario 2, where is the bottleneck in this process? (a = Workstation 1, b = Workstation 2, c = Workstation 3, d = Workstation 4) Question 5 If the floater is assigned full-time to the bottleneck workstation in Scenario 2, what is the resulting new average task time for that workstation (in minutes)?
Added by Darrell P.
Close
Step 1
### Question 1: Run Scenario with 40 policies Process (WIP 40). 10 at each workstation. Watch the red policy as it goes through the system: What is the turnaround time (TAT) (round to the nearest hour)? Show more…
Show all steps
Your feedback will help us improve your experience
Dominador Tan and 81 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Shown below are the tasks, times, and precedence requirements for the work required to assemble a copier machine. Production time per day = 480 minutes. Desired output per day = 40 units. 1. What's the cycle time for this production line? 2. What's the theoretical minimum number of workstations that should be set up? 3. List the paths for this problem. 4. Draw the precedence diagram for this problem. 5. How many workstations should be set up in this production line? 6. Which tasks should be performed in each workstation? 7. Draw the diagram of the production line. 8. Calculate the efficiency of the production line. Note: You may use either clustering or heuristics in assigning tasks to workstations.
Sri K.
Five batch jobs, A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4, and 8 minutes. Their (externally determined) priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the average process waiting time. Ignore process switching overhead. a. Round robin b. Priority scheduling c. First-come, first-served (run in order 10, 6, 2, 4, 8) d. Shortest job first For (a), assume that the system is multiprogrammed, and that each job gets its fair share of the CPU with a quantum of 4. For (b) through (d), assume that only one job at a time runs until it finishes. All jobs are completely CPU bound.
Madhur L.
Aggregate Planning Approaches Linear Programming Models Product mix planning Basic model Model Maximize Σ Σ (riSit - hiIit) Revenue - Inventory carrying cost subject to dit ≤ Sit ≤ dit for all i, t Lower and upper bounds on sales Σ aijXit ≤ cjt for all j, t Capacity constraint (for each workstation in each period) Iit = Ii,t-1 + Xit - Sit for all i, t Inventory balance constraints (multiproduct types version) Xit, Sit, Iit ≥ 0 for all i, t Information from the LP model Product mix (Xit) Demand feasibility: Determine whether a set of demand is capacity-feasible Bottleneck locations: Determine which workstations limit capacity in which periods (Bottlenecks require close management attention.)
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD
