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
Question
Chapter 9.5, Problem 4P
Summary Introduction
Interpretation: The mean flow time, average tardiness and the number of tardy jobs for each of the cases are to be calculated.
Concept Introduction: The sum of finishing times of all tasks in the provided system is referred to as the mean flow time.The tardiness will be considered as zero when the due time is greater than the completion time.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Four trucks, 1, 2, 3, and 4, are waiting on a loading dock at XYZ Company that hasonly a single service bay. The trucks are labeled in the order that they arrived at thedock. Assume the current time is 1:00 P.M. The times required to unload each truck and the times that the goods they contain are due in the plant are given in thefollowing table.Truck Unloading Time (minutes) Time Material Is Due1 20 1:25 P.M.2 14 1:45 P.M.3 35 1:50 P.M.4 10 1:30 P.M.Determine the schedules that result for each of the rules FCFS, SPT, EDD, andCR. In each case compute the mean flow time, average tardiness, and number oftardy jobs.
In her last semester at SPC, Polly Hedron needs to take Statistics, Composition 2, Ethics, and Physics. Because Polly is registering early, she has 14 choices for her section of Statistics, 19 choices for her section of Composition, 17 choices for her section of Ethics, and 18 choices for her section of Physics. From how many possible schedules can Polly choose?
(You may presume that none of these sections interfere with each other)
Your Answer:
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
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
- Five sorority sisters plan to attend a social function. Each requires hair styling andfitting for a gown. Assume that the times required are independent exponentiallydistributed random variables with the mean times for the fittings of 0.6, 1.2, 1.5,0.8, and 1.1 hours, respectively, and mean times for the stylings of 0.8, 1.6, 1.0,0.7, and 1.3 hours, respectively. Assume that the fittings are done before thestylings and that there is only a single hair stylist and a single seamstress available.In what sequence should they be scheduled in order to minimize the total expectedtime required for fittings and stylings?arrow_forwardThe manager of a company wishes to assign three jobs to four machines on one-on-one basis. The cost of each job on each machine if given on the following table. Solve it through Branch and Bound on Assignment Problem.arrow_forwardNTS is a Swiss intermodal operator located in Lausanne. When customers need to transport goods between origin and destination, NTS supplies them with one or more empty containers in which the goods can be loaded. Upon arrival at the destination, the goods are unloaded, and the empty containers must be transported to the pickup point for new customers. Therefore, NTS management needs to reallocate empty containers periodically (every week). The company's focus is on the transportation activity of empty containers, which is very expensive (almost 35% of the total operational costs). In May 2023, several empty containers, totaling 20 containers, need to be reallocated among terminals in Amsterdam, Berlin, Munich, Paris, Milan, Barcelona, and Madrid. The available or requested number of empty containers at various terminals is reported, along with the transportation costs (in euros per container) as seen in Figure 1.Determine how to solve the problem with the goal of minimizing…arrow_forward
- NTS is a Swiss intermodal operator located in Lausanne. When customers need to transport goods between origin and destination, NTS supplies them with one or more empty containers in which the goods can be loaded.Upon arrival at the destination, the goods are unloaded, and the empty containers must be transported to the pickup point for new customers. Therefore, NTS management needs to reallocate empty containers periodically (every week). The company's focus is on the transportation activity of empty containers, which is very expensive (almost 35% of the total operational costs). In May 2023, several empty containers, totaling 20 containers, need to be reallocated among terminals in Amsterdam, Berlin, Munich, Paris, Milan, Barcelona, and Madrid. The available or requested number of empty containers at various terminals is reported, along with the transportation costs (in euros per container) as seen in Figure 1. Determine how to solve the problem with the goal of minimizing…arrow_forwardThe chief of police, Karen Stanley, of the Make-BelievePolice Department needs to assign five detective squadsto five pending criminal cases. Karen wants to comeup with an optimum assignment that will minimize thetotal time it takes to conclude the cases. Data on past performance of each detective squad to complete each case assigned in terms of average number of days ispresented in the following table.Average Completion Time (in Days)Detective Squad Case-1 Case-2 Case-3 Case-4 Case-5A 15 8 4 8 28B 21 8 13 7 32C 11 4 5 6 20D 9 12 8 13 20E 14 24 25 27 9Use the assignment method to solve the problemIf Squad D cannot be assigned to Case-5 as a result ofa conflict of interest, solve the problem given this new constraint.arrow_forwardFour workers are available to perform jobs 1–4.Unfortunately, three workers can do only certain jobs:worker 1, only job 1; worker 2, only jobs 1 and 2; worker3, only job 2; worker 4, any job. Draw the network for themaximum-flow problem that can be used to determinewhether all jobs can be assigned to a suitable worker.arrow_forward
- Consider the Dynamic Program formulation of the n-class optimal booking problem with sequential arrivals. In thisproblem, show some monotonicities of the value function.• Jt(x) − Jt(x − 1) is non-decreasing in t, ∀x.• Jt(x) − Jt(x − 1) is non-increasing in x, ∀t.Consider that the second property implies the first property. To prove the second property, given Dt, consider the discrete concavity of Ht(Dt, x) = max0≤u≤min{Dt,x} (pt)u + Jt−1(x − u) in x, i.e., Ht(Dt, x + 1) − Ht(Dt, x) ≤ Ht(Dt, x) − Ht(Dt, x − 1) for any x ∈ Z+ for any t. Image attatched for clarity.arrow_forward3) Alice works as an Order Processor at a local retail store. She is an hourly employee and her starttime is 8am, however she likes to arrive at least 20 minutes early to organize her desk, checkemails and answer any voice mails that came in after her shift ended the day before. What timewould her “compensable time” begin?4) Tricia is an Administrative Assistant and her job requires her to travel from one location toanother during the course of her normal workday. She uses her own car and is reimbursed formileage. She spends approximately 1 hour per week traveling. Tricia lives only 2 miles from herprimary location - A, but lives 10 miles from the furthest location - B. Is her travel timecompensable when she is traveling from either Location A or Location B?arrow_forwardOne possible solution method for the machine-tojob assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest. Then assign the machine to job 2 that, among all machines that still have some capacity, completes job 2 quickest. Keep going until a machine has been assigned to all jobs. Does this heuristic-procedure yield the optimal solution for this problem? If it does, see whether you can change the job times so that the heuristic does not yield the optimal-solution.arrow_forward
- The 4M company has a lathe as the centerpiece of the plant's work. The jobs arrive according to a Poisson process with an average rate of 2 per day. The processing time of each job is exponentially distributed with an average of 1/ 4 day. Since the jobs are large, if they are not in process they are stored in a warehouse some distance from the machine. However, to save time in bringing them in, the production manager proposes to add space for 3 in-process jobs in addition to the one on the lathe (the rest will continue to be stored). With this proposal, what proportion of the time will the space next to the lathe be adequate for the waiting jobs? Calculate your answer using the formulas available.arrow_forwardBest-ride airlines that operates seven days a week has the following time-table. Delhi - Mumbai Mumbai - Delhi Flight No Departure Arrival 1 7.00 8.00 2 8.00 9.00 3 13.00 14.00 4 18.00 19.00 Flight No Departure Arrival 101 8.00 9.00 102 9.00 10.00 103 12.00 13.00 104 17.00 18.00 Crews must have a minimum layover of 5 hours between flights. Obtain the pairing of flights that minimizes layover time away from home. For any given pairing, the crew will be based at the city that results in the smaller layover. For each pair also mention the city where crew should be based.arrow_forwardIn her last semester at SPC, Polly Hedron needs to take Statistics, Composition 2, and Ethics. Because Polly is registering early, she has 17 choices for her section of Statistics, 11 choices for her section of Composition, and 19 choices for her section of Ethics. From how many possible schedules can Polly choose? (You may presume that none of these sections interfere with each other) Your Answer: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,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,