Documente Academic
Documente Profesional
Documente Cultură
Nithin Narayanan
M. Tech MMS
College of Enginneering Thalassery
1
Average tardiness
Average flow time
2
DISPATCHING
RULES
Static Rules
LTWK, EDD
DISPATCHING
RULES
Dynamic Rules
LWKR, Slack based
rules
Description
SPT
EDD
FCFS
FISFS
S/RO
Covert
LTWK
LWKR
MOPNR
MWKR
EXAMPLE
Job
Current
J1
J2
J3
time
J4
Arrival Arrival
to
at B
syste
m
10
0
is 010.
0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
determine
the
On machine B,
EXAMPLE
Job
J1
J2
J3
J4
Arrival Arrival
to
at B
syste
m
10
0
0
0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
EXAMPLE
Job
J1
J2
J3
J4
Arrival Arrival
to
at B
syste
m
Due
date
Operation (machine,
pij)
1
2
3
10
10
30
(B,5)
(A,1)
0
5
20
(A,5)
(B,3)
0
9
10
(C,3)
(D,2)
25First
(E,6)
(B,4)
FCFS0 (First8 Come
Served)
(D,6)
(C,2)
(B,2)
(C,4)
EXAMPLE
Job
J1
J2
J3
J4
Covert:
1
Delay cost
1
Arrival Arrival
to
at B
syste
m
10
0
0
0
if slack < 0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
For jobs (J1, J2, J3, J4) remaining work (time) are (3, 2, 1, 2)
Assume 0.5 times waiting time (E) (1.5, 1, 0.5, 1)
For jobs J1, J2, J4 slack > E, therefor delay cost = 0
For jobs J3 slack < 0, therefor delay cost is 1
So the delay cost of jobs for 0.5 (J1, J2, J3, J4) are (0, 0, 1, 0)
J3 goes first, then chose arbitrarily, sequence is {J3, J2, J4, J1}
Slack
J1 = 30 10 5 1 6 = 8
J2 = 20 10 3 2 = 5
J3 = 10 10 2 = 2
J4 = 25 10 4 4 = 7
8
EXAMPLE
Job
J1
J2
J3
J4
Arrival Arrival
to
at B
syste
m
10
0
0
0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
EXAMPLE
Job
J1
J2
J3
J4
Arrival Arrival
to
at B
syste
m
10
0
0
0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
EXAMPLE
Job
J1
J2
J3
J4
Arrival Arrival
to
at B
syste
m
10
0
0
0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
11
EXAMPLE
Job
J1
J2
J3
J4
Arrival Arrival
to
at B
syste
m
10
0
0
0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
12
EXAMPLE
Job
RANDOM:
J1
J2
J3
J4
Arrival Arrival
to
at B
syste
m
10
0
0
0
10
5
9
8
Due
date
30
20
10
25
Operation (machine,
pij)
1
2
3
(B,5)
(A,5)
(C,3)
(E,6)
(A,1)
(B,3)
(D,2)
(B,4)
(D,6)
(C,2)
(B,2)
(C,4)
Conclusion
Job shop scheduling is assigning a number of jobs on number of
machines in an optimum way.
Dispatching rules
The selection of rules are based on the nature of the work.
The optimum way of dispatching is shown with the help of a simple
problem.
Reference
Modelling and Analysis of Manufacturing Systems - Ronald G Askin (The
University of Arizona) & Charles R Standridge (Florida A & M University/ Florida
State University College of Engineering)
14