EBK PRODUCTION AND OPERATIONS ANALYSIS
7th Edition
ISBN: 8220102480681
Author: Olsen
Publisher: WAVELAND
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 9.8, Problem 19P
a.
Summary Introduction
Interpretation: The sequence required for processing the jobs resulting in minimizing the expected time of completion of all the said jobs.
Concept Introduction:
LEPT rule: LEPT when expanded is the longest expected processing time. According to this rule, completion time can be derived by arranging the jobs in decreasing order.
b.
Summary Introduction
Interpretation: The start and end times of each job should be computed when the job times are deterministic.
Concept Introduction:
Make span time: This is the time required to complete the last job before leaving the system.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students 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
A computer center has two identical computers for batch processing. Thecomputers are used as parallel processors. Job times are estimated by the user, but experience has shown that an exponential distribution gives an accurate description of the actual job times. Suppose that at a point in time there are eight jobs remaining to be processed with the following expected job times (expressed in minutes):Job 1 2 3 4 5 6 7 8Expected time 4 8 1 50 1 30 20 6a. In what sequence should the jobs be processed in order to minimize theexpected completion time of all eight jobs (i.e., the makespan)?b. Assume that computer A is occupied with a job that has exactly two minutes of processing time remaining and computer B is idle. If job times are deterministic, show the start and end times of each job on each computer using the sequence derived in part (a).
At the campus copy shop, six jobs have arrived in the order shown (A, B, C, D, E, and F) at the beginning of the day 1 (today, which is a work day). All of the jobs are due at various times today. Your job is to evaluate four common sequencing rules.
JOB
DUE (IN HOURS)
DURATION (HOURS REQUIRED)
A
8
(this job is due in 8 hours)
1.65
B
5.5
(this job is due in 5.5 hours)
1.20
C
4.5
(this job is due after lunch in 4.5 hours)
0.85
D
6
(this job is due in 6…
Chapter 9 Solutions
EBK PRODUCTION AND OPERATIONS ANALYSIS
Ch. 9.5 - Prob. 1PCh. 9.5 - Prob. 2PCh. 9.5 - Prob. 3PCh. 9.5 - Prob. 4PCh. 9.5 - Prob. 5PCh. 9.6 - Prob. 6PCh. 9.6 - Prob. 7PCh. 9.6 - Prob. 8PCh. 9.6 - Prob. 9PCh. 9.6 - Prob. 10P
Ch. 9.7 - Prob. 11PCh. 9.7 - Prob. 12PCh. 9.7 - Prob. 13PCh. 9.7 - Prob. 14PCh. 9.7 - Prob. 15PCh. 9.7 - Prob. 16PCh. 9.7 - Prob. 17PCh. 9.8 - Prob. 18PCh. 9.8 - Prob. 19PCh. 9.8 - Prob. 20PCh. 9.8 - Prob. 21PCh. 9.8 - Prob. 22PCh. 9.9 - Prob. 23PCh. 9.9 - Prob. 24PCh. 9.9 - Prob. 25PCh. 9.10 - Prob. 27PCh. 9.10 - Prob. 28PCh. 9.10 - Prob. 29PCh. 9 - Prob. 30APCh. 9 - Prob. 31APCh. 9 - Prob. 32APCh. 9 - Prob. 33APCh. 9 - Prob. 34APCh. 9 - Prob. 35APCh. 9 - Prob. 36APCh. 9 - Prob. 37APCh. 9 - Prob. 38APCh. 9 - Prob. 39APCh. 9 - Prob. 40APCh. 9 - Prob. 41APCh. 9 - Prob. 42APCh. 9 - Prob. 43APCh. 9 - Prob. 44APCh. 9 - Prob. 45APCh. 9 - Prob. 46APCh. 9 - Prob. 47AP
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
- Given the following information on job times and due dates. Job Job Time(Hours) Due Date(Hours) a 3.5 7 b 2.0 6 c 4.5 18 d 5.0 22 e 2.5 4 f 6.0 20 a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Sequence for First come, first served Sequence for Shortest processing time Sequence for Earliest due date Sequence for Critical ratio a-2. For each method, find the average job flow time and the average job tardiness. (Round your answers to 2 decimal places.) First Come, FirstServed Shortest ProcessingTime Earliest Due Date Critical Ratio Average flow time Average job tardinessarrow_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_forwardThe constraints governing the jobs are as fo1lows: A and B are start jobs; A controls C, D and E; B controls F and J; G depends upon C; H depends on D; E and F control I and L; K follows J; L is also controlled by K; G, H, I and L are the last jobs. Draw the network,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 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_forwardFive jobs must be scheduled for batch processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listedhere.Job 1 2 3 4 5Processing time 40 min 2.5 hr 20 min 4 hr 1.5 hrPromised time 11:00 A.M. 2:00 P.M. 2:00 P.M. 1:00 P.M. 4:00 P.M.Assume that the current time is 10:00 A.M.a. If the jobs are scheduled according to SPT, find the tardiness of each job and themean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD schedulingarrow_forwardThe owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: Job W X Y Z Processing Time (hrs) 4 3 2 1 Multiple Choice If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average completion time? O 7.5 hours 5 hours 3 hours 2.5 hours Due (hrs from now) 4 2 hours 5 2 1arrow_forward
- Five jobs are planned to be scheduled. Each of the jobs must be processed on three machines (A, B, and C) in the same order. The processing times are listed below. Use Johnson's Rule to determine the optimal sequence of jobs. Job B 16 10 11 10 14 20 12 3 10 8 4 1 O a) 3-1-2-4-5 O b) Johnson's Rule is not an Optimal Technique O c) 1-2-3-4-5 O d) 5-4-3-1-2 O e) 5-4-3-2-1 O) 5-4-2-1-3 O e) 5-4-2-3-1 2345arrow_forwardThe framing department has five jobs waiting to be processed. It is now time zero and all jobs are ready to begin. Each has only one operation remaining. All jobs arrived at the same time, and FCFS begins with job a, then b, etc. Processing Time (days) Due Date (days) Jobs a b C d e A B On day 9 On day 13 If the Earliest Due Date (EDD) rule is used, when will job a be finished? On day 17 4 On day 19 6 2 7 8 8 7 9 6 14arrow_forwardCurrently a company that designs Web sites has six customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 6 18 48 B 4 22 52 C 1 30 70 D 10 14 28 E 7 12 56 F 5 20 62 Develop a schedule by using the first-come, first-served (FCFS) rule and calculate the average flow time and average days past due for the schedule. Develop a schedule by using the earliest due date (EDD) rule and calculate the average flow time and average days past due for the schedule. Comment on the performance of the FCFS and EDD rules relative to average flow time and average days past due.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_forwardJoe'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_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
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.