EBK PRINCIPLES OF OPERATIONS MANAGEMENT
11th Edition
ISBN: 9780135175859
Author: Munson
Publisher: VST
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 26P
a)
Summary Introduction
To sequence: The given jobs based on the earliest due date (EDD).
b)
Summary Introduction
To calculate: The average completion time.
c)
Summary Introduction
To calculate: The average job lateness.
d)
Summary Introduction
To calculate: The average number of jobs.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Dan's Auto Detailing business performs two major activities: exterior cleanup and interior detailing. Based on the size of car and condition, time
estimates for six cars on Monday morning are as shown in the accompanying table.
Car Number
1
5 6
Exterior
Interior
55 75
4
65
35 50 60 45
90
35 40
a. Sequence the cars so that all exterior cleanup is done first and total completion time is minimized.
The sequence is -Select-- -Select-
-Select-
-Select-
-Select-- -Select-
2
3
80 20
Courtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code. Assume that all jobs
arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day.
DURATION (HOURS
REQUIRED)
17
JOB
A
B
C
D
E
DUE DATE (HOURS
HENCE)
36
22
18
14
8
a) Sequence the jobs according to EDD.
According to the EDD rule, the sequence of jobs should be E, D, C, B, A
b) What is the average completion (flow) time?
The average completion (flow) time is
c) What is the average job lateness?
The average job lateness is
d) What is the average number of jobs in the system?
The average number of jobs in the system is jobs (round your response to one decimal place).
days (round your response to one decimal place).
days (round your response to one decimal place).
9
2
6
5
Courtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning and she must decide in what order to write the code. Assume that all jobs arrived today (day 1 and
hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day.
Due date
Duration (hours
Job
(hours hence)
required)
A
8.
16
24
10
D
32
16
E
12
6
In what sequence would the jobs be ranked according to the following decision rules: FCFS, EDD, SPT, LPT?
According to the FCFS rule, the sequence of jobs should be
According to the EDD rule, the sequence of jobs should be
According to the SPT rule, the sequence of jobs should be
According to the LPT rule, the sequence of jobs should be
Construct the table of measures of effectiveness for each rule (round your responses to one decimal place).
Average number of jobs
in system
Average Flow Time
Average Lateness…
Chapter 15 Solutions
EBK PRINCIPLES OF OPERATIONS MANAGEMENT
Ch. 15 - Prob. 1EDCh. 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. 9DQ
Ch. 15 - Prob. 10DQCh. 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. 22PCh. 15 - Prob. 23PCh. 15 - Prob. 24PCh. 15 - Prob. 25PCh. 15 - Prob. 26PCh. 15 - Prob. 27PCh. 15 - Prob. 28PCh. 15 - Daniels Barber Shop at Newark Airport is open 7...Ch. 15 - Given the following demand for waiters and...Ch. 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 - Why is seniority important in scheduling servers?Ch. 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
- Courtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code Assume that all jobs arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day. DURATION (HOURS JOB k A BUD C E DUE DATE (HOURS HENCE) 10 16 14 36 26 REQUIRED) 6 3 7 15 8 a) Sequence the jobs according to EDD. According to the EDD rule, the sequence of jobs should be A, C, B, E, D b) What is the average completion (flow) time? The average completion (flow) time is days (round your response to one decimal place).arrow_forwardCourtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code. Assume that all jobs arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day. JOB DUE DATE (HOURS HENCE) 18 36 10 22 14 E a) Sequence the jobs according to EDD. According to the EDD rule, the sequence of jobs should be b) What is the average completion (flow) time? The average completion (flow) time is c) What is the average job lateness? The average job lateness is d) What is the average number of jobs in the system? The average number of jobs in the system is place). DURATION (HOURS REQUIRED) 3 19 4 9 5 days (round your response to one decimal place) days (round your response to one decimal place). jobs (round your response to one decimalarrow_forwardK Courtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code. Assume that all jobs arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day. JOB A C D E DUE DATE (HOURS HENCE) 10 16 14 36 26 DURATION (HOURS REQUIRED) 6 3758 a) Sequence the jobs according to EDD. According to the EDD rule, the sequence of jobs should be A, C, B, E, D b) What is the average completion (flow) time? The average completion (flow) time is days (round your response to one decimal place).arrow_forward
- Raquel is concerned with effi ciency. She believes it isprobably more effi cient to use SPT (shortest processing time) asher priority rule.(a) Develop a sequence using SPT based on processing timefor preparing the area.(b) Calculate the makespan, the mean job fl ow time, and theaverage number of jobs in the system.arrow_forward← Courtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code. Assume that all jobs arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day. JOB A B C D E DUE DATE (HOURS HENCE) 24 8 34 14 20 DURATION (HOURS REQUIRED) 11 4 18 5 2 a) Sequence the jobs according to EDD. According to the EDD rule, the sequence of jobs should be B, D, E, A, C b) What is the average completion (flow) time? The average completion (flow) time is days (round your response to one decimal place).arrow_forwardThe times required to complete each of eight jobs in a two-machine flow shop are shown in thetable 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. c. For the sequence determined in part a, how much would machine B’s idle time be reduced bysplitting the last two jobs in half?TIME (hours)Job Machine A Machine Ba 16 5b 3 13c 9 6d 8 7e 2 14f 12 4g 18 14h 20 11arrow_forward
- Sequencing jobs through two work centers. Use Johnson’s rule to obtain the optimum sequence for processing the jobs shown through work centers A and B.JOB TIMES (hours)Job Work Center A Work Center Ba 2.50 4.20b 3.80 1.50c 2.20 3.00d 5.80 4.00e 4.50 2.00arrow_forwardFive jobs are ready for processing at time zero through a workstation. The details of the processing time and the due date of completion is provided in the following table. Job A B Processing Time (days) I5 Due Date 11 6 3 16 19 10 D E 15 Using the earliest due date (EDD) rule, the average lateness for the five jobs is decimal place. Round your answer to one Your Answer: Answerarrow_forwarda) Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is (assume that jobs came in the order in which they are listed in the table): Sequence 1 2 3 4 5 Job A B C E The average tardiness (job lateness) for the sequence developed using the FCFS rule = days (round your response to two decimal places) The following jobs are waiting to be processed at the same machine center. Jobs are logged as they arrive: Job A B C E Due Date 315 313 312 325 314 Duration (days) 3 8 16 40 5 All dates are specified as manufacturing planning calendar days. Assume that all jobs arrive on day 275. Assume each job starts at the beginning of the day and finishes at the end of the day (a job that begins on day 275 and takes 8 days will finish on day 282, and the next job begins in the morning of day 283). Compute all times based on initiating work on day 275.arrow_forward
- Given the following information on job times and due dates, determine the optimal processingsequence using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, find the average jobflow time and the average job tardiness. Jobs are listed in order of arrival.JobJob Time(hours)Due Date(hours)a 3.5 7b 2.0 6c 4.5 18d 5.0 22e 2.5 4f 6.0 20arrow_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_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
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 EducationOperations 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 LearningProduction 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