Information Technology Reference
In-Depth Information
6
4
4
5
1
4
6
2
4
3
3
3
4
1
3
4
4
5
3
1
Makespan
Fig. 3.12.
Gantt chart representation of the schedule
6
10
14
19
20
10
16
18
23
26
13
19
23
24
29
17
23
28
31
32
Fig. 3.13.
Directed time graph and critical path
3.6.2
Experimentation for Discrete Differential Evolution Algorithm
The first phase of experimentation was used on FSS utilising DDE algorithm. Eight
varying problem instances were selected from the literature, which represents a range
of problem complexity. The syntax of the problem
nxm
represents
n
machines and
m
jobs. These problem instances were generated randomly for previous tests and range
from small problem types (
4x4
to
15x25
), medium problem type (
20x50
)andlarge
problem types (
25x75
and
30x100
).
Search WWH ::
Custom Search