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, Problem 47AP
(a)
Summary Introduction
Interpretation:The mean flow time and average tardiness are to be determined for problem 45 (a) assuming EDD sequence.
Concept Introduction:
The earliest due date or EDD sequence is a method in which jobs will be arranged in increasing order sequence of the due date.
(b)
Summary Introduction
Interpretation:The mean flow time and average tardiness are to be determined for problem 45 (b) assuming EDD sequence.
Concept Introduction:
The earliest due date or EDD sequence is a method in which jobs will be arranged in increasing order sequence of the due date.
(c)
Summary Introduction
Interpretation: The mean flow time and average tardiness are to be determined for problem 45 (c) assuming EDD sequence.
Concept Introduction:
The earliest due date or EDD sequence is a method in which jobs will be arranged in increasing order sequence of the due date.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The following 5 overhaul jobs are waiting to be pro-cessed at Avianic’s Engine Repair Inc. These jobs were logged as
they arrived. All dates are specified as planning calendar days.Assume that all jobs arrived on day 180; today’s date is 200.JOB DUE DATE REMAINING TIME (DAYS)103 214 10205 223 7309 217 11412 219 5517 217 15Using the critical ratio scheduling rule, in what sequence wouldthe jobs be processed?
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 .
The following jobs are waiting to be processed at JulieMorel’s machine center:JOB DATE ORDER RECEIVED
PRODUCTIONDAYS NEEDED DATE ORDER DUEA 110 20 180B 120 30 200C 122 10 175D 125 16 230E 130 18 210
In what sequence would the jobs be ranked according to the fol-lowing rules: (a) FCFS, (b) EDD, (c) SPT, and (d) LPT? All dates
are according to shop calendar days. Today on the planning cal-endar is day 130, and none of the jobs have been started or sched-uled. Which rule is best?
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
- 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_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_forwardWhen should the following sequencing rules be used? (a)SPT; (b) Johnson’s rule; (c) DDATE; (d) FCFS.arrow_forward
- A manutacturer is designing a product layout for a new product production. It plans to use a production line for B hours per day in order to meet forecasted demand of 100 units per day. The product requires 7 lasks in total. These tasks are namely, A, 8, CD, E, F, and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed Starting tasks Cneeds, the tack B to be completed. Also, starting task D needed task B to be completed Task E can only start upon completion of Task C. Whescas starting lask F needs the completion of both the tasks D and E Finally, starting task G needed, task Fto be completed. 1the processing times for tasks, A BC D, E F, andG are 28, 2.1, 0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. Applying the most following tasks nule for balancing the assembly line, with ties broken according to longest task time first, the tasks that will be assigned to the FIRST workstation are Select one OaAB, and C ODAB Oc None…arrow_forwardb. Compute the earliest and the latest finishing and starting times for each of theactivities, and identify the critical path.arrow_forwardSunny Park Tailors has been asked to make threedifferent types of wedding suits for separate customers. Thetable below highlights the time taken in hours for (1) cuttingand sewing and (2) delivery of each of the suits. Which schedulefinishes sooner: first come, first served (123) or a schedule usingJohnson’s rule?arrow_forward
- A manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 90 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C D E F and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed, Starting tasks needs the task to be completed. Also starting task D, needed task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A, B, C, D, E, F. and G are 28.2.1,0.9, 10, 1.2.1.8 are 4.7 minutes respectively. How many minimum numbers of workstations are needed? a. 1 b. 6 c. None is correct d. 3 e. 5 please I neef answer along with the formula don't put it on excelarrow_forwardRouting and Scheduling becomes relatively complicated in(A) Job production(B) Batch production(C) Flow production(D) Mass productionarrow_forwardIn a few words, explain how to prevent a process getting starved in priority scheduling.arrow_forward
- One approach that can be effective in reducing the impact of production bottlenecks in a job shopor batch operations setting is to use smaller lot sizes.a. What is the impact of a production bottleneck?b. Explain how small lot sizes can reduce the impact of bottleneck operations.c. What are the key trade-offs in using small lot sizes for the purpose of reducing the bottleneckeffect?d. In some cases, the location of a bottleneck will shift (i.e., sometimes it is at workstation 3,another time it is at workstation 12). Furthermore, there can be more than one bottleneck operation at the same time. How would these situations impact scheduling using small lot sizes?arrow_forwardA group of six jobs is to be processed through a two-machine flow shop. The first operation involves cleaning and the second involves painting. Determine a sequence that willminimize the total completion time for this group of jobs. Processing times are as follows:PROCESSING TIME (hours)Job Work Center 1 Work Center 2A 5 5B 4 3C 8 9D 2 7E 6 8F 12 15 To employ Johnson’s rule, create a “blank” sequence first, such as:mhhe.com/stevenson13eEXAMPLE 41st 2nd 3rd 4th 5th 6tharrow_forwardA manufacturer is designing a product layout for a new product productionIt plans to use a production line for 8 hours per day in order to meet forecasted demand of 70 units per day. The product requires 7 tasks in total. These tasks are namelyABC, D, E, F, and Grespectively. Task A does not have any predecessor to startTo start Task B.it requires Task A to be completedStarting tasks needs, the task B to be completed. Also, starting task Dneeded task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed task Fto be completed. The processing times for tasks, ABC, D. E. and G are 2.8, 2.1, 0.9, 1.0, 1.2, 1.8 and 4.7 minutes respectively. What should be the cycle time in minutes? a 4.7 b. None is the correct answer Oc 7.5 d6.86 e.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.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY