Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 9.6, Problem 10P
A
Summary Introduction
Interpretation: The sequence of the jobs is to be determined in order to minimize mean flow time.
Concept Introduction: The activities under a project are programmed based on the needs of the individual and attaining ease is the priority of the individual. The mean flow time is the average time that a task takes to be processed within a computer system.
B
Summary Introduction
Interpretation:The sequence of the jobs is to be determined in order to minimize the number of tardy jobs.
Concept Introduction: The activities under a project are programmed based on the needs of the individual and attaining ease is the priority of the individual.Tardiness is the delay in executing a certain job to be executed within a computer system.
C
Summary Introduction
Interpretation: The sequence of the jobs is to be determined in order to minimize maximum lateness.
Concept Introduction: The activities under a project are programmed based on the needs of the individual and attaining ease is the priority of the individual.The EDD rule will be aiding for minimizing the maximum lateness of the project.
D
Summary Introduction
Interpretation:The sequence of the jobs in order to determine the make span for any sequence.
Concept Introduction: In the manufacturing process, the difference between beginning and the ending of a sequence of jobs or tasks is referred to as the make span.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
The 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
14
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
2345
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.
Chapter 9 Solutions
Production and Operations Analysis, Seventh Edition
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
- Seven jobs are to be processed through a single machine. The processing times and due dates are given here. (given) Determine the sequence of the jobs in order to minimizea. Mean flow time.b. Number of tardy jobs.c. Maximum lateness.d. What is the makespan for any sequence?arrow_forwardIf the jobs displayed in Table 18.23 are processed using the earliest-due-date rule, whatis the maximum tardiness?arrow_forwardAt 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…arrow_forward
- Processing times and due dates for five jobs are shown in the table below. Assume the jobs are processed using the earliest-due-date rule. Job A B C D E Processing time (weeks) 2 0.7 1 4 1.3 Due time (weeks) 1 8 4 5 2 12. What would be the lateness of job B? What would be the tardiness of job E? 14. What is the maximum tardiness for this set of jobs? Note: Round your answer to 1 decimal place. 15. What is the average flow time for this set of jobs? Note: Round your answer to the nearest whole number.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_forwardGiven the jobs displayed in Table 18.17, if SPT is used to sequence the jobs, what is theflow time of job F (in minutes)?arrow_forward
- Job 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_forwardUsing 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…arrow_forwardDan'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 20arrow_forward
- 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_forward. Assume the jobs displayed in Table 18.22 need to be processed on a single resource andare sequenced with the WSPT rule. Which job would be processed second?a. Ab. Bc. Cd. De. Earrow_forwardGiven 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_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.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY