Operations Management
Operations Management
13th Edition
ISBN: 9781259667473
Author: William J Stevenson
Publisher: McGraw-Hill Education
bartleby

Concept explainers

bartleby

Videos

Textbook Question
Book Icon
Chapter 16, Problem 17P

Given the following information on job times and due dates, determine the optimal processing sequence using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, find the average job flow time and the average job tardiness. Jobs are listed in order of arrival.

Chapter 16, Problem 17P, Given the following information on job times and due dates, determine the optimal processing

1)

Expert Solution
Check Mark
Summary Introduction

To determine: Sequence of jobs based on decision rule First Come First Served (FCFS).

Introduction: First Come First Served is the scheduling rule, which helps to arrange the sequence in the order. Here, the first come would be served first.

Answer to Problem 17P

The sequence is a-b-c-d-e-f.

Explanation of Solution

Given information:

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

Determine the sequence using FCFS:

According to FCFS, the first come would be served first. Hence, the jobs should be sequenced in the order as per its arrival.

Hence, the sequence of jobs using FCFS is a-b-c-d-e.

2)

Expert Solution
Check Mark
Summary Introduction

To determine: Sequence of jobs based on decision rule Shortest Processing Time (SPT).

Introduction: Shortest Processing Tine is the scheduling rule, which helps to arrange the sequence in the order. Here, job with the shortest duration would be served first. Then, the process would be going on from shortest to largest duration.

Answer to Problem 17P

The sequence is b-e-a-c-d-f.

Explanation of Solution

Given information:

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

Determine the sequence using SPT:

According to SPT, the job that has the shortest processing would be served first and it goes on as the processing time increase. Duration should be assembled in the ascending order

Hence, the sequence of jobs using SPT is b-e-a-c-d-f.

3)

Expert Solution
Check Mark
Summary Introduction

To determine: Sequence of jobs based on decision rule Earliest Due Date (EDD).

Introduction: Earliest Due Date is the scheduling rule, which helps to arrange the sequence in the order. Here, job with the earliest due date would be served first. Then, the process would be going on from earliest due date to latest due date.

Answer to Problem 17P

The sequence is e-b-a-c-f-d.

Explanation of Solution

Given information:

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

Determine the sequence using EDD:

According to EDD, the job that has the earliest due date would be served first and it goes on as the due date increases. The job should be arranged based on due date. Due date should be assembled in the ascending order

Hence, the sequence of jobs using EDD is e-b-a-c-f-d.

4)

Expert Solution
Check Mark
Summary Introduction

To determine: Sequence of jobs based on decision rule critical ratio.

Introduction: Critical ratio is kind of scheduling rule that helps to identify that, the task or job is on the correct track. It would help to identify if the task is behind or ahead of the schedule.

Answer to Problem 17P

The sequence is e-a-b-f-c-d.

Explanation of Solution

Given information:

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

Determine the sequence using critical ratio:

Initial critical ratio should be determined at day 0:

Job Job time (hours) Due date (hours) Critical ratio
a 3.5 7 2.
b 2.0 6 3
c 4.5 18 4
d 5.0 22 4.4
e 2.5 4 1.6
f 6.0 20 3.33

Critical ratio for Job a:

It is can be determined by dividing the value attained by subtracting the completion day of previous job from the due date of current job with the processing time.

Critical ratio=Due dateCompletion day of completed jobProcessing time=703.5=2

Note: The procedure continues for all the jobs.

Job e has the lowest critical ratio. Thus, it will be completed first. Hence, Job e would be completed first in the sequence of jobs.

Determine the critical ratio after the completion of Job a:

As the processing time of job a is 2.5 hours, completion day of completed day would be 2.5.

Job Job time (hours) Due date (hours) Critical ratio
a 3.5 7 1.29
b 2.0 6 1.75
c 4.5 18 3.44
d 5.0 22 3.90
e      
f 6.0 20 2.90

Critical ratio for Job a:

It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.

Critical ratio=Due dateCompletion day of completed jobProcessing time=72.53.5=1.29

Note: The procedure continues for all the jobs.

Job a has the lowest critical ratio. Hence, Job a would be completed next in the sequence of jobs after Job e.

Determine the critical ratio after the completion of Job e and Job a:

As the processing time of job e is 2.5 hours and Job a is 3.5, completion day of completed day would be 6 (2.5+3.5).

