Information Technology Reference
In-Depth Information
Table 3.26.
Example of job times
jobs
j
1
j
2
j
3
j
4
j
5
P
1
,
j
k
6
4
4
5
1
P
2
,
j
k
4
6
2
4
3
P
3
,
j
k
3
3
4
1
3
P
4
,
j
k
4
4
5
3
1
6
4
4
5
1
4
6
2
4
3
3
3
4
1
3
4
5
5
3
1
Fig. 3.11.
Directed graph representation of the schedule
The directed graph representation for this schedule is given in Fig 3.11.
Each node on the graph represents the time taken to process that particular job on
that particular machine. The bold lines represent the
critical path
for that particular
schedule.
The Gantt chart for this schedule is represented in Fig 3.12.
The critical path is highlighted The critical path represents jobs, which are not de-
layed or buffered. This is important for those shops, which have machines with no
buffering between them. The total time for this schedule is 34. However, from this rep-
resentation, it is difficult to make out the time. A better representation of the directed
graph and critical path is given in Fig 3.13.
The cumulative time nodes gives the time accumulated at each node. The final node
gives the makespan for the total schedule.
The total time Gantt chart ispresentedinFig3.14.
As the schedule is changed, so does the directed graph.
Search WWH ::
Custom Search