OPERATIONS MGMT(LOOSELEAF)W/MYOMLAB>IC
16th Edition
ISBN: 9781323153123
Author: HEIZER
Publisher: PEARSON C
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 21P
Summary Introduction
To determine: Theschedule jobs using critical ratio.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Question:-M
Full explain this question and text typing work only.
Question Three
Processing times (including setup times), and due dates for five jobs waiting to be processed at a work center are given in the following table. By Using the SPT rule determine the following:
The sequence of jobs
The average flow time
The average job tardiness
The average number of jobs at the work center
Job
Processing Time (hours)
Hour Due
A
17
15
B
10
25
C
5
20
D
7
32
E
11
38
Question 35
Consider the processing times and due dates of the following jobs:
Job
Processing time
(days)
Due date
(days)
1
3
29
2
19
25
3
24
40
4
8
20
What is the average lateness if the earliest due date (EDD) is used to sequence the jobs?
Group of answer choices
0.75
1.25
4.25
5.67
Chapter 15 Solutions
OPERATIONS MGMT(LOOSELEAF)W/MYOMLAB>IC
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. 15PCh. 15 - Prob. 16PCh. 15 - Prob. 17PCh. 15 - Prob. 18PCh. 15 - Prob. 19PCh. 15 - Prob. 20PCh. 15 - Prob. 21PCh. 15 - Prob. 22PCh. 15 - Prob. 23PCh. 15 - Prob. 26PCh. 15 - Prob. 27PCh. 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. 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 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_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 (i) Using Johnson’s Rule, determine the optimum sequence for processing the cake joborders through the baking and decorating stages.arrow_forwardQuestion 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_forward
- Question 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_forwardQuestion3: Two processes are applied in the same order to the jobs coming to a workstation. The durations of both processes for the six jobs coming to the workstation are as seen in the table. In order to minimize the total time to be spent on the jobs, the order in which the jobs should be done will be determined by the "johnson" rule. Accordingly, in the table below, write the order in which the business should do the work, in order, with the first things to be done on the far left, and one action to be written in each blank.1-) When the jobs are done in this order, how many minutes will it take to complete all the jobs?2-)1. How many minutes of space will there be in total in the process and the 2nd process?arrow_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_forward
- Question 2 a Full explain this question and text typing work only thanksarrow_forwardQuestion p .Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this linearrow_forwardQuestion 2 b Full explain this question and text typing work onlyarrow_forward
- 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).arrow_forwardQuestion 32 The processing times of four jobs are given as follows: Job Processing time (minutes) A 10 B 30 C 16 D 24 Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 70 minutes. What is the average flow time in minutes if the jobs are processed in shortest processing time (SOP) order? Group of answer choices 166 41.5 38 20.5arrow_forwardQuestion Scenario: Early one Monday morning in Jamaica, Susan, a Restaurant Manager starts getting ready for the morning’s work operations. She is particularly happy because tonight he has a date with Marvin, the new Chef that was recently hired. The problem, as Susan sees it, is that Roberta, another Restaurant employee has been just a little too friendly with Marvin lately and that really upsets Susan. Susan has redone the work schedule, assigning Roberta the clean-up shift in the night and cutting back on her hours of work. She is hoping that Roberta would simply quit and out of her way. However, that plan doesn’t seem to be working. Despite a lighter pay cheque and frequent reprimand through the disciplinary process of creating reasons to write to her about her conduct and performance. Roberta has decided to quit her studies due to her inability to fund her tuition. A few days later, Susan noticed Marvin and Roberta having lunch together in the staff dining room. Susan got furious…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.