SlideShare a Scribd company logo
4.3 Priority Sequencing Rules
 Priority Rules provide guidelines for the
sequence in which jobs should be worked.
 In using this rules, job processing times and
due dates are important pieces of information.
 Priority Rules try to minimize completion time,
number of jobs in the system, and job
lateness, while maximizing facility utilization.
4.3 Priority Sequencing Rules
 4 types
 First come, first served (FCFS)
 Shortest processing time (SPT)
 Earlier due date (EDD)
 Critical Ratio (CR)
4.3 Priority Sequencing Rules
 First come, first served (FCFS)
 Jobs are processed in the order in which they arrive at a
machine or work center.
 Shortest processing time (SPT)
 Jobs are processed according to processing time at a
machine or work center, shortest job first.
 Earlier due date (EDD)
 Jobs are processed according t due date, earlier due date
first.
 Critical Ratio (CR)
 Jobs are processed according to smallest ratio of time
remaining until due date to processing time remaining.
4.3.1 Sequencing Rules:
First Come, First Served (FCFS) Example 1
Jo
b
Days to
Finish
Date
Promised
A 2 5
B 8 8
C 6 12
D 4 10
E 1 4
Sequenc
e
Work
Time
Flow
Time
Due
Date Lateness
A 2 2 5 0
B 8 10 8 2
C 6 16 12 4
D 4 20 10 10
E 1 21 4 17
TOTALS 21 69 33
SOLUTION
:
Five jobs are to be done at custom furniture
shop:
Measure of effectiveness:
Flow time: is the amount of time a
job spent in shop/factory
Total work time/makespan: is the
time needed to process given set of
jobs
Lateness: different between
completion time and due date (if (–
ve) put it zero)
Note!
Do all the jobs get done on time?
No, Jobs B, C,
D and E are
going to be late
#Average completion time = Total flow time ÷ No. of jobs
#Average number of jobs = Total flow time ÷ Total job work time
In the system
#Average job lateness = Total late days ÷ No. of jobs
#Utilization = Total job work time÷ Total flow time = in %
Performance measuring formula:
4.3.1 Sequencing Rules:
First Come, First Served (FCFS) Example 1
Five jobs are to be assemble in AHP Plastic Sdn. Bhd.:
4.3.1 Sequencing Rules:
First Come, First Served (FCFS) Example 2
SOLUTION:
4.3.1 Sequencing Rules:
First Come, First Served (FCFS) Example 2
 Shortest Processing Time. Jobs with the
shortest processing time are scheduled
first.
 Jobs are sequenced in increasing order of
their processing time.
 Shortest processing time is optimal for
minimizing:
 Average and total flow time
 Average waiting time
 Average and total lateness
4.3.2 Sequencing Rules:
Shortest Processing Time (SPT)
The steps for using this rule are :
1. Firstly, the user will input the number of jobs, the
job names, the processing time and the due date of
each job or use the data values given at the starting
point.
2. The second step is sorting out the shortest
processing time among the jobs.
3. Thirdly, calculate the flow time of each job by using
the processing time. The flow time is the
accumulation of processing time each job by each
4.3.2 Sequencing Rules:
Shortest Processing Time (SPT)
Jobs (in order Processing Due Date
of arrival) Time (days) (days hence)
A 4 5
B 7 10
C 3 6
D 1 4
Suppose we have the four jobs to the right arrive for processing
on one machine
4.3.2 Sequencing Rules:
Shortest Processing Time (SPT) Example 1
Average completion time 28/4 = 7 days
Average number of jobs in the system 28/15 = 1.867 jobs
Average lateness 8/4 = 2days
Utilization 15/28 = 53.57%
4.3.2 Sequencing Rules:
Shortest Processing Time (SPT) Example 1
Sequence Work
Time Flow Time Due
Date Lateness
D 1 1 4 0
C 3 4 6 0
A 4 8 5 3
B 7 15 10 5
TOTAL 15 28 8
Answer: Shortest Operating Time Schedule
Jobs A and B
are going to
be late
Job sequence Processing Time Due Date
A(turning)
B(drilling)
C(grinding)
D(milling)
E( facing)
6
2
8
3
9
8
6
18
15
23
4.3.2 Sequencing Rules:
Shortest Processing Time (SPT) Example 2
• A Brake Pad have 5 process that will undergo before it will be
produce at a particular point in time . The jobs are labeled A, B, C,
D, and E in the order that they entered the shop. The respective
processing times and due dates are given in the table below.
Determine the schedule by using the SPT rule.
Solution:
4.3.2 Sequencing Rules:
Shortest Processing Time (SPT) Example 2
Average completion time 65/5 = 13 days
Average number of jobs in the system 65/28 = 2.3214 jobs
Average lateness 9/5 = 1.8 days
Utilization 28/65 = 43.08%
4.3.2 Sequencing Rules:
Shortest Processing Time (SPT) Example 2
#Average completion time = Total flow time ÷ No. of jobs
#Average number of jobs = Total flow time ÷ Total job work time
In the system
#Average job lateness = Total late days ÷ No. of jobs
#Utilization = Total job work time÷ Total flow time = in %
 Jobs are sequenced in increasing order of their due
dates;
 The job with earliest due date is first, the one with the
next earliest due date is second, and so on;
 A priority sequencing rule that specifies that the job
