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 12P
A shoe repair operation uses a two-step sequence that all jobs in a certain category follow. All jobs can be split in half at both stations. For the group of jobs listed:
a. Find the sequence that will minimize total completion time.
b. Determine the amount of idle time for workstation B.
c. What jobs are candidates for splitting? Why? If they were split, how much would idle time and makespan time be reduced?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The 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 11
Six jobs are to be processed through a two-step opera- tion. The first operation involves sanding, and the second involves painting. Processing times are as follows: JOB OPERATION 1 (HOURS) OPERATION 2 (HOURS) A 10 5 B7 4 C5 7 D3 8 E2 6 F4 3 Determine a sequence that will minimize the total completion time for these jobs. Illustrate graphically.
The times required to complete each of eight jobs in a two-machine flow shop are shown in the table that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.
TIME (hours)
Job
Machine A
Machine B
a
16
5
b
3
13
c
8
7
d
9
6
e
2
14
f
14
4
g
18
14
h
20
11
Find machine B’s idle time
For the sequence determined in part a, how much would machine B's idle time be reduced by splitting the last two jobs in half?
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
- The Mowry Machine Shop still has five jobs to be processedas of 8 a.m. today (day 23) at its bottleneck operation. The daywhen the order arrived, processing time, and promised duedates are given in the following table. The jobs are listed inthe order of arrival.a. Develop separate schedules by using the FCFS and EDDrules. Compare the schedules on the basis of averageflow time and average days past due.b. Which rule gives the best schedule, in your judgment?Why?arrow_forwardAssign the 4 departments in Table X to locations A, B, C, and D, which are separated by the distances shown in Table y, in such a way that transportation cost is minimized. Use this heuristic: assign departments with the greatest interdepartmental workflow first. See attached tables.arrow_forwardThe following set of seven jobs is to be processed through two work centers at George Heinrich’s printing company. The sequence is first printing, then binding.Processing time at each of the work centers is shown in thefollowing table: a) What is the optimal sequence for these jobs to bescheduled?b) Chart these jobs through the two work centers.c) What is the total length of time of this optimal solution?d) What is the idle time in the binding shop, given the optimal solution?e) How much would the binding machine’s idle time be cutby splitting Job Z in half?arrow_forward
- Six jobs must be processed through machine A and then machine B as shown below. The processing time for each job is also shown.a. Develop a Gantt chart to determine the total time required to process all six jobs. Use the following sequence of jobs: 1, 2, 3, 4, 5, 6.b. Can you develop a better sequence to reduce the total time required for processing?arrow_forwardA manufacturer is designing a product layout for a new product productionIt plans to use a production line for 8 hours per day in order to meet forecasted demand of 70 units per day. The product requires 7 tasks in total. These tasks are namelyABC, D, E, F, and Grespectively. Task A does not have any predecessor to startTo start Task B.it requires Task A to be completedStarting tasks needs, the task B to be completed. Also, starting task Dneeded 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 Fto be completed. The processing times for tasks, ABC, D. E. and G are 2.8, 2.1, 0.9, 1.0, 1.2, 1.8 and 4.7 minutes respectively. What should be the cycle time in minutes? a 4.7 b. None is the correct answer Oc 7.5 d6.86 e.arrow_forwardAt 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_forward
- The following five jobs, along with their processing time and due dates, are given below. Processing Days Due Job Time (days) From Today A 8 12 B 4 9 C 3 6 D 7 7 E 5 20 a. Use the Shortest Processing Time Rule (SPT), determine new sequence and determine the average flow-time for the five jobs b. Use the Earliest Due Date Rule (EDD), determine new sequence, and determine the average tardiness.arrow_forwardGiven the operation times provided: Develop a job sequence that minimizes idle time at the two work centers. b. Construct a chart of the activities at the two centers, and determine each one’s idle time, assuming no other activities are involvedarrow_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_forward
- 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 90 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 needs the task 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 28.2.1,0.9, 10, 1.2.1.8 are 4.7 minutes respectively. How many minimum numbers of workstations are needed? a. 1 b. 6 c. None is correct d. 3 e. 5 please I neef answer along with the formula don't put it on excelarrow_forwardSeven jobs are to be processed through a single machine. The processing times anddue dates are given here.Job 1 2 3 4 5 6 7Processing time 3 6 8 4 2 1 7Due date 4 8 12 15 11 25 21Determine the sequence of the jobs in order to minimizea. Mean flow time.b. Number of tardy jobs.c. Maximum lateness.d. What is the makespan for any sequence?arrow_forwardGiven the following data for the processing time in hours for each Job in eachMachine, determine the following:a. Optimal job flow sequenceb. Total span time and idle timeNeed answer asap. Please include the solution/formula. Thank youarrow_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