I'm learning how to use excel for real life project Scheduling. My work is giving me practice promblems and I'm basically on my own learning excel. I learn by baby steps. my job field is operations management I'm use to doing heuristic by hand and I'm an old dog learning how to use excell and solver to better my career. Here is the problem.
The purpose of this project is to design and construct an MS EXCEL spreadsheet that schedules a set of n activities each with at most k predecessors in the project scheduling environment for minimizing project completion time. The important features of this problem environment are as follows:
· The number of maximum predecessors per activity, k, is 5.
· The number of activities, n, may be allowed to vary from 5 and 25.
· The only acceptable activity processing times are non-negative integers.
the first tab displays inputs, intermediate calculations, and outputs for an acceptable instance of the problem. The specific inputs are (1) the number of activities, (2) the processing time of each activity, and (3) precedence relationships between activities. The necessary outputs are (1) a table of the activities and the corresponding ES, EF, LS, LF and slack times, (2) critical path of the project, and (3) Gantt Chart of the project. The second tab displays inputs and outputs of the three test instances given to you, and the intermediate calculations can be skipped here.
The requirements are that once all data are properly entered, the appropriate table is produced and the corresponding project completion time is presented. Some of the objectives in constructing the spreadsheet are that
· The spreadsheet computes the schedule correctly,
· The spreadsheet dynamically adapts to the inputs provided without producing errors in any of the cells
· The only cells that can be modified are those that contain inputs; all other cells should be protected from user abuse (i.e., inputs out of the specified ranges).
The three test promblems are:
<colgroup><col><col><col><col span="4"></colgroup><tbody>
</tbody>
<colgroup><col><col><col><col span="4"></colgroup><tbody>
</tbody>
<colgroup><col><col><col><col span="4"></colgroup><tbody>
</tbody>
The purpose of this project is to design and construct an MS EXCEL spreadsheet that schedules a set of n activities each with at most k predecessors in the project scheduling environment for minimizing project completion time. The important features of this problem environment are as follows:
· The number of maximum predecessors per activity, k, is 5.
· The number of activities, n, may be allowed to vary from 5 and 25.
· The only acceptable activity processing times are non-negative integers.
the first tab displays inputs, intermediate calculations, and outputs for an acceptable instance of the problem. The specific inputs are (1) the number of activities, (2) the processing time of each activity, and (3) precedence relationships between activities. The necessary outputs are (1) a table of the activities and the corresponding ES, EF, LS, LF and slack times, (2) critical path of the project, and (3) Gantt Chart of the project. The second tab displays inputs and outputs of the three test instances given to you, and the intermediate calculations can be skipped here.
The requirements are that once all data are properly entered, the appropriate table is produced and the corresponding project completion time is presented. Some of the objectives in constructing the spreadsheet are that
· The spreadsheet computes the schedule correctly,
· The spreadsheet dynamically adapts to the inputs provided without producing errors in any of the cells
· The only cells that can be modified are those that contain inputs; all other cells should be protected from user abuse (i.e., inputs out of the specified ranges).
The three test promblems are:
<colgroup><col><col><col><col span="4"></colgroup><tbody> </tbody> |
<colgroup><col><col><col><col span="4"></colgroup><tbody>
</tbody>
| Activity j | Duration | Immediate Predecessors | Predecessor 1 | Predecessor 2 | Predecessor 3 | Predecessor 4 |
| 1 | 7 | - | ||||
| 2 | 2 | 1 | 1 | |||
| 3 | 8 | 1 | 1 | |||
| 4 | 2 | 2 | 2 | |||
| 5 | 5 | 4 | 4 | |||
| 6 | 8 | 3,4 | 3 | 4 | ||
| 7 | 11 | 5 | 5 | |||
| 8 | 5 | 5,6 | 5 | 6 | ||
| 9 | 4 | 6 | 6 | |||
| 10 | 2 | 7,8,9 | 7 | 8 | 9 |
<colgroup><col><col><col><col span="4"></colgroup><tbody>
</tbody>
| Activity j | Duration | Immediate Predecessors | Predecessor 1 | Predecessor 2 | Predecessor 3 | Predecessor 4 |
| 1 | 9 | - | ||||
| 2 | 6 | 1 | 1 | |||
| 3 | 4 | 1 | 1 | |||
| 4 | 6 | 1 | 1 | |||
| 5 | 12 | 2 | 2 | |||
| 6 | 11 | 2,3 | 2 | 3 | ||
| 7 | 2 | 3 | 3 | |||
| 8 | 6 | 4 | 4 | |||
| 9 | 9 | 4 | 4 | |||
| 10 | 6 | 5,6 | 5 | 6 | ||
| 11 | 2 | 6 | 6 | |||
| 12 | 5 | 7 | 7 | |||
| 13 | 12 | 7 | 7 | |||
| 14 | 2 | 9 | 9 | |||
| 15 | 5 | 10,11,12 | 10 | 11 | 12 | |
| 16 | 9 | 15 | 15 | |||
| 17 | 6 | 12 | 12 | |||
| 18 | 11 | 13 | 13 | |||
| 19 | 7 | 14 | 14 | |||
| 20 | 2 | 16,17 | 16 | 17 | ||
| 21 | 8 | 13 | 13 | |||
| 22 | 4 | 17 | 17 | |||
| 23 | 5 | 18,19 | 18 | 19 | ||
| 24 | 2 | 20,21,22,23 | 20 | 21 | 22 | 23 |
| 25 | 9 | 24 | 24 |
<colgroup><col><col><col><col span="4"></colgroup><tbody>
</tbody>