with the earliest due date is the next job to be
processed
4.3.3 Sequencing Rules:
Earliest Due Date (EDD)
The steps for using this rule are :
1. Firstly, the user will input the number of jobs, the
job names, the processing time and the due date
of each job or use the data values given at the
starting point.
2. The second step is sorting out the earliest due
date among the jobs.
3. Thirdly, calculate the flow time of each job by
using the processing time. The flow time is the
accumulation of processing time each job by
4.3.3 Sequencing Rules:
Earliest Due Date (EDD)
•The formulas for calculation are below:
#Average completion time = Total flow time ÷ No. of jobs
#Average number of jobs = Total flow time ÷ Total job work time
In the system
#Average job lateness = Total late days ÷ No. of jobs
#Utilization = Total job work time÷ Total flow time = in %
4.3.3 Sequencing Rules:
Earliest Due Date (EDD)
• Five engine blocks are waiting for processing. The
processing times have been estimated. Expected
completion times have been agreed. The table shows
the processing time and due date of those 5 engines.
• Determine the schedule by using the EDD rule.
Engine Block Processing
Time (Days)
Due Date
(Days)
Ranger 8 10
Explorer 6 12
Bronco 15 20
Econoline 150 3 18
Thunderbird 12 22
4.3.3 Sequencing Rules:
Earliest Due Date (EDD) Example 1
Engine (1) (2) (3) (2)-(3)
Block Processing Completion Due Days Tardy
Sequence Time Time Date (0 if negative)
Ranger 8 10
Explorer 6 12
Econoline 150 3 18
Bronco 15 20
Thunderbird 12 22
8 0
32 12
14 2
17 0
44 22
Total 44 85 36
4.3.3 Sequencing Rules:
Earliest Due Date (EDD) Example 1
Average completion time 85/5 = 17 days
Average number of jobs in the system 85/44 = 1.9318 jobs
Average tardiness 36/5 = 7.2 days
Utilization 44/85 = 51.76%
Is an index number computed by dividing the time
remaining until due date by the work time remaining.
The critical ratio gives priority to jobs that must be
done to keep shipping on schedule.
The critical ratio is measure of urgency of any order
compared to the other orders for the same facility.
The ratio is based on when the completed order is
required and how much time is required to complete.
4.3.4 Sequencing Rules:
Critical Ratio (CR)
•The step for using this rule are:
1. At the starting program, user input the numbers of
job, the jobs name, the works day remaining and the
due date of each job and as well the today's date.
2. The today's date and the number of job are just
inputted once time. Then, the others are followed the
value of the number of jobs inputted. After that,
compute the critical ratio by using the formula.
3. The formula for Critical Ratio is:
CR = time remaining / works day remaining
4. After calculating the CR for each job, give the priority
order by using the value of the calculated critical ratio.
The priority order is performed from smaller to larger.
4.3.4 Sequencing Rules:
Critical Ratio (CR)
• There are 3 characteristics can be seen
from the critical ratio:
 A job with low critical ratio(less than 1.0) -
--- falling behind schedule.
 If CR is exactly 1.0 ---- the job is on
schedule.
 If CR is greater than 1.0 ---- the job is
ahead of schedule and has some slack.
4.3.4 Sequencing Rules:
Critical Ratio (CR)
•The critical ratio help in most production scheduling
system as below:
Determine the status of specific job.
Establish relative priority among jobs on a common basis.
Relate both stock and make-to-order jobs on a common
basis.
Adjust priorities (and revise schedules) automatically for
changes in both demand and job progress.
Dynamically track job progress and location.
4.3.4 Sequencing Rules:
Critical Ratio (CR)
•A machine center in a job shop for a local fabrication company
has five unprocessed jobs remaining at a particular point in time.
The jobs are labeled 1, 2, 3, 4, and 5 in the order that they
entered the shop. The respective processing times and due
dates are given in the table below.
•Sequence the 5 jobs by CR rules.
Job number Processing Time Due Date
1
2
3
4
5
11
29
31
1
2
61
45
31
33
32
4.3.4 Sequencing Rules:
Critical Ratio (CR) Example 1
Current time: t=0
Job number Processing Time Due Date Critical Ratio
1
2
3
4
5
11
29
31
1
2
61
45
31
33
32
61/11(5.545)
45/29(1.552)
31/31(1.000)
33/1 (33.00)
32/2 (16.00)
Current time: t=31
Job number Processing Time Due Date-Current Time Critical Ratio
1
2
4
5
11
29
1
2
30
14
2
1
30/11(2.727)
14/29(0.483)
2/1 (2.000)
1/2 (0.500)
Current time should be reset after scheduling one job
4.3.4 Sequencing Rules:
Critical Ratio (CR) Example 1
Current time=60
Job number Processing Time Due Date-
Current Time
Critical Ratio
1
4
5
11
1
2
1
-27
-28
1/11(0.0909)
-27/1<0
-28/2<0
Both Jobs 4 and 5 are later, however Job 4 has shorter processing time
and thus is scheduled first; Finally, job 1 is scheduled last.
4.3.4 Sequencing Rules:
Critical Ratio (CR) Example 1
Average completion time 289/5 = 57.8 days
Average number of jobs in the system 289/74 = 3.905 jobs
Average tardiness 87/5 = 17.4 days
Utilization 74/289 = 25.61%
Job number Processing
Time
Completion
Time
Due Date Tardiness
3
2
4
5
1
31
29
1
2
11
31
60
61
63
74
31
45
33
32
61
0
15
28
31
13
Totals 74 289 87
4.3.4 Sequencing Rules:
Critical Ratio (CR) Example 1
4 Rules Application - Example
Job number Processing Time Due Date
A
B
C
D
E
F
2
8
4
10
5
12
7
16
4
17
15
18
Processing Time (including setup times) and due dates for six jobs waiting
to be processed at a work center are given in the following table.
Determine the sequence of jobs, the average flow time, average tardiness,
and number of jobs at the work center, for each of these rules:
•FCFS
•SPT
•EDD
•CR
4 Rules Application – Example
(FCFS)
Job
Sequence
Processing
Time
Flow Time Due Date Tardiness
A
B
C
D
E
F
2
8
4
10
5
12
2
10
14
24
29
41
7
16
4
17
15
18
0
0
10
7
14
23
Totals 41 120 54
Average completion time 120/6 = 20 days
Average number of jobs in the system 120/41 = 2.93 jobs
Average tardiness 54/6 = 9 days
Utilization 41/120 = 34.17%
4 Rules Application – Example
(SPT)
Job
Sequence
Processing
Time
Flow Time Due Date Tardiness
A
C
E
B
D
F
2
4
5
8
10
12
2
6
11
19
29
41
7
4
15
16
17
18
0
2
0
3
12
23
Totals 41 108 40
Average completion time 108/6 = 18 days
Average number of jobs in the system 108/41 = 2.63 jobs
Average tardiness 40/6 = 6.67 days
Utilization 41/108 = 37.96%
4 Rules Application – Example
(EDD)
Job
Sequence
Processing
Time
Flow Time Due Date Tardiness
C
A
E
B
D
F
4
2
5
8
10
12
4
6
11
19
29
41
4
7
15
16
17
18
0
0
0
3
12
23
Totals 41 110 38
Average completion time 110/6 = 18.33 days
Average number of jobs in the system 110/41 = 2.68 jobs
Average tardiness 38/6 = 6.33 days
Utilization 41/110 = 37.27%
4 Rules Application – Example
(CR)
Job Sequence Processing Time Due Date Critical Ratio
Calculation
A
B
C
D
E
F
2
8
4
10
5
12
7
16
4
17
15
18
(7-0) / 2 = 3.5
(16-0) / 8 = 2.0
(4-0) / 4 = 1.0 (Lowest)
(17-0) / 10 = 1.7
(15-0) / 5 = 3.0
(18-0) / 12 = 1.5
At t=0,
•Job C is the first job to complete base on the lowest
critical ratio.
4 Rules Application – Example
(CR)
Job Sequence Processing Time Due Date Critical Ratio
Calculation
A
B
C
D
E
F
2
8
-
10
5
12
7
16
-
17
15
18
(7-4) / 2 = 1.5
(16-4) / 8 = 1.5
-
(17-4) / 10 = 1.3
(15-4) / 5 = 2.2
(18-4) / 12 = 1.17 (Lowest)
At t=4, day 4 [C completed],
•Job F is the second job to complete base on the
lowest critical ratio.
4 Rules Application – Example
(CR)
Job Sequence Processing Time Due Date Critical Ratio
Calculation
A
B
C
D
E
F
2
8
-
10
5
-
7
16
-
17
15
-
(7-16) / 2 = -4.5 (Lowest)
(16-16) / 8 = 0
-
(17-16) / 10 = 0.1
(15-16) / 5 = -0.2
-
At t=16, day 16 [C and F completed],
•Job A is the third job to complete base on the
lowest critical ratio.
4 Rules Application – Example
(CR)
Job Sequence Processing Time Due Date Critical Ratio Calculation
A
B
C
D
E
F
-
8
-
10
5
-
-
16
-
17
15
-
-
(16-18) / 8 = -0.25
-
(17-18) / 10 = -0.10
(15-18) / 5 = -0.60 (Lowest)
-
At t=18, day 18 [C, F and A completed],
•Job E is the fourth job to complete base on the
lowest critical ratio.
4 Rules Application – Example
(CR)
Job Sequence Processing Time Due Date Critical Ratio Calculation
A
B
C
D
E
F
-
8
-
10
-
-
-
16
-
17
-
-
-
(16-23) / 8 = -0.875 (Lowest)
-
(17-23) / 10 = -0.60
-
-
At t=23, day 23 [C, F, A and E completed],
•Job B is the fifth job to complete base on the lowest
critical ratio and follow by Job D in last.
4 Rules Application – Example
(CR)
Job
Sequence
Processing
Time
Flow Time Due Date Tardiness
C
F
A
E
B
D
4
12
2
5
8
10
4
16
18
23
31
41
4
18
7
15
16
17
0
0
11
8
15
24
Totals 41 133 58
Average completion time 133/6 = 22.17 days
Average number of jobs in the system 133/41 = 3.24 jobs
Average tardiness 58/6 = 9.67 days
Utilization 41/133 = 30.83%
Rules Average Flow
Time (days)
Average
Tardiness
(days)
Average
Number of
Jobs at the
Work Center
Utilization (%)
FCFS
SPT
EDD
CR
20.00
18.00
18.33
22.17
9.00
6.67
6.33
9.67
2.93
2.63
2.68
3.24
34.17
37.96
37.27
30.83
4 Rules Application – Example
(CR)

More Related Content

What's hot

Scheduling ppt @ DOMS
Scheduling ppt @ DOMSScheduling ppt @ DOMS
Scheduling ppt @ DOMS
Babasab Patil
 
Aggregate planning
Aggregate planningAggregate planning
Aggregate planningAtif Ghayas
 
Job shop scheduling
Job shop schedulingJob shop scheduling
Job shop scheduling
Sujeet TAMBE
 
Sequencing problems in Operations Research
Sequencing problems in Operations ResearchSequencing problems in Operations Research
Sequencing problems in Operations Research
Abu Bashar
 
Capacity Management
Capacity ManagementCapacity Management
Capacity Management
Antonio Gonzalez
 
COMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEP
COMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEPCOMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEP
COMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEP
MANI KRISHNA
 
Line balancing
Line balancingLine balancing
Line balancing
Hiwa Gaffari
 
Performance rating
Performance ratingPerformance rating
Performance rating
Shivam Kumar
 
Forward scheduling vs. backward scheduling in production planning
Forward scheduling vs. backward scheduling in production planningForward scheduling vs. backward scheduling in production planning
Forward scheduling vs. backward scheduling in production planning
MRPeasy
 
production scheduling
production schedulingproduction scheduling
production scheduling
PraveenManickam2
 
Manufacturing planning & control (mpc) system
Manufacturing planning & control (mpc) systemManufacturing planning & control (mpc) system
Manufacturing planning & control (mpc) system
Yash Dave
 
