Pearson Etext For Principles Of Operations Management: Sustainability And Supply Chain Management -- Access Card (11th Edition)
11th Edition
ISBN: 9780135639122
Author: Jay Heizer, Barry Render, Chuck Munson
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 15, Problem 27P
a)
Summary Introduction
To determine: The best sequence for various rules.
b)
Summary Introduction
To calculate: The average completion time, average job lateness and the average number of jobs for the FCFS
c)
Summary Introduction
To calculate: The average completion time, average job lateness and the average number of jobs for EDD schedule.
d)
Summary Introduction
To calculate: The average completion time, average job lateness and the average number of jobs for the SPT schedule.
e)
Summary Introduction
To calculate: The average completion time, average job lateness and the average number of jobs for the LPT schedule.
f)
Summary Introduction
To explain: The best decision rule based on average completion time.
g)
Summary Introduction
To identify: The job that is late with the SPT rule.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
At 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…
Using Johnson's rule for 2-machine scheduling, the sequence is:
Scheduled Order
Job
1
▼
B
C
E
F
A
D
Part 2
2
▼
F
C
A
D
B
E
Part 3
3
▼
A
B
D
F
C
E
Part 4
4
▼
E
D
C
B
F
A
Part 5
5
▼
F
C
D
A
E
B
Part 6
6
▼
D
C
F
B
E
A
Part 7
For the schedule developed using Johnson's rule, the total length of time taken to complete the six jobs (including the 2nd operation) =
enter your response here
hours (enter your response as a whole number).
...
Question content area right
Part 1
Six jobs are to be processed through a two-step operation. The first operation involves sanding, and the second involves painting. Processing times are as follows:
Job
Operation 1 (hours)
Operation 2 (hours)
A
4
8
B
10
5
C
3
11
D…
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
Chapter 15 Solutions
Pearson Etext For Principles Of Operations Management: Sustainability And Supply Chain Management -- Access Card (11th Edition)
Ch. 15 - Prob. 1EDCh. 15 - Prob. 1DQCh. 15 - Prob. 2DQCh. 15 - Prob. 3DQCh. 15 - Prob. 4DQCh. 15 - Prob. 5DQCh. 15 - Prob. 6DQCh. 15 - Prob. 7DQCh. 15 - Prob. 8DQCh. 15 - Prob. 9DQ
Ch. 15 - Prob. 10DQCh. 15 - Prob. 11DQCh. 15 - Prob. 12DQCh. 15 - Prob. 13DQCh. 15 - Prob. 1PCh. 15 - Prob. 2PCh. 15 - Prob. 3PCh. 15 - Prob. 4PCh. 15 - Prob. 5PCh. 15 - Prob. 6PCh. 15 - Prob. 7PCh. 15 - Prob. 8PCh. 15 - Prob. 9PCh. 15 - Prob. 10PCh. 15 - Prob. 11PCh. 15 - Prob. 12PCh. 15 - Prob. 13PCh. 15 - Prob. 14PCh. 15 - Prob. 15PCh. 15 - Prob. 16PCh. 15 - Prob. 17PCh. 15 - Prob. 18PCh. 15 - Prob. 19PCh. 15 - Prob. 20PCh. 15 - Prob. 21PCh. 15 - Prob. 22PCh. 15 - Prob. 23PCh. 15 - Prob. 24PCh. 15 - Prob. 25PCh. 15 - Prob. 26PCh. 15 - Prob. 27PCh. 15 - Prob. 28PCh. 15 - Daniels Barber Shop at Newark Airport is open 7...Ch. 15 - Given the following demand for waiters and...Ch. 15 - Prob. 1CSCh. 15 - Prob. 2CSCh. 15 - Prob. 3CSCh. 15 - Prob. 4CSCh. 15 - Prob. 1.1VCCh. 15 - Prob. 1.2VCCh. 15 - Prob. 1.3VCCh. 15 - Prob. 2.1VCCh. 15 - Prob. 2.2VCCh. 15 - Why is seniority important in scheduling servers?Ch. 15 - Prob. 2.4VC
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
- What does it mean for a process to be "starved" according to the priority scheduling method? What are some ways that this may be avoided?arrow_forwardAllocate the tasks to workstations taking into consideration the precedence requirements and using the LOT rule to break ties between feasible tasks.arrow_forwardUsing the FCFS rule for scheduling, the sequence is ▼ 1-3-2 3-1-2 1-2-3 2-1-3 2-3-1 3-2-1 . Part 2 For the schedule developed using the FCFS rule, the total length of time taken to complete the three suits (including delivery) = enter your response here hours (enter your response as a whole number). Part 3 Using Johnson's rule for 2-machine scheduling, the sequence is ▼ 3-1-2 1-2-3 2-1-3 3-2-1 2-3-1 1-3-2 . Part 4 For the schedule developed using the Johnson's rule, the total length of time taken to complete the three suits (including delivery) = enter your response here hours (enter your response as a whole number). Part 5 Of the two developed schedules, ▼ Johnson's the FCFS rule gets the schedule finished sooner. ... Question content area right Part 1 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…arrow_forward
- The day when the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average past due days. Make a comment.arrow_forwardTwo jobs must be processed through four machines in the same order. The processing times in the required sequence are (given) Determine how the two jobs should be scheduled in order to minimize the total makespan, and draw the Gantt chart indicating the optimal schedule.arrow_forwardRon 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_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_forwardUsing the information presented in the following table, identify the processing sequence that wouldresult using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, determine (1) average jobflow time, (2) average job tardiness, and (3) average number of jobs in the system. Jobs are listedin order of arrival. (Hint: First determine the total job time for each job by computing the total processing time for the job and then adding in the setup time. All times and due dates are in hours.)JobProcessingTime per UnitUnitsper JobSetupTimeDueDatea .14 45 0.7 4b .25 14 0.5 10c .10 18 0.2 12d .25 40 1.0 20e .10 75 0.5 15arrow_forwardA producer of inkjet printers is planning to add a new line of printers, and you have been asked to balance the process, given the following task times and precedence relationships. Assume that cycle time is to be the minimum possible. Task Length(minutes) Immediate(Predecessor) a 0.2 - b 0.4 a c 0.3 - d 1.3 b, c e 0.1 - f 0.8 e g 0.3 d, f h 1.2 g Click here for the Excel Data File a. Do each of the following: (1) Enter the number of following tasks for each of the tasks shown in the table below. (2) Assign tasks to stations in order of greatest number of following tasks. Use greatest positional weight as a tiebreaker rule. (3) Determine the percentage of idle time. (Round your answer to 2 decimal places.) (4) Compute the rate of output in printers per day that could be expected for this line, assuming a 420-minute working day. (Round your answer 2 decimal places.) b. Answer these questions: (1) What is the…arrow_forward
- The Mowry Machine Shop still has five jobs to be processedas of 8 a.m. today (day 23) at its bottleneck operation. The daywhen the order arrived, processing time, and promised duedates are given in the following table. The jobs are listed inthe order of arrival.a. Develop separate schedules by using the FCFS and EDDrules. Compare the schedules on the basis of averageflow time and average days past due.b. Which rule gives the best schedule, in your judgment?Why?arrow_forwardEvan Schwartz has six jobs waiting to be processedthrough his machine. Processing time (in days) and duedate information for each job are as follows:Sequence the jobs by FCFS, SPT, SLACK, and DDATE.Calculate the mean flow time and mean tardiness of the sixjobs under each sequencing rule. Which rule would yourecommend?arrow_forwardUsing 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).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