Operations Management
11th Edition
ISBN: 9780132921145
Author: Jay Heizer
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 9DQ
Summary Introduction
To determine: The best situation to apply the Johnson’s rule of job shop
Introduction: Scheduling is the process of controlling and arranging the workloads of the production process using the optimized way. It is used to plan the allocation of human resources and machinery.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
QUESTION 5 (SCHEDULING: CYCLICAL SCHEDULING)
15.26 Daniel's Barber Shop at Newark Airport is open
7 days a week but has fluctuating demand. Daniel Ball is inter-
ested in treating his barbers as well as he can with steady work
and preferably 5 days of work with two consecutive days off.
His analysis of his staffing needs resulted in the following plan.
Schedule Daniel's staff with the minimum number of barbers.
DAY
MON. TUE. WED. THU. FRI. SAT. SUN.
6
5
5
5
6
4
3
Barbers
needed
Question one:
Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are
representative, compare between FCFS and other scheduling rules should the radiology department be using and why
Processing Time
(Minutes)
Due Time (Minutes
from Now)
Patient
A
35
140
B
15
180
35
360
D
25
290
E
30
420
F
25
20
G
35
180
H
30
290
20
110
K
25
150
L
15
270
M
30
390
20
220
20
400
P
10
330
Q
10
80
R
15
230
20
370
Finite capacity scheduling
Question 20 options:
schedules jobs through a number of work centers, each with one or more machines.
All of these choices are correct.
is an extension of the theory of constraints.
requires that jobs are scheduled whole (cannot be split).
Chapter 15 Solutions
Operations Management
Ch. 15 - Prob. 1DQCh. 15 - Prob. 2DQCh. 15 - Prob. 3DQCh. 15 - Prob. 4DQCh. 15 - Prob. 5DQCh. 15 - Prob. 6DQCh. 15 - Prob. 7DQCh. 15 - Prob. 8DQCh. 15 - Prob. 9DQCh. 15 - Prob. 10DQ
Ch. 15 - Prob. 11DQCh. 15 - Prob. 12DQCh. 15 - Prob. 13DQCh. 15 - Prob. 1PCh. 15 - Prob. 2PCh. 15 - Prob. 3PCh. 15 - Prob. 4PCh. 15 - Prob. 5PCh. 15 - Prob. 6PCh. 15 - Prob. 7PCh. 15 - Prob. 8PCh. 15 - Prob. 9PCh. 15 - Prob. 10PCh. 15 - Prob. 11PCh. 15 - Prob. 12PCh. 15 - Prob. 13PCh. 15 - Prob. 14PCh. 15 - Prob. 15PCh. 15 - Prob. 16PCh. 15 - Prob. 17PCh. 15 - Prob. 18PCh. 15 - Prob. 19PCh. 15 - Prob. 20PCh. 15 - Prob. 21PCh. 15 - Prob. 1CSCh. 15 - Prob. 2CSCh. 15 - Prob. 3CSCh. 15 - Prob. 4CSCh. 15 - Prob. 1.1VCCh. 15 - Prob. 1.2VCCh. 15 - Prob. 1.3VCCh. 15 - Prob. 1EDCh. 15 - Prob. 2.1VCCh. 15 - Prob. 2.2VCCh. 15 - Prob. 2.3VCCh. 15 - Prob. 2.4VC
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
- Question one: Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are representative, compare between FCFS and other scheduling rules should the radiology department be using and why Processing Time (Minutes) Due Time (Minutes from Now) Patient A 35 140 B 180 15 35 360 25 290 E 30 420 25 20 G 35 80 30 290 20 110 K 25 15 150 270 M 30 390 20 220 20 400 10 330 10 80 R 15 230 20 370 当 五犯 LEzlolalolclnarrow_forwardQuestion 1 Four floral arranging jobs are to be carried out across three stations: A (Arrange), B (Bag), C (crop) shown. The station sequences and job times in minutes are shown below, along with the due dates for each job. Using an "earliest due date" job dispatching priority rule, which, if any, of the jobs in will be late? Tip: create a Gantt chart schedule before answering Questions 4 & 5. a. Jobs 2 & 3 b. Jobs 3 & 4 c. Job 3 d. Job 4 e. None of the jobs will be latearrow_forwardQ. 3 What is the total makespan from Question 1? Question 1: Four floral arranging jobs are to be carried out across three stations: A (Arrange), B (Bag), C (crop) shown. The station sequences and job times in minutes are shown below, along with the due dates for each job. Using an "earliest due date" job dispatching priority rule, which, if any, of the jobs in will be late? Answer was Job 4 Group of answer choices a. 100 b. 130 c. 150 d. 170 e. 200arrow_forward
- Question 34 Consider the processing times and priorities for four jobs: Job Processing time (minutes) Weight/Priority (cost per minute) A 10 6 B 2 1 C 50 2 D 16 10 Assume the weighted shortest processing time (WSPT) rule is used. Which job should be processed third? Group of answer choices A B C Darrow_forwardQuestion fourThree 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 B1 5 42 7 73 3 5Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.arrow_forwardQuestion four 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 1 4 2 7 7 3 3 Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.arrow_forward
- QUESTION 4 (SCHEDULING: JOHNSON'S RULE) The following schedule was prepared by the production manager of Marymount Metal Shop: Determine a schedule that will result in the earliest completion of all jobs on this list. CUTTING POLISHING Job ABCDEFG (ii) (iii) (iv) Start 0 2 6 11 15 17 20 Finish 2 6 11 15 17 20 21 Start 2615232 11 20 24 Finish 5 9 13 20 23 24 28 What is the optimal sequence? Draw the time-phased chart. What is the total completion time? What is the total idle time at Polishing work centre?arrow_forwardQUESTION 5 A schedule for two processors has been created for the following project which has a finishing time of 30. A(6) B(11) Start C(1) F(5) G(4) D(9) FO ● H(5) E(8) ● Which is the following statements is applicable to the schedule? O A. The schedule is optimal because the finishing time is equal to the critical time. O B. The schedule is optimal because the finishing time is equal to the average time. End ● O C. The schedule is not optimal because the finishing time is greater than the critical time. O D. The schedule is not optimal because the finishing time is greater than the average time. O E. The schedule is not optimal because the finishing time is greater than both the average time and the critical time. O F. The schedule is optimal because the finishing time is less than the critical time. O G. The schedule is optimal because the finishing time is less than the average time. OH. The schedule is not optimal because the finishing time is less than the critical time. OI. The…arrow_forwardQUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (ii) Illustrate the flow (throughput) times to complete the baking and decorating on atimeline chart.arrow_forward
- QUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (i) Using Johnson’s Rule, determine the optimum sequence for processing the cake joborders through the baking and decorating stages.arrow_forwardQuestion 4: Six jobs waiting at a workstation will be processed in order, starting with the one with the shortest break time. In the table below, the time elapsed since the arrival of the works, the time remaining to the delivery and the processing time are given. According to this, create the work order and fill in the data in the relevant table.(fill in the second table in the photos)a) What is the average delay time with the generated order?b) How many hours is the average flow time?c) How many jobs will be delayed?d) How many jobs will not be delayed?arrow_forwardQuestion atatchedarrow_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.