EBK PRODUCTION AND OPERATIONS ANALYSIS
7th Edition
ISBN: 9781478628385
Author: Olsen
Publisher: WAVELAND PRESS (ECONTENT)
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 9.7, Problem 14P
Summary Introduction
Interpretation: The optimal sequencing of jobs in order to minimize the make span is to be determined and the make span at the optimal solution. Also, a Gantt chart for the solution so derived need to be drawn too.
Concept Introduction: The time difference between starting and finishing of a sequence of job or task is referred to as the make span.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
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
Given the data below, using the SPT heuristic sequencing rule, determine the completion date and tardiness for each job as well as the average completion time and average tardiness for all four jobs. Which of the following statements is true?
Job
Processing time (days)
Due date (in days)
A
10
10
B
5
8
C
15
25
D
8
15
a.Jobs B and D will have no tardiness
b.The tardiness for Job A is 12 days
c.The average tardiness is 19.75
d.The average completion time is 6.5
The data for five tax analysis jobs waiting to be processed by Martha at T. R. Accounting Service has been collected in the Microsoft Excel Online file below. Open the spreadsheet and perform the required analysis to answer the questions below.
Questions
1. Use the shortest-processing-time (SPT) sequencing rules to sequence the jobs. Compute the flow time, tardiness, and lateness for each job, and the average flow time, average tardiness, and average lateness for all jobs. Use minus sign to enter negative lateness values, if any. Round the average values to two decimal places.
Sequence
Job
Processing Time
Due Date
Flow Time
Lateness
Tardiness
1
2
3
4
5
Average
2. Use the earliest-due-date (EDD) sequencing rules to sequence the jobs. Compute the flow time, tardiness, and lateness for each job, and the average flow time, average tardiness, and average lateness for all jobs. Use minus…
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
- 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.arrow_forwardK 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). 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 Suit 1 2 3 7 4 5 Deliver 2 3 6 Assume that orders for suits have been listed in the above table in the order in which they were received Darrow_forwardUsing 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). 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) Deliver Suit Cut and Sew 1 2 Assume that orders for suits have been listed in the above table in the order in which they were receivedarrow_forward
- Mike’s Auto Body Shop has five cars waiting to be repaired. The shop is quite small, so only one car can be repaired at a time. The number of days required to repair each car and the promised date for each are given in the following table. (given) Mike has agreed to provide a rental car to each customer whose car is not repaired on time. Compare the performance of the four sequencing rules FCFS, SPT, EDD, and CR relative to minimizing average tardiness.arrow_forwardSix patients are waiting in a hospital emergency room to receive care for various complaints, ranging from a sprained ankle to a gunshot wound. The patients are numbered in the sequence that they arrived and are given a priority weighting based on the severity of the problem. There is only one doctor available.Consider the situation of the emergency room mentioned. Determine the sequence in which patients should be treated in order to minimize the weighted value of the mean flow time.arrow_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
- 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 received during the previous 2 weeks. They are ready to be scheduled today, which is day 241 (day 241 is a workday). Job names refer to names of clients and contract numbers. Job Date job received Productiondays needed Date job due BR-02 228 15 300 CX-01 225 25 270 DE-06 230 35 320 RG-05 235 40 360 SY-11 231 30 310 a. Complete the following table. (Show your supporting calculations.) b.Which dispatching rule has the best score for flow time? c. Which dispatching rule would you select? Support your decision.arrow_forwardUsing the FCFS rule for scheduling, the sequence is 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 For the schedule developed using the FCFS rule, the total length of time taken to complete the three suits (including of the suits. delivery) = hours (enter your response as a whole number). Times Taken for Different Activities (hours) Deliver Suit Cut and Sew Using Johnson's rule for 2-machine scheduling, the sequence is 1 2. For the schedule developed using the Johnson's rule, the total length of time taken to complete the three suits 3 (including delivery) = hours (enter your response as a whole number). Assume that orders for suits have been listed in the above table in the order in which they were received. Of the two developed schedules, V rule gets the schedule finished sooner.arrow_forwardSunny 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. Using the FCFS rule for scheduling, the sequence is 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). Times Taken for Different Activities (hours) Using Johnson's rule for 2-machine scheduling, the sequence is Suit Cut and Sew Deliver 1 2 4 3 For the schedule developed using the Johnson's rule, the total length 3 6. of time taken to complete the three suits (including delivery) =| hours (enter your response as a whole number). Assume that orders for suits have been listed in the above table in the order in which they were received. Of the two developed schedules, rule gets the schedule finished sooner.arrow_forward
- A B1 B2 B3 C1 C2 C3 D1 D2 D3 E A service process is described by the above flowchart. After going through workstation A, an order needs to be processed by one of the three lines, B1-C1-D1, B2-C2-D2, or B3-C3-D3 (in other words, they are substitutable). Finally, all orders need to go through workstation E. The capacities of the individual workstations are given as follows: Workstation A has a capacity of 3 orders/hour • Workstation B1, B2, and B3 have the same capacity of 4 orders/hour • Workstation C1, C2, and C3 have the same capacity of 3 orders/hour • Workstation D1, D2, and D3 have the same capacity of 4 orders/hour • Workstation E has a capacity of 6 orders/hour What is process time of this service process in minutes?arrow_forwardThe Mowry Machine Shop still has five jobs to be processed as of 8 A.M. today (day 23) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 11 10 22 B 10 8 13 C 8 4 19 D 6 4 16 E 1 3 30 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is: Sequence 1 2 3 4 5 Job ▼ A E B C D ▼ E C B D A ▼ A B C E D ▼ A B D C E ▼ C B D E Aarrow_forwardThe Mowry Machine Shop still has five jobs to be processed as of 8 A.M. today (day 23) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 11 10 22 B 10 8 13 C 8 4 19 D 6 4 16 E 1 3 30 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is: Sequence 1 2 3 4 5 Job A B C D E Using the EDD (earliest due date) decision rule for sequencing the jobs,…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