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.7, Problem 12P
Summary Introduction
Interpretation: The possible schedules if the jobs are processed in any order. Also, the time required to evaluate the feasible schedules if the computer program could evaluate 100 schedules every second.
Concept Introduction: The method of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The following five overhaul jobs a re waiting to be processed 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 Using the critical ratio scheduling rule, in what sequence would the jobs be processed?
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.
Using Johnson's rule for 2-machine scheduling, the sequence is:
Scheduled Order
Job
1
C
2
B
3
E
4
A
5
D
6
F
For the schedule developed using Johnson's rule, the total length of time taken to complete the six jobs (including the 2nd operation) =
nothing
hours (enter your response as a whole number).
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
- 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.5arrow_forwardIf the jobs displayed in Table 18.23 are processed using the earliest-due-date rule, whatis the maximum tardiness?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_forward
- Six jobs are to be processed through a two-stepoperation. The first operation involves sanding, and the second involves painting. Processing times are as follows: Determine a sequence that will minimize the total completiontime for these jobs. Illustrate graphically.arrow_forwardA computer center has two identical computers for batch processing. Thecomputers are used as parallel processors. Job times are estimated by the user, but experience has shown that an exponential distribution gives an accurate description of the actual job times. Suppose that at a point in time there are eight jobs remaining to be processed with the following expected job times (expressed in minutes):Job 1 2 3 4 5 6 7 8Expected time 4 8 1 50 1 30 20 6a. In what sequence should the jobs be processed in order to minimize theexpected completion time of all eight jobs (i.e., the makespan)?b. Assume that computer A is occupied with a job that has exactly two minutes of processing time remaining and computer B is idle. If job times are deterministic, show the start and end times of each job on each computer using the sequence derived in part (a).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
- . 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_forwardThe owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: Job processing time hrs due from now W 4 4 X 3 5 Y 2 2 Z 1 1 If he uses the earliest due date first priority rule to schedule these jobs, what will be the average job tardiness?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 listed here. (given) 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 the mean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD scheduling.arrow_forward
- Ron Satter field's excavation company uses bothGantt scheduling charts and Gantt load charts.a) Today, which is the end of day 7, Ron is reviewing the Ganttchart depicting these schedules:• Job # 151 was scheduled to begin on day 3 and to ta ke6 days. As of now, it is I day ahead of schedule.• Job# 177 was scheduled to begin on day J and take 4 days.It is currently on time.• Job #1 79 was scheduled to start on day 7 and take 2 days. Itactually got started on day 6 and is progressing according toplan.• Job #211 was scheduled to begin on day 5, but missingequipment delayed it until day 6. It is progressing asexpected and should take 3 days.• Job #215 was scheduled to begin on day 4 and take 5 days.It got sta rted on time but has since fallen behind 2 days.Draw the Gantt scheduling chart for the activities described.b) Ron now wants to use a Ga ntt load chart to see how muchwork is scheduled in each of his three work teams: Able,Baker, and Charlie. Five jobs constitute the current…arrow_forwardIn a few words, explain how to prevent a process getting starved in priority scheduling.arrow_forwardPriority Scheduling resembles Shortest Job First Scheduling in what ways?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