Cellular Manufacturing
Cellular Manufacturing Cellular Manufacturing
Cellular Manufacturing sgrsoni45
 
Lot Sizing Techniques
Lot Sizing TechniquesLot Sizing Techniques
Lot Sizing Techniques
Anand Subramaniam
 

What's hot (20)

Scheduling ppt @ DOMS
Scheduling ppt @ DOMSScheduling ppt @ DOMS
Scheduling ppt @ DOMS
 
Ch17 scheduling
Ch17 schedulingCh17 scheduling
Ch17 scheduling
 
Aggregate planning
Aggregate planningAggregate planning
Aggregate planning
 
Work sample
Work sampleWork sample
Work sample
 
Aggregate planning
Aggregate planningAggregate planning
Aggregate planning
 
Line balancing
Line balancingLine balancing
Line balancing
 
Job shop scheduling
Job shop schedulingJob shop scheduling
Job shop scheduling
 
Sequencing problems in Operations Research
Sequencing problems in Operations ResearchSequencing problems in Operations Research
Sequencing problems in Operations Research
 
Capacity Management
Capacity ManagementCapacity Management
Capacity Management
 
COMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEP
COMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEPCOMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEP
COMPUTERIZED LAYOUT METHODS ,CRAFT , ALDEP
 
Line balancing
Line balancingLine balancing
Line balancing
 
Ch09
Ch09Ch09
Ch09
 
Performance rating
Performance ratingPerformance rating
Performance rating
 
Forward scheduling vs. backward scheduling in production planning
Forward scheduling vs. backward scheduling in production planningForward scheduling vs. backward scheduling in production planning
Forward scheduling vs. backward scheduling in production planning
 
production scheduling
production schedulingproduction scheduling
production scheduling
 
Manufacturing planning & control (mpc) system
Manufacturing planning & control (mpc) systemManufacturing planning & control (mpc) system
Manufacturing planning & control (mpc) system
 
Ch03pp
Ch03ppCh03pp
Ch03pp
 
assembly line balancing
assembly line balancingassembly line balancing
assembly line balancing
 
Cellular Manufacturing
Cellular Manufacturing Cellular Manufacturing
Cellular Manufacturing
 
Lot Sizing Techniques
Lot Sizing TechniquesLot Sizing Techniques
Lot Sizing Techniques
 

Similar to scheduling-sequencing-rules.pptx

programming .pptx
programming .pptxprogramming .pptx
programming .pptx
SHUJEHASSAN
 
C8 scheduling
C8 schedulingC8 scheduling
C8 scheduling
hakimizaki
 
Scheduling
SchedulingScheduling
Schedulingjaya_22
 
Scheduling
SchedulingScheduling
Scheduling
manobili17
 
SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...
SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...
SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...
IJCSES Journal
 
Chapter 6-Scheduling in Industrial of Engineering
Chapter 6-Scheduling in Industrial of EngineeringChapter 6-Scheduling in Industrial of Engineering
Chapter 6-Scheduling in Industrial of Engineering
FaizAzmy2
 
scheduling Uni processor Long-term .ppt
scheduling  Uni processor Long-term .pptscheduling  Uni processor Long-term .ppt
scheduling Uni processor Long-term .ppt
Saba651353
 
Process Scheduling
Process SchedulingProcess Scheduling
Process Scheduling
vampugani
 
Operations Research_18ME735_module 5 sequencing notes.pdf
Operations Research_18ME735_module 5 sequencing notes.pdfOperations Research_18ME735_module 5 sequencing notes.pdf
Operations Research_18ME735_module 5 sequencing notes.pdf
RoopaDNDandally
 
Operations scheduling
Operations schedulingOperations scheduling
Operations scheduling
RajThakuri
 
Clock driven scheduling
Clock driven schedulingClock driven scheduling
Clock driven scheduling
Kamal Acharya
 
C0362015022
C0362015022C0362015022
C0362015022
theijes
 
Chap017 Scheduling Edit
Chap017 Scheduling EditChap017 Scheduling Edit
Chap017 Scheduling EditRicky Muchtar
 
Do2644844490
Do2644844490Do2644844490
Do2644844490IJMER
 
chapter 5 CPU scheduling.ppt
chapter  5 CPU scheduling.pptchapter  5 CPU scheduling.ppt
chapter 5 CPU scheduling.ppt
KeyreSebre
 
SCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaa
SCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaaSCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaa
SCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaa
infinitepestcontrol
 
A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...
A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...
A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...
CrimsonPublishersRDMS
 
An improved approach to minimize context switching in round robin scheduling ...
An improved approach to minimize context switching in round robin scheduling ...An improved approach to minimize context switching in round robin scheduling ...
An improved approach to minimize context switching in round robin scheduling ...
eSAT Publishing House
 

Similar to scheduling-sequencing-rules.pptx (20)

programming .pptx
programming .pptxprogramming .pptx
programming .pptx
 
C8 scheduling
C8 schedulingC8 scheduling
C8 scheduling
 
C8 scheduling
C8 schedulingC8 scheduling
C8 scheduling
 
Scheduling
SchedulingScheduling
Scheduling
 
Scheduling
SchedulingScheduling
Scheduling
 
SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...
SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...
SIMULATION AND COMPARISON ANALYSIS OF DUE DATE ASSIGNMENT METHODS USING SCHED...
 
Om chapter 14
Om chapter 14Om chapter 14
Om chapter 14
 
Chapter 6-Scheduling in Industrial of Engineering
Chapter 6-Scheduling in Industrial of EngineeringChapter 6-Scheduling in Industrial of Engineering
Chapter 6-Scheduling in Industrial of Engineering
 
scheduling Uni processor Long-term .ppt
scheduling  Uni processor Long-term .pptscheduling  Uni processor Long-term .ppt
scheduling Uni processor Long-term .ppt
 
Process Scheduling
Process SchedulingProcess Scheduling
Process Scheduling
 
