Operations Management
13th Edition
ISBN: 9781259667473
Author: William J Stevenson
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 16, Problem 10P
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.
a. Determine a sequence that will minimize makespan time.
b. Construct a chart of the resulting sequence, and 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?
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 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?
Develop a solution for the following line balancing problem, allowing a cycle time of 5 minutes.
Question: Balance this line using the longest task time heuristic.
Work Task
Task Time (seconds)
Task Predecessor(s)
A
70
-
B
60
A
C
120
B
D
60
-
E
240
C, D
F
100
A
G
190
E, F
A shoe repair operation uses a two-step sequence that all jobs in a certain category follow. Alljobs 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 andmakespan time be reduced?JOB TIMES (minutes)A B C D EWorkstation A 27 18 70 26 15Workstation B 45 33 30 24 10
Chapter 16 Solutions
Operations Management
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
- 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_forwardThe 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_forwardComplete the table; find average lateness, average completion time, and average number of jobs in the system. Assume all durations are in days and that the jobs are processed at the shop in the order that they arrive (A then B then C then D). Today is day 1. Job Process Time Flow Time Due Date Lateness A 15 30 B 3 9 C 12 22 D 15 40 Sum (Average) 45 (11.25) Avg. lateness = ? days Avg. completion time = ?? days Avg. number of jobs in the system = ? jobsarrow_forward
- Which job sequence would be used if ordered using the rule "Shortest Job First"? Group of answer choices a. 1,2,3,4 b. 4,3,1,2 c. 2,1,3,4 d. 2,3,4,1 e. 2,3,1,4arrow_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/computation. Thank you.arrow_forwardProcessing time for eight projects, displayed in the sequence they arrived. Project P1 P2 P3 P4 P5 P6 P7 P8 Processing time (hours) 3 1 1 2 9 6 1 1.50 2. Given the projects displayed in table above, if FCFS is used to sequence the jobs, what is the average flow rate of the projects? Note: Round your answer to 2 decimal places. 3. Given the projects displayed in table above, if FCFS is used to sequence the jobs, what is the average flow time of the projects? Note: Round your answer to 1 decimal place. 4. Given the projects displayed in table above, if FCFS is used to sequence the jobs, what is the average inventory of the projects? Note: Use your rounded answers from Parts 2 and 3. Round your answer to 1 decimal place. 5. Given the projects displayed in table above, if SPT is used to sequence the jobs, what is the average flow rate of the projects? Note: Round your answer to 2 decimal places. 6. Given the projects displayed in table above, if SPT is used to sequence…arrow_forward
- There are following seven jobs and they must pass through Machine 1 and Machine 2. Operating time for both the machines is shown below for each of the job: Job Operations Time for machine 1 Operations Time for machine 2 A 4 5 B 16 13 C 8 7 D 12 11 E 3 9 Schedule (job sequence and show the arrangement in diagram for machine 1 & 2) the seven jobs through two machines in sequence to minimize the flow time using Johnson’s rule. Find the job completion time. Find the slack time or idle time for machine 1 & 2 separately.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_forwardGiven the projects displayed in Table 18.21, if SPT is used to sequence the jobs, what isthe average flow time of the projects (in hours)?arrow_forward
- Given the following information on job times and due dates. Job Job Time(Hours) Due Date(Hours) a 3.5 7 b 2.0 6 c 4.5 18 d 5.0 22 e 2.5 4 f 6.0 20 a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Sequence for First come, first served Sequence for Shortest processing time Sequence for Earliest due date Sequence for Critical ratio a-2. For each method, find the average job flow time and the average job tardiness. (Round your answers to 2 decimal places.) First Come, FirstServed Shortest ProcessingTime Earliest Due Date Critical Ratio Average flow time Average job tardinessarrow_forwardGiven the projects displayed in Table 18.21, if FCFS is used to sequence the jobs, whatis the average flow time of the projects (in hours)?arrow_forwardGiven the jobs displayed in Table 18.17, if SPT is used to sequence the jobs, what is theflow time of job F (in minutes)?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