Homework Help is Here – Start Your Trial Now!
Business
Operations Management
7. The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year. The provost has decided that the best way to take a first cut at all these applications is by employing a line process. The following table shows the times and predecessors for the various tasks: TASK TIME (MINUTES) IMMEDIATE PREDECESSOR ABCDEFI G H 1.2 1 0.65 1.1 1.3 0.7 0.8 0.9 None A B B CDDF с D E, F, G a. (**) Draw a precedence diagram for the tasks. Suppose the university needs to process 30 applications an hour during the peak season. What is the takt time? What is the theoretical minimum number of workstations? b. (**) Develop workstation assignments by using the "largest eligible task" rule. c. (**) How many workstations does your solution require? What is the cycle time for the line? What is the idle time? What are the percent idle time and the effi- ciency delay?

7. The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year. The provost has decided that the best way to take a first cut at all these applications is by employing a line process. The following table shows the times and predecessors for the various tasks: TASK TIME (MINUTES) IMMEDIATE PREDECESSOR ABCDEFI G H 1.2 1 0.65 1.1 1.3 0.7 0.8 0.9 None A B B CDDF с D E, F, G a. (**) Draw a precedence diagram for the tasks. Suppose the university needs to process 30 applications an hour during the peak season. What is the takt time? What is the theoretical minimum number of workstations? b. (**) Develop workstation assignments by using the "largest eligible task" rule. c. (**) How many workstations does your solution require? What is the cycle time for the line? What is the idle time? What are the percent idle time and the effi- ciency delay?

Practical Management Science
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
See similar textbooks
icon
Related questions
Question
7. The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year. The provost has decided that the best way to take a first cut at all these applications is by employing a line process. The following table shows the times and predecessors for the various tasks: TASK TIME (MINUTES) IMMEDIATE PREDECESSOR ABCDEF I A с G H 1.2 1 0.65 1.1 1.3 0.7 0.8 0.9 None A BBUD с D E, F, G a. (**) Draw a precedence diagram for the tasks. Suppose the university needs to process 30 applications an hour during the peak season. What is the takt time? What is the theoretical minimum number of workstations? b. (**) Develop workstation assignments by using the "largest eligible task" rule. c. (**) How many workstations does your solution require? What is the cycle time for the line? What is the idle time? What are the percent idle time and the effi- ciency delay? d. (***) In theory, what is the fastest cycle time possible, given the tasks listed above? How many applications per hour does this translate into?
Transcribed Image Text:7. The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year. The provost has decided that the best way to take a first cut at all these applications is by employing a line process. The following table shows the times and predecessors for the various tasks: TASK TIME (MINUTES) IMMEDIATE PREDECESSOR ABCDEF I A с G H 1.2 1 0.65 1.1 1.3 0.7 0.8 0.9 None A BBUD с D E, F, G a. (**) Draw a precedence diagram for the tasks. Suppose the university needs to process 30 applications an hour during the peak season. What is the takt time? What is the theoretical minimum number of workstations? b. (**) Develop workstation assignments by using the "largest eligible task" rule. c. (**) How many workstations does your solution require? What is the cycle time for the line? What is the idle time? What are the percent idle time and the effi- ciency delay? d. (***) In theory, what is the fastest cycle time possible, given the tasks listed above? How many applications per hour does this translate into?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 7 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.
SEE MORE TEXTBOOKS