Operations Research_18ME735_module 5 sequencing notes.pdf
Operations Research_18ME735_module 5 sequencing notes.pdfOperations Research_18ME735_module 5 sequencing notes.pdf
Operations Research_18ME735_module 5 sequencing notes.pdf
 
Operations scheduling
Operations schedulingOperations scheduling
Operations scheduling
 
Clock driven scheduling
Clock driven schedulingClock driven scheduling
Clock driven scheduling
 
C0362015022
C0362015022C0362015022
C0362015022
 
Chap017 Scheduling Edit
Chap017 Scheduling EditChap017 Scheduling Edit
Chap017 Scheduling Edit
 
Do2644844490
Do2644844490Do2644844490
Do2644844490
 
chapter 5 CPU scheduling.ppt
chapter  5 CPU scheduling.pptchapter  5 CPU scheduling.ppt
chapter 5 CPU scheduling.ppt
 
SCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaa
SCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaaSCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaa
SCHEDULING.pptdjdgjgjdjgajdjasdjadasgdgdduaa
 
A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...
A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...
A New Approach for Job Scheduling Using Hybrid GA-ST Optimization-Crimson Pub...
 
An improved approach to minimize context switching in round robin scheduling ...
An improved approach to minimize context switching in round robin scheduling ...An improved approach to minimize context switching in round robin scheduling ...
An improved approach to minimize context switching in round robin scheduling ...
 

Recently uploaded

Railway Signalling Principles Edition 3.pdf
Railway Signalling Principles Edition 3.pdfRailway Signalling Principles Edition 3.pdf
Railway Signalling Principles Edition 3.pdf
TeeVichai
 
English lab ppt no titlespecENG PPTt.pdf
English lab ppt no titlespecENG PPTt.pdfEnglish lab ppt no titlespecENG PPTt.pdf
English lab ppt no titlespecENG PPTt.pdf
BrazilAccount1
 
ethical hacking in wireless-hacking1.ppt
ethical hacking in wireless-hacking1.pptethical hacking in wireless-hacking1.ppt
ethical hacking in wireless-hacking1.ppt
Jayaprasanna4
 
CME397 Surface Engineering- Professional Elective
CME397 Surface Engineering- Professional ElectiveCME397 Surface Engineering- Professional Elective
CME397 Surface Engineering- Professional Elective
karthi keyan
 
Planning Of Procurement o different goods and services
Planning Of Procurement o different goods and servicesPlanning Of Procurement o different goods and services
Planning Of Procurement o different goods and services
JoytuBarua2
 
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Dr.Costas Sachpazis
 
一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理
一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理
一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理
bakpo1
 
ML for identifying fraud using open blockchain data.pptx
ML for identifying fraud using open blockchain data.pptxML for identifying fraud using open blockchain data.pptx
ML for identifying fraud using open blockchain data.pptx
Vijay Dialani, PhD
 
Governing Equations for Fundamental Aerodynamics_Anderson2010.pdf
Governing Equations for Fundamental Aerodynamics_Anderson2010.pdfGoverning Equations for Fundamental Aerodynamics_Anderson2010.pdf
Governing Equations for Fundamental Aerodynamics_Anderson2010.pdf
WENKENLI1
 
road safety engineering r s e unit 3.pdf
road safety engineering  r s e unit 3.pdfroad safety engineering  r s e unit 3.pdf
road safety engineering r s e unit 3.pdf
VENKATESHvenky89705
 
Final project report on grocery store management system..pdf
Final project report on grocery store management system..pdfFinal project report on grocery store management system..pdf
Final project report on grocery store management system..pdf
Kamal Acharya
 
一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理
一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理
一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理
zwunae
 
ethical hacking-mobile hacking methods.ppt
ethical hacking-mobile hacking methods.pptethical hacking-mobile hacking methods.ppt
ethical hacking-mobile hacking methods.ppt
Jayaprasanna4
 
Standard Reomte Control Interface - Neometrix
Standard Reomte Control Interface - NeometrixStandard Reomte Control Interface - Neometrix
Standard Reomte Control Interface - Neometrix
Neometrix_Engineering_Pvt_Ltd
 
Fundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptxFundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptx
manasideore6
 
The Benefits and Techniques of Trenchless Pipe Repair.pdf
The Benefits and Techniques of Trenchless Pipe Repair.pdfThe Benefits and Techniques of Trenchless Pipe Repair.pdf
The Benefits and Techniques of Trenchless Pipe Repair.pdf
Pipe Restoration Solutions
 
J.Yang, ICLR 2024, MLILAB, KAIST AI.pdf
J.Yang,  ICLR 2024, MLILAB, KAIST AI.pdfJ.Yang,  ICLR 2024, MLILAB, KAIST AI.pdf
J.Yang, ICLR 2024, MLILAB, KAIST AI.pdf
MLILAB
 
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&BDesign and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Sreedhar Chowdam
 
WATER CRISIS and its solutions-pptx 1234
WATER CRISIS and its solutions-pptx 1234WATER CRISIS and its solutions-pptx 1234
WATER CRISIS and its solutions-pptx 1234
AafreenAbuthahir2
 
Immunizing Image Classifiers Against Localized Adversary Attacks
Immunizing Image Classifiers Against Localized Adversary AttacksImmunizing Image Classifiers Against Localized Adversary Attacks
Immunizing Image Classifiers Against Localized Adversary Attacks
gerogepatton
 

Recently uploaded (20)

Railway Signalling Principles Edition 3.pdf
Railway Signalling Principles Edition 3.pdfRailway Signalling Principles Edition 3.pdf
Railway Signalling Principles Edition 3.pdf
 
English lab ppt no titlespecENG PPTt.pdf
English lab ppt no titlespecENG PPTt.pdfEnglish lab ppt no titlespecENG PPTt.pdf
English lab ppt no titlespecENG PPTt.pdf
 
