Beruflich Dokumente
Kultur Dokumente
=
max
min max
C
) d d (
R
=
5 . 0 R for , R 2 6 k
5 . 0 R for , R 5 . 4 k
1
1
> =
s + =
average p
j
of the remaining jobs
Composite dispatching:
Apparent Tardiness Cost with Setups (ATCS)
ATCS combines MS rule, WSPT rule and SST rule:
k
1
=due date scaling par.
k
2
=setup time scaling par.
k
1
and k
2
functions of:
Due Date tightness
Due Date Range
Setup Time Severity
)
s k
s
( )
p k
) 0 , t p d max(
(
j
j
j
2
lj
1
j j
e e
p
w
) t ( I
=
max
C
d
1 = t
max
min max
C
) d d (
R
=
p
s
= q
) 2 /( k
5 . 0 R for , R 2 6 k
5 . 0 R for , R 5 . 4 k
2
1
1
q t =
> =
s + =
Dispatching rules: multiple passes
drawback of priority rules:
may yield bad solutions
SOLUTION: Use multiple passes
Multi-pass priority rule based methods:
1. Multi-priority rule procedures (repeat dispatching
procedure with different disp. rules)
2. Sampling procedures (each job has a probability to be
dispatched)
Dispatching rules: sampling
Random sampling (each job has the same probability):
P
j
=1/n
Biased random sampling (based on priority of job):
first sort jobs on non-increasing priority v
j
[j] is the position of job j in the list
Probability that job is selected:
Parameterized regret-based random sampling:
accounts for relative difference in priorities of jobs
| |
factor) (bias 1 0
1
C : where
, C P
i
i
j
j
s o <
o
=
o =
: 1 = o random sampling
deterministic
: 0 ~ o
Dispatching rules: sampling (cont.)
Parameterized regret-based random sampling:
regret factor (v
j
=priority):
probability:
o=0: random sampling
o=: deterministic activity selection
Kolisch and Drexl:
the more passes, the higher o should be taken
this method is called the Adaptive Search-method
i
D i
j j
v min v w
e
=
( )
( )
e
o
o
+
+
=
D i
j
j
j
1 w
1 w
P
normalization