Single Machine Scheduling

Introduction to scheduling
Concept of Single Machine Scheduling
Shortest Processing Time Rule to Minimize Mean Flow Time
Weighted Mean Flow Time
Earliest due date Rule to Minimize Maximum Lateness
Model to Minimize Total Tardiness
Introduction to Branch and Bound Techniques to minimize Mean Tardiness
 Introduction
• Scheduling is the allocation of start and finish
time for each job – Calendar for processing set of
jobs
• Single machine scheduling is scheduling n jobs in
one machine –with the same single operation
• Flow shop scheduling consists of scheduling n
jobs with m operations –n jobs are having same
sequence of operations
• Job shop scheduling consists of n jobs with m
operations and n jobs are with different
sequence
Concept of Single Machine Scheduling
• A set of single machine operation jobs is available
for processing at time zero
• Set up time of each job is independent of its
position in jobs sequence and as such set up time
can be included in its processing time
• Job descriptors are known in advance
• One machine is continuously available and is
never kept idle when work is waiting
• Each job is processed till its completion without a
break
 Definitions
• Processing Time – tj
Time required to process job j –it normally
include actual processing time and set up time
• Ready time- rj
It is the time at which job j is available for
processing . The ready time is the difference
between the arrival time of job j and the time
at which that job is taken for processing . In
this model rj =0
 Definitions
• Due Date-dj
Time at which the job j is to be completed
• Completion Time-Cj
The time at which the job j is completed in the
processing sequence
• Flow Time-Fj
Amount of time job j spends in the system
F j = C j-r j
 Definitions
• Lateness L j
Lj= Cj-dj
• Tardiness
Is the lateness of job j if it fails to meet its due
date or zero.
Tj =Max( 0, Cj-dj)
=Max (0,Lj)
 Measures of Performance
• Mean Flow time = F = 1 n F j
j =1
n

1 n
• Mean Tardiness= T =  j =1 T j
n
• Maximum Flow Time = Fmax = max 0 j  n ( F j )
 Measures of Performance
• Maximum Tardiness= Tmax = max 0 j  n (T j )

n
• Number of Tardy Jobs = NT =  f (T j )
j =1
 Choosing right sequencing Rule
• Based on
a. Set up times
b. In process inventory cost
c. Idle time percentage
d. Percentage of job lateness
e. Average job lateness
f. Standard deviation of job lateness
g. Average number of jobs waiting
h. Average job completion time
i. Standard deviation of job completion time
 Some Sequencing Rules
• First come First Served(FCFS)
• Earliest Due Date(EDD)
• Shortest Processing Time(SPT)
• Truncated Shortest Processing Time(TSPT)
• Least Slack ( Slack =Due Date- Today’s Date-
Processing Time)
• Critical Ratio
 Example- First Come First Served
Method
Job Sequence Job Operation Time Job Due Date Flow Time

A 4 6 4

B 17 20 21

C 14 18 35

D 9 12 44

E 11 12 55
 Example-Shortest Processing Time
Sequencing Method
Job Sequence Job Operation Time Job Due Date Flow Time

A 4 6 4

D 9 12 13

E 11 12 24

C 14 18 38

B 17 20 55
Critical Ratio Method
Job Operati Due Time 0 Time= Time Time=
on Date CR 11 =15 24
Time CR
A 4 6 6/4 (6-
=1.5 11)/4=-
1.25*
B 17 20 (20- 9/17=0. 5/17 (20-
0)/17= 53 24)/17
1.76 =-
0.2352
9
C 14 18 18/14= 3/14 (18-
1.286 24)/14
=-
0.4285
*
D 9 12 12/9=1. (12-
33 15)/9*

E 11 12 12/11=
1.09*
 Example
Job Sequence Job Operation Time Job Due Date Flow Time

E 11 12 11

A 4 6 15

D 9 12 24

C 14 18 38

B 17 20 55