ethical hacking in wireless-hacking1.ppt
ethical hacking in wireless-hacking1.pptethical hacking in wireless-hacking1.ppt
ethical hacking in wireless-hacking1.ppt
 
CME397 Surface Engineering- Professional Elective
CME397 Surface Engineering- Professional ElectiveCME397 Surface Engineering- Professional Elective
CME397 Surface Engineering- Professional Elective
 
Planning Of Procurement o different goods and services
Planning Of Procurement o different goods and servicesPlanning Of Procurement o different goods and services
Planning Of Procurement o different goods and services
 
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
 
一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理
一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理
一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理
 
ML for identifying fraud using open blockchain data.pptx
ML for identifying fraud using open blockchain data.pptxML for identifying fraud using open blockchain data.pptx
ML for identifying fraud using open blockchain data.pptx
 
Governing Equations for Fundamental Aerodynamics_Anderson2010.pdf
Governing Equations for Fundamental Aerodynamics_Anderson2010.pdfGoverning Equations for Fundamental Aerodynamics_Anderson2010.pdf
Governing Equations for Fundamental Aerodynamics_Anderson2010.pdf
 
road safety engineering r s e unit 3.pdf
road safety engineering  r s e unit 3.pdfroad safety engineering  r s e unit 3.pdf
road safety engineering r s e unit 3.pdf
 
Final project report on grocery store management system..pdf
Final project report on grocery store management system..pdfFinal project report on grocery store management system..pdf
Final project report on grocery store management system..pdf
 
一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理
一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理
一比一原版(IIT毕业证)伊利诺伊理工大学毕业证成绩单专业办理
 
ethical hacking-mobile hacking methods.ppt
ethical hacking-mobile hacking methods.pptethical hacking-mobile hacking methods.ppt
ethical hacking-mobile hacking methods.ppt
 
Standard Reomte Control Interface - Neometrix
Standard Reomte Control Interface - NeometrixStandard Reomte Control Interface - Neometrix
Standard Reomte Control Interface - Neometrix
 
Fundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptxFundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptx
 
The Benefits and Techniques of Trenchless Pipe Repair.pdf
The Benefits and Techniques of Trenchless Pipe Repair.pdfThe Benefits and Techniques of Trenchless Pipe Repair.pdf
The Benefits and Techniques of Trenchless Pipe Repair.pdf
 
J.Yang, ICLR 2024, MLILAB, KAIST AI.pdf
J.Yang,  ICLR 2024, MLILAB, KAIST AI.pdfJ.Yang,  ICLR 2024, MLILAB, KAIST AI.pdf
J.Yang, ICLR 2024, MLILAB, KAIST AI.pdf
 
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&BDesign and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
 
WATER CRISIS and its solutions-pptx 1234
WATER CRISIS and its solutions-pptx 1234WATER CRISIS and its solutions-pptx 1234
WATER CRISIS and its solutions-pptx 1234
 
Immunizing Image Classifiers Against Localized Adversary Attacks
Immunizing Image Classifiers Against Localized Adversary AttacksImmunizing Image Classifiers Against Localized Adversary Attacks
Immunizing Image Classifiers Against Localized Adversary Attacks
 

