Operations Management
17th Edition
ISBN: 9781259142208
Author: CACHON, Gérard, Terwiesch, Christian
Publisher: Mcgraw-hill Education,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 18, Problem 14PA
Summary Introduction
To determine: The maximum tardiness of all the jobs.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
24
The job that arrived first at a work center or machine will be processed first and completed. Which of the following priority rules does this statement represent?
a
first come, first served
b
shortest processing time
c
critical ratio
d
earliest due date
The Earliest Due date (EDD) rule for sequencing a given set of jobs usually ____________
Select one:
a.
minimizes the maximum lateness and tardiness.
b.
minimizes average flow time and work in process inventory.
c.
maximizes the average lateness and tardiness.
d.
minimizes the average lateness and tardiness.
e.
maximizes the minimum lateness and tardiness.
The first five columns of the following table contain information about a set of four jobs that just arrived (end of Hour 0 or beginning of Hour 1) at an engine lathe. They are the only ones now waiting to be processed. Several operations, including the one at the engine lathe, remain to be done on each job. Determine the schedule by using (a) the CR rule and (b) the S/RO rule. Compare these schedules to those generated by FCFS, SPT, and EDD.
Job
ProcessingTime at EngineLathe (hours)
TimeRemainingUntil Due Date(days)
Number ofOperationsRemaining
Shop TimeRemaining(days)
CR
S/RO
1
2
3
4
2.3
10.5
6.2
15.6
15
10
20
8
10
2
12
5
6.1
7.8
14.5
10.2
2.46
1.28
1.38
0.78
0.89
1.10
0.46
-0.44
Chapter 18 Solutions
Operations Management
Ch. 18 - Prob. 1CQCh. 18 - Prob. 2CQCh. 18 - Prob. 3CQCh. 18 - Prob. 4CQCh. 18 - Prob. 5CQCh. 18 - Prob. 6CQCh. 18 - With weighted shortest processing time, jobs are...Ch. 18 - Prob. 8CQCh. 18 - Prob. 9CQCh. 18 - Prob. 10CQ
Ch. 18 - Prob. 11CQCh. 18 - Prob. 12CQCh. 18 - Prob. 13CQCh. 18 - Prob. 14CQCh. 18 - Prob. 15CQCh. 18 - Prob. 16CQCh. 18 - Prob. 1PACh. 18 - Prob. 2PACh. 18 - Prob. 3PACh. 18 - Prob. 4PACh. 18 - Prob. 5PACh. 18 - Prob. 6PACh. 18 - Prob. 7PACh. 18 - Prob. 8PACh. 18 - Prob. 9PACh. 18 - Prob. 10PACh. 18 - Prob. 11PACh. 18 - Prob. 12PACh. 18 - Prob. 13PACh. 18 - Prob. 14PACh. 18 - Prob. 15PACh. 18 - Prob. 1CCh. 18 - Prob. 2CCh. 18 - Prob. 3CCh. 18 - Prob. 4C
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
- Lee is the manager of the ABC construction project. Lee is informed by the foreman that the concrete will need to cure for one more day before the framing can start. Lee should add which time to the framing activity to accommodate the requirement? Group of answer choices Lag Delay Slack Leadarrow_forwardFive jobs are waiting for processing through two work centers. Their processing time (in minutes) at each work center is contained in the table below. Each job requires work center Sigma before work center Delta. According to Johnson's rule, what sequence of jobs will minimize the completion time for all jobs? Job Sigma Delta R 20 10 S 25 30 T 30 20 U 35 35 V 15 25 Part 2 A. V−S−U−T−R B. V−R−U−S−T C. R−V−T−S−U D. S−U−T−V−R E. R−S−T−U−Varrow_forwardThe scheduling rule which most reduces number of jobs in the system/work in process is generally: First Come, First Serve Shortest Processing Time Flowtime Dispatch Rule Earliest Due Date Earliest Release Datearrow_forward
- The following jobs are waiting to be processed at Jeremy LaMontagne's machine center. Today is day 250. Using the critical ratio scheduling rule, in what sequence would the jobs be processed?arrow_forwardWhy does the theory of constraints advocate that a manager’s attention be directed tothe bottleneck of a process?a. It is useful to lower the utilization of the bottleneck.b. The bottleneck has considerable influence on the average flow rate of a process.c. It is important to minimize the buffer inventory in front of the bottleneck.d. First-come-first-served scheduling of jobs at the bottleneck ensures that all jobs havethe same expected waiting time before they are processed at the bottleneck.arrow_forwardIf the jobs displayed in Table 18.23 are processed using the earliest-due-date rule, whatwould be the lateness of job B?arrow_forward
- Consider a business process in which each order that arrives is split into two jobs that are performed in parallel and are then rejoined before leaving the system. Assume no variance in inter-arrival times nor in process times for each task. Each station (depicted by a rectangle) contains one or more identical parallel servers (depicted by circles). Each server is independent of all others and can work on one job at at a time. Process times for individual servers at station A are 5 minutes. Servers at stations B and C have process times of 3 and 6 minutes respectively. Consider the system with one server at each of the stations A and B as before, and two identical parallel servers (each with a 6 minute process time) at station C. What is the system's capacity? What is the cycle time for each order through the entire process flow?arrow_forwardIf the jobs displayed in Table 18.23 are processed using the earliest-due-date rule, whatis the average flow time?arrow_forwardThe earliest-due-date rule always minimizes the maximum tardiness across jobs. True orfalse?a. Trueb. Falsearrow_forward
- Joe's Twenty-four Seven Laundromat has the following jobs waiting to be processed. The first step of the process includes washing and drying the clothes; the second step is pressing the clothing. Joe wants to minimize the amount of time it takes to do all the jobs. The five jobs waiting to be processed are shown here. Job Wash andDry (hours) Press(hours) A 5 4 B 3 4 C 2 3 D 7 5 E 4 2 Wash and Dry Using FCFS, assume the jobs arrive in the order shown (A, then B, then C, etc.). Show the beginning time for each job and ending time for the whole process adding hours throughout the process. A -0 number of hours B-5 number of hours C-8 number of hours D-10 number of hours E-17 number of hours A B C D E 0 enter a number of hours enter a number of hours enter a number of hours enter a number of hours enter a number of hours enter a number of hours Pressarrow_forwardThe company has received 7 special jobs. These jobs have to go through Process X, Process Y and then Process Z in sequence. Each of the processes is operated by a dedicated machine. What is the optimal sequence to schedule the jobs? Show your steps. If there is more than one optimal sequence under the adapted Johnson’s rule, show them all.arrow_forwardIn a POAM, an action is a scheduled event that indicates the completion of a task or group of tasks. True Falsearrow_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.