OPERATIONS MANAGEMENT: SUSTAIN ACCESS C
13th Edition
ISBN: 9780135662076
Author: HEIZER
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 16P
Summary Introduction
To determine: Thejob sequence based on the critical ratio.
Introduction: The critical ratio is a kind of
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Q. 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. 200
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.
2
Chapter 15 Solutions
OPERATIONS MANAGEMENT: SUSTAIN ACCESS C
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. 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. 29PCh. 15 - Prob. 30PCh. 15 - Prob. 10PCh. 15 - Prob. 11PCh. 15 - Prob. 12PCh. 15 - Prob. 14PCh. 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 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_forwardFinite 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 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 neededarrow_forward
- 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 370arrow_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_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_forward
- 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 33 The processing times of five jobs are given as follows: Job Processing time (minutes) A 20 B 60 C 30 D 75 E 15 Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 200 minutes. What is the average inventory if the jobs are processed in shortest processing time (SPT) order? Group of answer choices 3.00 2.92 1.97 2.20arrow_forwardQuestion 7 Station 1 Machine A 20 min/unit Station 1 Machine B 20 min/unit Station 2 12 min/unit Station 3 8 min/unit A three station work cell is illustrated in the image above. A unit needs to be processed at either Machine A or Machine B for Station 1 (parallel lines, both lines doing the exact same thing). The unit is then processed at Stations 2 and 3 before leaving the work cell. What is the process time of this system measured in minutes/unit?arrow_forward
- 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.67arrow_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 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.