scheduling-sequencing-rules.pptx

  • 1. 4.3 Priority Sequencing Rules  Priority Rules provide guidelines for the sequence in which jobs should be worked.  In using this rules, job processing times and due dates are important pieces of information.  Priority Rules try to minimize completion time, number of jobs in the system, and job lateness, while maximizing facility utilization.
  • 2. 4.3 Priority Sequencing Rules  4 types  First come, first served (FCFS)  Shortest processing time (SPT)  Earlier due date (EDD)  Critical Ratio (CR)
  • 3. 4.3 Priority Sequencing Rules  First come, first served (FCFS)  Jobs are processed in the order in which they arrive at a machine or work center.  Shortest processing time (SPT)  Jobs are processed according to processing time at a machine or work center, shortest job first.  Earlier due date (EDD)  Jobs are processed according t due date, earlier due date first.  Critical Ratio (CR)  Jobs are processed according to smallest ratio of time remaining until due date to processing time remaining.
  • 4. 4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 1 Jo b Days to Finish Date Promised A 2 5 B 8 8 C 6 12 D 4 10 E 1 4 Sequenc e Work Time Flow Time Due Date Lateness A 2 2 5 0 B 8 10 8 2 C 6 16 12 4 D 4 20 10 10 E 1 21 4 17 TOTALS 21 69 33 SOLUTION : Five jobs are to be done at custom furniture shop: Measure of effectiveness: Flow time: is the amount of time a job spent in shop/factory Total work time/makespan: is the time needed to process given set of jobs Lateness: different between completion time and due date (if (– ve) put it zero) Note! Do all the jobs get done on time? No, Jobs B, C, D and E are going to be late
  • 5. #Average completion time = Total flow time ÷ No. of jobs #Average number of jobs = Total flow time ÷ Total job work time In the system #Average job lateness = Total late days ÷ No. of jobs #Utilization = Total job work time÷ Total flow time = in % Performance measuring formula: 4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 1
  • 6. Five jobs are to be assemble in AHP Plastic Sdn. Bhd.: 4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 2
  • 7. SOLUTION: 4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 2
  • 8.  Shortest Processing Time. Jobs with the shortest processing time are scheduled first.  Jobs are sequenced in increasing order of their processing time.  Shortest processing time is optimal for minimizing:  Average and total flow time  Average waiting time  Average and total lateness 4.3.2 Sequencing Rules: Shortest Processing Time (SPT)
  • 9. The steps for using this rule are : 1. Firstly, the user will input the number of jobs, the job names, the processing time and the due date of each job or use the data values given at the starting point. 2. The second step is sorting out the shortest processing time among the jobs. 3. Thirdly, calculate the flow time of each job by using the processing time. The flow time is the accumulation of processing time each job by each 4.3.2 Sequencing Rules: Shortest Processing Time (SPT)
  • 10. Jobs (in order Processing Due Date of arrival) Time (days) (days hence) A 4 5 B 7 10 C 3 6 D 1 4 Suppose we have the four jobs to the right arrive for processing on one machine 4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 1
  • 11. Average completion time 28/4 = 7 days Average number of jobs in the system 28/15 = 1.867 jobs Average lateness 8/4 = 2days Utilization 15/28 = 53.57% 4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 1 Sequence Work Time Flow Time Due Date Lateness D 1 1 4 0 C 3 4 6 0 A 4 8 5 3 B 7 15 10 5 TOTAL 15 28 8 Answer: Shortest Operating Time Schedule Jobs A and B are going to be late
  • 12. Job sequence Processing Time Due Date A(turning) B(drilling) C(grinding) D(milling) E( facing) 6 2 8 3 9 8 6 18 15 23 4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 2 • A Brake Pad have 5 process that will undergo before it will be produce at a particular point in time . The jobs are labeled A, B, C, D, and E in the order that they entered the shop. The respective processing times and due dates are given in the table below. Determine the schedule by using the SPT rule.
  • 13. Solution: 4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 2
  • 14. Average completion time 65/5 = 13 days Average number of jobs in the system 65/28 = 2.3214 jobs Average lateness 9/5 = 1.8 days Utilization 28/65 = 43.08% 4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 2 #Average completion time = Total flow time ÷ No. of jobs #Average number of jobs = Total flow time ÷ Total job work time In the system #Average job lateness = Total late days ÷ No. of jobs #Utilization = Total job work time÷ Total flow time = in %
  • 15.  Jobs are sequenced in increasing order of their due dates;  The job with earliest due date is first, the one with the next earliest due date is second, and so on;  A priority sequencing rule that specifies that the job with the earliest due date is the next job to be processed 4.3.3 Sequencing Rules: Earliest Due Date (EDD)
  • 16. The steps for using this rule are : 1. Firstly, the user will input the number of jobs, the job names, the processing time and the due date of each job or use the data values given at the starting point. 2. The second step is sorting out the earliest due date among the jobs. 3. Thirdly, calculate the flow time of each job by using the processing time. The flow time is the accumulation of processing time each job by 4.3.3 Sequencing Rules: Earliest Due Date (EDD)
  • 17. •The formulas for calculation are below: #Average completion time = Total flow time ÷ No. of jobs #Average number of jobs = Total flow time ÷ Total job work time In the system #Average job lateness = Total late days ÷ No. of jobs #Utilization = Total job work time÷ Total flow time = in % 4.3.3 Sequencing Rules: Earliest Due Date (EDD)
  • 18. • Five engine blocks are waiting for processing. The processing times have been estimated. Expected completion times have been agreed. The table shows the processing time and due date of those 5 engines. • Determine the schedule by using the EDD rule. Engine Block Processing Time (Days) Due Date (Days) Ranger 8 10 Explorer 6 12 Bronco 15 20 Econoline 150 3 18 Thunderbird 12 22 4.3.3 Sequencing Rules: Earliest Due Date (EDD) Example 1
  • 19. Engine (1) (2) (3) (2)-(3) Block Processing Completion Due Days Tardy Sequence Time Time Date (0 if negative) Ranger 8 10 Explorer 6 12 Econoline 150 3 18 Bronco 15 20 Thunderbird 12 22 8 0 32 12 14 2 17 0 44 22 Total 44 85 36 4.3.3 Sequencing Rules: Earliest Due Date (EDD) Example 1 Average completion time 85/5 = 17 days Average number of jobs in the system 85/44 = 1.9318 jobs Average tardiness 36/5 = 7.2 days Utilization 44/85 = 51.76%
  • 20. Is an index number computed by dividing the time remaining until due date by the work time remaining. The critical ratio gives priority to jobs that must be done to keep shipping on schedule. The critical ratio is measure of urgency of any order compared to the other orders for the same facility. The ratio is based on when the completed order is required and how much time is required to complete. 4.3.4 Sequencing Rules: Critical Ratio (CR)
  • 21. •The step for using this rule are: 1. At the starting program, user input the numbers of job, the jobs name, the works day remaining and the due date of each job and as well the today's date. 2. The today's date and the number of job are just inputted once time. Then, the others are followed the value of the number of jobs inputted. After that, compute the critical ratio by using the formula. 3. The formula for Critical Ratio is: CR = time remaining / works day remaining 4. After calculating the CR for each job, give the priority order by using the value of the calculated critical ratio. The priority order is performed from smaller to larger. 4.3.4 Sequencing Rules: Critical Ratio (CR)
  • 22. • There are 3 characteristics can be seen from the critical ratio:  A job with low critical ratio(less than 1.0) - --- falling behind schedule.  If CR is exactly 1.0 ---- the job is on schedule.  If CR is greater than 1.0 ---- the job is ahead of schedule and has some slack. 4.3.4 Sequencing Rules: Critical Ratio (CR)
  • 23. •The critical ratio help in most production scheduling system as below: Determine the status of specific job. Establish relative priority among jobs on a common basis. Relate both stock and make-to-order jobs on a common basis. Adjust priorities (and revise schedules) automatically for changes in both demand and job progress. Dynamically track job progress and location. 4.3.4 Sequencing Rules: Critical Ratio (CR)
  • 24. •A machine center in a job shop for a local fabrication company has five unprocessed jobs remaining at a particular point in time. The jobs are labeled 1, 2, 3, 4, and 5 in the order that they entered the shop. The respective processing times and due dates are given in the table below. •Sequence the 5 jobs by CR rules. Job number Processing Time Due Date 1 2 3 4 5 11 29 31 1 2 61 45 31 33 32 4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1
  • 25. Current time: t=0 Job number Processing Time Due Date Critical Ratio 1 2 3 4 5 11 29 31 1 2 61 45 31 33 32 61/11(5.545) 45/29(1.552) 31/31(1.000) 33/1 (33.00) 32/2 (16.00) Current time: t=31 Job number Processing Time Due Date-Current Time Critical Ratio 1 2 4 5 11 29 1 2 30 14 2 1 30/11(2.727) 14/29(0.483) 2/1 (2.000) 1/2 (0.500) Current time should be reset after scheduling one job 4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1
  • 26. Current time=60 Job number Processing Time Due Date- Current Time Critical Ratio 1 4 5 11 1 2 1 -27 -28 1/11(0.0909) -27/1<0 -28/2<0 Both Jobs 4 and 5 are later, however Job 4 has shorter processing time and thus is scheduled first; Finally, job 1 is scheduled last. 4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1
  • 27. Average completion time 289/5 = 57.8 days Average number of jobs in the system 289/74 = 3.905 jobs Average tardiness 87/5 = 17.4 days Utilization 74/289 = 25.61% Job number Processing Time Completion Time Due Date Tardiness 3 2 4 5 1 31 29 1 2 11 31 60 61 63 74 31 45 33 32 61 0 15 28 31 13 Totals 74 289 87 4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1
  • 28. 4 Rules Application - Example Job number Processing Time Due Date A B C D E F 2 8 4 10 5 12 7 16 4 17 15 18 Processing Time (including setup times) and due dates for six jobs waiting to be processed at a work center are given in the following table. Determine the sequence of jobs, the average flow time, average tardiness, and number of jobs at the work center, for each of these rules: •FCFS •SPT •EDD •CR
  • 29. 4 Rules Application – Example (FCFS) Job Sequence Processing Time Flow Time Due Date Tardiness A B C D E F 2 8 4 10 5 12 2 10 14 24 29 41 7 16 4 17 15 18 0 0 10 7 14 23 Totals 41 120 54 Average completion time 120/6 = 20 days Average number of jobs in the system 120/41 = 2.93 jobs Average tardiness 54/6 = 9 days Utilization 41/120 = 34.17%
  • 30. 4 Rules Application – Example (SPT) Job Sequence Processing Time Flow Time Due Date Tardiness A C E B D F 2 4 5 8 10 12 2 6 11 19 29 41 7 4 15 16 17 18 0 2 0 3 12 23 Totals 41 108 40 Average completion time 108/6 = 18 days Average number of jobs in the system 108/41 = 2.63 jobs Average tardiness 40/6 = 6.67 days Utilization 41/108 = 37.96%
  • 31. 4 Rules Application – Example (EDD) Job Sequence Processing Time Flow Time Due Date Tardiness C A E B D F 4 2 5 8 10 12 4 6 11 19 29 41 4 7 15 16 17 18 0 0 0 3 12 23 Totals 41 110 38 Average completion time 110/6 = 18.33 days Average number of jobs in the system 110/41 = 2.68 jobs Average tardiness 38/6 = 6.33 days Utilization 41/110 = 37.27%
  • 32. 4 Rules Application – Example (CR) Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F 2 8 4 10 5 12 7 16 4 17 15 18 (7-0) / 2 = 3.5 (16-0) / 8 = 2.0 (4-0) / 4 = 1.0 (Lowest) (17-0) / 10 = 1.7 (15-0) / 5 = 3.0 (18-0) / 12 = 1.5 At t=0, •Job C is the first job to complete base on the lowest critical ratio.
  • 33. 4 Rules Application – Example (CR) Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F 2 8 - 10 5 12 7 16 - 17 15 18 (7-4) / 2 = 1.5 (16-4) / 8 = 1.5 - (17-4) / 10 = 1.3 (15-4) / 5 = 2.2 (18-4) / 12 = 1.17 (Lowest) At t=4, day 4 [C completed], •Job F is the second job to complete base on the lowest critical ratio.
  • 34. 4 Rules Application – Example (CR) Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F 2 8 - 10 5 - 7 16 - 17 15 - (7-16) / 2 = -4.5 (Lowest) (16-16) / 8 = 0 - (17-16) / 10 = 0.1 (15-16) / 5 = -0.2 - At t=16, day 16 [C and F completed], •Job A is the third job to complete base on the lowest critical ratio.
  • 35. 4 Rules Application – Example (CR) Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F - 8 - 10 5 - - 16 - 17 15 - - (16-18) / 8 = -0.25 - (17-18) / 10 = -0.10 (15-18) / 5 = -0.60 (Lowest) - At t=18, day 18 [C, F and A completed], •Job E is the fourth job to complete base on the lowest critical ratio.
  • 36. 4 Rules Application – Example (CR) Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F - 8 - 10 - - - 16 - 17 - - - (16-23) / 8 = -0.875 (Lowest) - (17-23) / 10 = -0.60 - - At t=23, day 23 [C, F, A and E completed], •Job B is the fifth job to complete base on the lowest critical ratio and follow by Job D in last.
  • 37. 4 Rules Application – Example (CR) Job Sequence Processing Time Flow Time Due Date Tardiness C F A E B D 4 12 2 5 8 10 4 16 18 23 31 41 4 18 7 15 16 17 0 0 11 8 15 24 Totals 41 133 58 Average completion time 133/6 = 22.17 days Average number of jobs in the system 133/41 = 3.24 jobs Average tardiness 58/6 = 9.67 days Utilization 41/133 = 30.83%
  • 38. Rules Average Flow Time (days) Average Tardiness (days) Average Number of Jobs at the Work Center Utilization (%) FCFS SPT EDD CR 20.00 18.00 18.33 22.17 9.00 6.67 6.33 9.67 2.93 2.63 2.68 3.24 34.17 37.96 37.27 30.83 4 Rules Application – Example (CR)

Editor's Notes

  1. 11