Job Job time (hours) Due date (hours) Critical ratio
a      
b 2.0 6 0
c 4.5 18 2.67
d 5.0 22 3.20
       
f 6.0 20 2.33

Critical ratio for Job b:

It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.

Critical ratio=Due dateCompletion day of completed jobProcessing time=662=0

Note: The procedure continues for all the jobs.

Job b has the lowest critical ratio. Hence, Job b would be completed next in the sequence of jobs after Job e and Job a.

Determine the critical ratio after the completion of Job e, Job a, and Job b:

As the processing time of job e is 2.5 hours, Job a is 3.5, and Job b is 2. Completion day of completed day would be 8 (2.5+3.5+2).

Job Job time (hours) Due date (hours) Critical ratio
a      
b      
c 4.5 18 2.22
d 5.0 22 2.80
       
f 6.0 20 2.00

Critical ratio for Job c:

It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.

Critical ratio=Due dateCompletion day of completed jobProcessing time=1884.5=2.22

Note: The procedure continues for all the jobs.

Job f has the lowest critical ratio. Hence, Job f would be completed next in the sequence of jobs.

Determine the critical ratio after the completion of Job e, Job a, Job b, and Job f:

As the processing time of job e is 2.5 hours, Job a is 3.5, Job b is 2, and Job f is 6.0. Completion day of completed day would be 14 (2.5+3.5+2+6).

Job Job time (hours) Due date (hours) Critical ratio
a      
b      
c 4.5 18 2.22
d 5.0 22 2.80
       
f      

Critical ratio for Job c:

It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.

Critical ratio=Due dateCompletion day of completed jobProcessing time=18144.5=0.89

Note: The procedure continues for all the jobs.

Job c has the lowest critical ratio. Hence, Job c would be completed next in the sequence of jobs.

As Job d is the remaining job, it will be completed next.

Hence, the sequence of jobs using critical ratio is e-a-b-f-c-d.

Determine the average flow time and average tardiness:

First Come First Served:

Job Job time (hours) Due date (hours) Flow time Tardiness
a 3.5 7 3.5  
b 2.0 6 5.5  
c 4.5 18 10.0  
d 5.0 22 15.0  
e 2.5 4 17.5 13.5
f 6.0 20 23.5 3.5
Total 23.5   75.0 17.0

Supporting calculation:

Processing time and due date are given for each job. Flow time is the cumulative of the processing time.

Tardiness of Job a, Job, b, Job c, and Job d:

Flow time of Job a, Job b, Job c, and Job d is less than its respective due date. Hence, there would be no tardiness.

Tardiness of Job e:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job e is 13.5.

Tardiness=Flow timeDue date=17.54=13.5

Tardiness of Job f:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job f is 3.5.

Tardiness=Flow timeDue date=23.520=3.5

Average flow time:

It is calculated by dividing the total flow time and number of jobs.

Average flow time=Total flow timeNumber of jobs=756=12.5 hours

Hence, average flow time is 12.5 hours.

Average tardiness:

It is calculated by dividing the total tardiness and number of jobs.

Average tardiness=Total tardinessNumber of jobs=176=2.83 hours

Hence, average tardiness is 2.83 hours

Shortest processing time:

Job Job time (hours) Due date (hours) Flow time Tardiness
b 2.0 6 2.0  
e 2.5 4 4.5 0.5
a 3.5 7 8.0 1.0
c 4.5 18 12.5  
d 5.0 22 17.5  
f 6.0 20 23.5 3.5
Total 23.5   68.0 5.0

Supporting calculation:

Processing time and due date are given for each job. Flow time is the cumulative of the processing time.

Tardiness of Job b, Job c, and Job d:

Flow time of Job b, Job c, and Job d is less than its respective due date. Hence, there would be no tardiness.

Tardiness of Job e:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job e is 0.5.

Tardiness=Flow timeDue date=4.54=0.5

Tardiness of Job a:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job a is 1.

Tardiness=Flow timeDue date=87=1

Tardiness of Job f:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job f is 3.5.

Tardiness=Flow timeDue date=23.520=3.5

Average flow time:

It is calculated by dividing the total flow time and number of jobs.

Average flow time=Total flow timeNumber of jobs=686=11.33 hours

Hence, average flow time is 11.33 hours.

Average tardiness:

It is calculated by dividing the total tardiness and number of jobs.

Average tardiness=Total tardinessNumber of jobs=56=0.83 hours

Hence, average tardiness is 0.83 hours

Earliest Due Date:

Job Job time (hours) Due date (hours) Flow time Tardiness
e 2.5 4 2.5  
b 2.0 6 4.5  
a 3.5 7 8.0 1.0
c 4.5 18 12.5  
f 6.0 20 18.5  
d 5.0 22 23.5 1.5
Total 23.5   69.5 2.5

Supporting calculation:

Processing time and due date are given for each job. Flow time is the cumulative of the processing time.

Tardiness of Job e, Job b, Job c, and Job f:

Flow time of Job e, Job b, Job c, and Job f is less than its respective due date. Hence, there would be no tardiness.

Tardiness of Job a:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job a is 1.

Tardiness=Flow timeDue date=87=1

Tardiness of Job d:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job d is 1.5.

Tardiness=Flow timeDue date=23.522=1.5

Average flow time:

It is calculated by dividing the total flow time and number of jobs.

Average flow time=Total flow timeNumber of jobs=69.56=11.58 hours

Hence, average flow time is 11.58 hours.

Average tardiness:

It is calculated by dividing the total tardiness and number of jobs.

Average tardiness=Total tardinessNumber of jobs=2.56=0.42 hours

Hence, average tardiness is 0.42 hours

Critical ratio:

Job Job time (hours) Due date (hours) Flow time Tardiness
e 2.5 4 2.5  
a 3.5 7 6.0  
b 2.0 6 8.0 2.0
f 6.0 20 14.0  
c 4.5 18 18.5 0.5
d 5.0 22 23.5 1.5
Total 23.5   72.5 4.0

Supporting calculation:

Processing time and due date are given for each job. Flow time is the cumulative of the processing time.

Tardiness of Job e, Job a, and Job f:

Flow time of Job e, Job a, and Job f is less than its respective due date. Hence, there would be no tardiness.

Tardiness of Job b:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job b is 2.

Tardiness=Flow timeDue date=86=2

Tardiness of Job c:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job c is 0.5.

Tardiness=Flow timeDue date=18.518=0.5

Tardiness of Job d:

It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job d is 1.5.

Tardiness=Flow timeDue date=23.522=1.5

Average flow time:

It is calculated by dividing the total flow time and number of jobs.

Average flow time=Total flow timeNumber of jobs=72.56=12.08 hours

Hence, average flow time is 12.08 hours.

Average tardiness:

It is calculated by dividing the total tardiness and number of jobs.

Average tardiness=Total tardinessNumber of jobs=46=0.67hours

Hence, average tardiness is 0.67 hours.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
What are the benefits and drawbacks of the shortest processing time rule (SPT)?
Given 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 tardiness
Using 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 15

Chapter 16 Solutions

Operations Management

Ch. 16 - Prob. 11DRQCh. 16 - What general trade-offs are involved in sequencing...Ch. 16 - Prob. 2TSCh. 16 - Prob. 3TSCh. 16 - One approach that can be effective in reducing the...Ch. 16 - Doctors and dentists offices frequently schedule...Ch. 16 - Prob. 3CTECh. 16 - Use the assignment method to determine the best...Ch. 16 - Rework Problem 1, treating the numbers in the...Ch. 16 - Assign trucks to delivery routes so that total...Ch. 16 - Develop an assignment plan that will minimize...Ch. 16 - Use the assignment method to obtain a plan that...Ch. 16 - The following table contains information...Ch. 16 - Using the information presented in the following...Ch. 16 - The following table shows orders to be processed...Ch. 16 - A wholesale grocery distribution center uses a...Ch. 16 - The times required to complete each of eight jobs...Ch. 16 - Prob. 11PCh. 16 - A shoe repair operation uses a two-step sequence...Ch. 16 - The following schedule was prepared by the...Ch. 16 - The production manager must determine the...Ch. 16 - A foreman has determined processing times at a...Ch. 16 - Given the information in the following table,...Ch. 16 - Given the following information on job times and...Ch. 16 - Prob. 18PCh. 16 - The following table contains order-dependent setup...Ch. 16 - The following table contains order-dependent setup...Ch. 16 - Prob. 21PCh. 16 - Given this information on planned and actual...Ch. 16 - Given the following data on inputs and outputs at...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Prob. 1CQ
Knowledge Booster
Background pattern image
Operations Management
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Text book image
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Text book image
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Text book image
Business in Action
Operations Management
ISBN:9780135198100
Author:BOVEE
Publisher:PEARSON CO
Text book image
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
Text book image
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