OPERATIONS MANAGEMENT W/ CNCT+
12th Edition
ISBN: 9781259574931
Author: Stevenson
Publisher: MCG CUSTOM
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 16, Problem 14P
The
a. Prepare a
b. What is the flow time in the grinding department for the SPT sequence? What is the total time needed to process the seven jobs in both the grinding and deburring departments?
c. Determine a sequence that will minimize the total time needed to process the jobs in both departments. What flow time will result for the grinding department?
d. Discuss the trade-offs between the two alternative sequencing arrangements. At what point would the production manager be indifferent concerning the choice of sequences?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Five jobs must be scheduled for batch processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listedhere.Job 1 2 3 4 5Processing time 40 min 2.5 hr 20 min 4 hr 1.5 hrPromised time 11:00 A.M. 2:00 P.M. 2:00 P.M. 1:00 P.M. 4:00 P.M.Assume that the current time is 10:00 A.M.a. If the jobs are scheduled according to SPT, find the tardiness of each job and themean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD scheduling
Use the assignment method to obtain a plan that will minimize the processing costs inthefollowing table under the following conditions:
a. The combination 2-D is undesirable.
b. The combinations 1-A and 2-D are undesirable.
A manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order
to meet forecasted demand of 100 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and G
respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks C needs, the
task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C. Whereas
starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing
times for tasks, A, B, C, D, E, F, and G are 2.8, 2.1,0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. Applying the most following tasks rule for
balancing the assembly line, with ties broken according to longest task tíme first. What will be the idle time for the FOURTH Workstation?
Select one:
O a 20
O 6.0.1…
Chapter 16 Solutions
OPERATIONS MANAGEMENT W/ CNCT+
Ch. 16 - Why is scheduling fairly simple for repetitive...Ch. 16 - Prob. 2DRQCh. 16 - What are Gantt charts? How are they used in...Ch. 16 - Prob. 4DRQCh. 16 - Briefly describe each of these priority rules: a....Ch. 16 - Why are priority rules needed?Ch. 16 - What problems not generally found in manufacturing...Ch. 16 - Explain forward and backward schedulings and each...Ch. 16 - Prob. 9DRQCh. 16 - Prob. 10DRQ
Ch. 16 - Prob. 11DRQCh. 16 - What general trade-offs are involved in sequencing...Ch. 16 - Prob. 2TSCh. 16 - Prob. 3TSCh. 16 - One approach that can be effective in reducing the...Ch. 16 - Doctors and dentists offices frequently schedule...Ch. 16 - Prob. 3CTECh. 16 - Use the assignment method to determine the best...Ch. 16 - Rework Problem 1, treating the numbers in the...Ch. 16 - Assign trucks to delivery routes so that total...Ch. 16 - Develop an assignment plan that will minimize...Ch. 16 - Use the assignment method to obtain a plan that...Ch. 16 - The following table contains information...Ch. 16 - Using the information presented in the following...Ch. 16 - The following table shows orders to be processed...Ch. 16 - A wholesale grocery distribution center uses a...Ch. 16 - The times required to complete each of eight jobs...Ch. 16 - Prob. 11PCh. 16 - A shoe repair operation uses a two-step sequence...Ch. 16 - The following schedule was prepared by the...Ch. 16 - The production manager must determine the...Ch. 16 - A foreman has determined processing times at a...Ch. 16 - Given the information in the following table,...Ch. 16 - Given the following information on job times and...Ch. 16 - Prob. 18PCh. 16 - The following table contains order-dependent setup...Ch. 16 - The following table contains order-dependent setup...Ch. 16 - Prob. 21PCh. 16 - Given this information on planned and actual...Ch. 16 - Given the following data on inputs and outputs at...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Prob. 1CQ
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- A manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 100 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks C needs, the task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A, B, C, D, E, F, and G are 2.8, 2.1, 0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. Applying the most following tasks rule for balancing the assembly line with ties broken according to longest task time first, the tasks that will be assigned to the SECOND workstation are: a. B,C and D b. C…arrow_forwardA manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 100 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks C needs, the task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A, B, C, D, E, F, and Gare 2.8, 2.1,0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. How many minimum numbers of workstations are needed? Select one: O a.2 O b. None is the correct answer O c.6 O d. 8 O e. 4arrow_forwardFive jobs must be scheduled for batch processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listed here. (given) Assume that the current time is 10:00 A.M.a. If the jobs are scheduled according to SPT, find the tardiness of each job and the mean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD scheduling.arrow_forward
- At the campus copy shop, six jobs have arrived in the order shown (A, B, C, D, E, and F) at the beginning of the day 1 (today, which is a work day). All of the jobs are due at various times today. Your job is to evaluate four common sequencing rules. JOB DUE (IN HOURS) DURATION (HOURS REQUIRED) A 8 (this job is due in 8 hours) 1.65 B 5.5 (this job is due in 5.5 hours) 1.20 C 4.5 (this job is due after lunch in 4.5 hours) 0.85 D 6 (this job is due in 6…arrow_forwardA manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 80 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks C needs, the task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A, B, C, D, E, F, and Gare 2.8, 2.1,0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. How many minimum numbers of workstations are needed? Select one: a. None is the correct answer b. 5 C. 6 d. 3 e. 1arrow_forwardThe times required to complete each of eight jobs in a two-machine flow shop are shown in thetable that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.a. Determine a sequence that will minimize makespan time.b. Construct a chart of the resulting sequence, and find machine B’s idle time. c. For the sequence determined in part a, how much would machine B’s idle time be reduced bysplitting the last two jobs in half?TIME (hours)Job Machine A Machine Ba 16 5b 3 13c 9 6d 8 7e 2 14f 12 4g 18 14h 20 11arrow_forward
- Three jobs are to be scheduled on two machines A and B. Assume that the jobs are processed in the sequence A-B (A has to finish the job before B can continue the job). The processing times are: Job A B 1 5 4 2 7 7 3 3 5 Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.arrow_forwardA manutacturer is designing a product layout for a new product production. It plans to use a production line for B hours per day in order to meet forecasted demand of 100 units per day. The product requires 7 lasks in total. These tasks are namely, A, 8, CD, E, F, and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed Starting tasks Cneeds, the tack B to be completed. Also, starting task D needed task B to be completed Task E can only start upon completion of Task C. Whescas starting lask F needs the completion of both the tasks D and E Finally, starting task G needed, task Fto be completed. 1the processing times for tasks, A BC D, E F, andG are 28, 2.1, 0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. Applying the most following tasks nule for balancing the assembly line, with ties broken according to longest task time first, the tasks that will be assigned to the FIRST workstation are Select one OaAB, and C ODAB Oc None…arrow_forwardA mortgage service office has the following four activities involved in approving a loan application. Note that a working day is 8 hours and there are 60 minutes in one hour. Activity Time (minutes) A. Property survey 24 B. Credit report 19 C. Title search 18 D. Final decision 20 The office has three employees, activities A, B and C are combined together and assigned to two employees, while the other employee is responsible for the last activity D. Under this setting, what would be the maximum number of loan applications the office can process per day? Numbers only, keep three decimals if not exact, either round up or down is okarrow_forward
- The constraints governing the jobs are as fo1lows: A and B are start jobs; A controls C, D and E; B controls F and J; G depends upon C; H depends on D; E and F control I and L; K follows J; L is also controlled by K; G, H, I and L are the last jobs. Draw the network,arrow_forwardThree jobs are to be scheduled on two machines A & B . Assume that the jobs are processed in the Sequence A-B. The processing times are : The Question is : Draw a Gantt Chart that shows the Schedule Corresponding to the sequences 1-2-3 of the jobs Job A B 1 5 4 2 7 7 3 3 5arrow_forwardDe Law Construction has a gotten some construction jobs to build some starter housing units in a few areas. The building time for each housing unit to be completed as well as the date that each unit is to be completed is shown in the table below. Today is Day 471. Which of the sequences, EDD OR SPT should the company use to sequence the order in which they do the jobs, assuming that because of resource constraints it cannot do the jobs simultaneously? HOUSING UNIT Building Time (days) Due Date Marabella 39 Day 502 Tabaquite 23 Day 528 San Juan 30 Day 515 Mayaro 33 Day 498 D’Abadie 41 Day 535 Preysal 40 Day 510 Some time after starting the jobs according to the sequence you decided on, it was found that because of inclement weather the last three housing units in the sequence have been delayed. You now have to prioritise and decide in which order to expedite those three jobs, using the Critical Ratio model. It is now…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
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...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY