 |
Organisational remarks |
13/10/2004 |
PDF |
Postscript |
 |
Pure project organization |
19/10/2004 |
GIF |
 |
Line-staff organization |
19/10/2004 |
GIF |
 |
Matrix organization |
19/10/2004 |
GIF |
 |
AoA network - example |
02/11/2004 |
GIF |
 |
Gantt chart - example |
02/11/2004 |
GIF |
 |
AoN network - example (part 1) |
16/11/2004 |
GIF |
 |
AoN network - example (part 2) |
24/11/2004 |
GIF |
 |
Resource profile - example |
30/11/2004 |
GIF |
 |
Cycle structure - example |
30/11/2004 |
GIF |
 |
Feasible region - example (AoN network) |
07/12/2004 |
GIF |
 |
Feasible region - example (Schedules) |
07/12/2004 |
GIF |
 |
Feasible region - example (S1-S2-space) |
07/12/2004 |
GIF |
 |
Order network (corresponding to AoN network - example) |
07/12/2004 |
GIF |
 |
Feasible region |
07/12/2004 |
GIF |
 |
Time-feasible region |
07/12/2004 |
GIF |
 |
Branch-and-bound enumeration scheme |
14/12/2004 |
GIF |
 |
Introduction of cycle of length 0 - example |
21/12/2004 |
GIF |
 |
Priority rule methods |
21/12/2004 |
GIF |
 |
Priority rules |
11/01/2005 |
GIF |
 |
Serial generation scheme |
11/01/2005 |
GIF |
 |
Registration |
|
In order to register for the final evaluation of the Computer Laboratory, you have to enter your names on the inscription list next to the chair's secretary (building 20.14, room 107). The list is up from Monday, January 24 to Thursday, February 3, 2005. Please form groups of two or three participants. |
 |
Submission |
|
Diskettes containing the solutions to one or several exercises can be submitted in an envelope showing the names and the matriculation numbers of the participants until Thursday, February 3, 2005 to Cord-Ulrich Fündeling (building 20.14, room 102.2). A solution to one exercise must always comprise the source code (*.java) as well as the corresponding executable file (*.class). |
 |
Evaluation |
|
The evaluation of the groups will take place on Friday, February 11, 2005 at the scheduled time (building 20.14, room 102.2), where all members of the group have to be present. The groups will have to explain their solution procedures briefly. |