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.5, Problem 5P
A
Summary Introduction
Interpretation: The tardiness involved in each job is to be determined and also the mean tardiness for all jobs, supposing that the jobs are scheduled based on SPT rule.
Concept Introduction: Under the EDD rule, the job that requires shortest processing time is preferred to be processes first.
B
Summary Introduction
Interpretation: The solution derived in above part is to be repeated based on the EDD
Concept Introduction: The production level at which the short term profits are maximized, and that at which setup and holding costs are least, is referred to as the optimal production plan.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Using the SPT (shortest processing time) decision rule for sequencing the jobs, the order
is (to resolve a tie, use the order in which the jobs were received):
Sequence
1
Job
The following jobs are waiting to be processed at Rick Solano's machine
center. Solano's machine center has a relatively long backlog and sets a fresh
schedule every 2 weeks, which does not disturb earlier schedules. Below are the
jobs to be scheduled today, which is day 241 (day 241 is a work day). Job names
refer to names of clients and contract numbers. Compute all times based on
initiating work on day 241.
2
3
4
5
...
The total flow time for the sequence developed using the SPT rule = days (round your
response to two decimal places).
The percentage utilization for the sequence developed using the SPT rule = ☐ % (enter
your response as a percentage rounded to two decimal places).
The average number of jobs in the system for the sequence developed using the SPT
rule = jobs (round your response to two decimal…
Using the FCFS rule for scheduling, the sequence is 1-2-3
For the schedule developed using the FCFS rule, the total length of time taken to
complete the three suits (including delivery) : hours (enter your response as a
whole number).
=
G
Sunny Park Tailors has been asked to make three different types of wedding suits
for separate customers. The table below highlights the time taken in hours for
cutting and sewing (process 1) and delivery (process 2) of each of the suits.
Times Taken for Different Activities (hours)
Cut and Sew
3
5
6
Suit
1
2
7
3
Deliver
4
2
∞ N
8
Assume that orders for suits have been listed in the above table in the order in
which they were received.
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 tardiness
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
- Three 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 B 1 5 4 2 7 7 3 3 5 Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.arrow_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 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.44arrow_forward
- Using Johnson's rule for 2-machine scheduling, the sequence is: Scheduled Order 1 2 3 4 5 6 Job For the schedule developed using Johnson's rule, the total length of time taken to complete the six jobs (including the 2nd operation) = hours (enter your response as a whole number). Six jobs are to be processed through a two-step operation. The first operation involves sanding, and the second involves painting. Processing times are as follows: Job A <ש ס ח ר B C E F Operation 1 (hours) 10 36254 Operation 2 (hours) 8° 4 2 7 1 13arrow_forwardOn Monday morning, Baxter Industries has the following jobs waiting for processing in two departments, milling, and drilling, in that order. Time Required (hours) Job Mill Drill 216 7 6 327 4 10 462 6 3 519 5 8 258 8 7 617 9 10 Develop a minimum makespan schedule using Johnson's rule. The schedule using Johnson's rule is - - - - - . Choose the correct Gantt chart with the minimum makespan schedule.arrow_forwardJob Processing time (Days) Job Due Date (Days) A 12 18 14 23 C 7 15 2 7 There are painting jobs awaiting at a paint shop. Their processing times and due dates are shown in the table. The firm wants to determine the sequence of jobs according to shortest processing time (SPT). Jobs are assigned a letter in the order day arrived. The utilization is _%. Today is day 1 and work begins today.arrow_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 following jobs are waiting to be processed at a small machine center; JOB 10 20 30 40 50 days (round your response to one decimal place). DUE DATE 260 254 260 265 275 days (round your response to one decimal place). DURATION (DAYS) All dates are specified as manufacturing planning calendar days. Assume that all jobs arrived on day 200 (yesterday) in the order shown but are not scheduled to begin until day 201 (today). a) Sequence the jobs according to LPT. According to the LPT rule, the sequence of jobs should be 50, 20, 10, 30, 40 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). 18 22 14 4 32arrow_forwardDe Law Construction has a gotten some construction jobs to build some starter housing units in a few areas. The building time for each housing unit to be completed as well as the date that each unit is to be completed is shown in the table below. Today is Day 471. Which of the sequences, EDD OR SPT should the company use to sequence the order in which they do the jobs, assuming that because of resource constraints it cannot do the jobs simultaneously? HOUSING UNIT Building Time (days) Due Date Marabella 39 Day 502 Tabaquite 23 Day 528 San Juan 30 Day 515 Mayaro 33 Day 498 D’Abadie 41 Day 535 Preysal 40 Day 510 Some time after starting the jobs according to the sequence you decided on, it was found that because of inclement weather the last three housing units in the sequence have been delayed. You now have to prioritise and decide in which order to expedite those three jobs, using the Critical Ratio model. It is now…arrow_forward
- On Monday morning, Baxter Industries has the following jobs waiting for processing in two departments, milling, and drilling, in that order. Time Required (hours) Job Mill Drill 216 7 11 327 6 10 462 8 4 519 5 8 258 3 5 617 12 15 Develop a minimum makespan schedule using Johnson's rule. The schedule using Johnson's rule is - - - - - . Choose the correct Gantt chart with the minimum makespan schedule. The correct graph is .arrow_forwardK The following jobs are waiting to be processed at a small machine center: JOB 10 20 30 40 50 DUE DATE DURATION (DAYS) 260 256 260 265 275 28 12 8 18 22 All dates are specified as manufacturing planning calendar days. Assume that all jobs arrived on day 200 (yesterday) in the order shown but are not scheduled to begin until day 201 (today). a) Sequence the jobs according to LPT. According to the LPT rule, the sequence of jobs should be 10, 50, 40, 20, 30 b) What is the average completion (flow) time? The average completion (flow) time is 62.8 days (round your response to one decimal place). c) What is the average job lateness? The average job lateness is 4 days (round your response to one decimal place).arrow_forwardThree jobs are to be scheduled on two machines A & B . Assume that the jobs are processed in the Sequence A-B. The processing times are : The Question is : Draw a Gantt Chart that shows the Schedule Corresponding to the sequences 1-2-3 of the jobs Job A B 1 5 4 2 7 7 3 3 5arrow_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