 |
 |
 |
|
 |
|||
| SPM04 - Supporting Planning of the Project Realization |
LPM04 - Planung des Projektablaufs unterstützen
1 Allocation to V-Model and Methods Allocation
V-Model
SD2.6 - Specification of System Integration
SD4.3 - Specification of SW Integration
QA1.2 - Generation the Assessment Plan
QA2.2 - Definition of Assessment Environment
PM1.5 - Generation of Preliminary Plan
Method
BAR - Bar Plan
NPT - Network Planning Technique
2 Brief Characteristics
This service unit defines the requirements for tools that are used to
- project-specifically instantiate the selected activity types (technical tailoring),
- perform a scheduling planning for activities,
- set the activities in chronological relation to each other,
- plan milestones, and
- allocate resources to the activities.
3 Requirements
3.1 Requirements for Interfaces
| SPM04.I.1 | Granularity | The exchange of control parameters with SWFM01 - Workflow Management is possible for individual closed function packages of the tool by means of a disclosed, documented interface. |
| SPM04.I.2 | Input interface to SPM01 - Managing Project Resources | It is possible to integrate information about resources collected with SPM01 without further transformation directly from the object management in order to generate project realization plans. |
| SPM04.I.3 | Input interface to SPM03 - Supporting Tender-Relevant Tailoring | It is possible to integrate project-specific V-Models generated with SPM03 without further transformation directly from the object management in order to generate project realization plans. |
| SPM04.I.4 | Output interface to SWFM01 - Workflow Management | It is possible to transmit instantiations of activity types and resource allocations from the project realization plans without further transmission via the object management to SWFM01 for the workflow management. |
| SPM04.I.5 | Output interface to SPM05 - Supporting Cost Estimation | It is possible to transmit instantiations of activity types and resource allocations from the project realization plans without further transmission via the object management to SPM05 in order to estimate the expected costs. |
| SPM04.I.6 | Output interface to SPM06 - Supporting Project Control and Steering | It is possible to transmit project realization plans without further transformation via the object management to SPM06 for the project control and steering. |
3.2 Requirements for the Methods Support
| SPM04.M.1 | BAR - Bar Plan | |
| SPM04.M.1.1 | Symbols | It is possible to graphically represent relationships between activities in the form of a bar chart. |
| SPM04.M.1.2 | Milestones | It is possible to define milestones. |
| SPM04.M.2 | NPT - Network Planning Technique | |
| SPM04.M.2.1 | Symbols | Various symbols are available to represent activities and their interrelation. |
| SPM04.M.2.2 | Event Node Network | |
| SPM04.M.2.2.1 | Optimistic activity duration | It is possible to allocate an optimistically estimated duration to activities in an event node network. |
| SPM04.M.2.2.2 | Probable activity duration | It is possible to allocate the probable duration to activities in an event node network. |
| SPM04.M.2.2.3 | Pessimistic activity duration | It is possible to allocate a pessimistically estimated duration to activities in an event node network. |
| SPM04.M.2.3 | Activity node network | It is possible to represent a network plan in form of an activity node network (MPM). |
| SPM04.M.2.4 | Activity arrow network | It is possible to represent a network plan in form of an activity arrow network (CPM). |
| SPM04.M.2.5 | Critical path | It is possible to optically emphasize the critical path in the network plan when graphically represented. |
| SPM04.M.2.6 | Critical activities | It is possible to optically emphasize critical activities in the network plan when graphically represented. |
| SPM04.M.2.7 | New calculation |
The new calculation of the critical path in a network plan is configurable. The calculation is either manually initiated or is performed automatically. |
| SPM04.M.2.8 | Subnetworks | It is possible to calculate subnetworks separately. |
| SPM04.M.2.9 | Hierarchical refinement | It is possible to refine network plans hierarchically. |
| SPM04.M.2.10 | Precedence relations | |
| SPM04.M.2.10.1 | End-end | It is possible to define an end-end relation between two activities. |
| SPM04.M.2.10.2 | End-start | It is possible to define an end-start relation between two activities. |
| SPM04.M.2.10.3 | Start-end | It is possible to define a start-end relation between two activities. |
| SPM04.M.2.10.4 | Start-start | It is possible to define a start-start relation between two activities. |
| SPM04.M.2.11 | Resource allocation |
It is possible to allocate resources to an activity. This is realized by placing a Work Order. |
| SPM04.M.2.12 | Activity duration | It is possible to define both starting date and duration for an activity. |
| SPM04.M.2.13 | Chronological dependences | It is possible to interrelate activities with regard to the time. |
| SPM04.M.2.14 | Difference times | It is possible to define a positive/negative difference time between two activities. |
| SPM04.M.2.15 | Earliest possible start | It is possible to define the earliest possible starting time for an activity. |
| SPM04.M.2.16 | Earliest possible end | It is possible to define the earliest possible end time for an activity. |
| SPM04.M.2.17 | Latest possible start | It is possible to define the latest possible starting time for an activity. |
| SPM04.M.2.18 | Latest possible end | It is possible to define the latest possible end time for an activity. |
| SPM04.M.2.19 | Fixed schedules | It is possible to define fixed schedules for an activity. |
| SPM04.M.2.20 | Float times | It is possible to display the float time for an activity. |
| SPM04.M.2.21 | Backwards Calculation |
It is possible to calculate the latest possible start and the latest possible end of each activity on the basis of all latest possible schedules. The backwards calculation determines the latest possible starting time for a project. |
| SPM04.M.2.22 | Forwards calculation |
It is possible to calculate the earliest possible start and the earliest possible end of each activity on the basis of all earliest possible schedules. The forwards calculation determines the shortest project duration and the earliest possible starting time for a project. |
| SPM04.M.2.23 | Free text | It is possible to enter free text descriptions for activity types. |
| SPM04.M.2.24 | Effort | It is possible to enter effort already consumed for activity types. |
| SPM04.M.2.25 | Partial plans | It is possible to aggregate partial plans into a total plan and vice versa. |
3.3 Requirements for Functions
| SPM04.F.1 | Technical tailoring | It is possible to actually instantiate the project-specifically selected activity types. |
| SPM04.F.2 | Deletion conditions | The project-specific deletion conditions defined in the Project Manual are taken into consideration during the course of the Technical Tailoring. |
| SPM04.F.3 | Collective activity | It is possible to combine individual activities into collective activities. They are handled as a unit. |
| SPM04.F.4 | Resource consumption per activity | It is possible to determine the resource consumption of individual activities. |
| SPM04.F.5 | Percentage of completion | It is possible to enter the percentage to which an activity has been completed. |
3.4 Other Requirements
| SPM04.O.1 | Experience database | It is possible to file planned values in an experience database. |
| SPM04.O.2 | Upward compatibility | It must be possible to process objects generated with an older release of the tool with the later release of that tool, without loss of information and functionality. |
| SPM04.O.3 | Procedural command language | The tool has a procedural command language that can be applied by the user to generate and run macros or procedures. |
| SPM04.O.4 | Complexity | There is no limitation of the complexity caused by the tool itself. |
|
|
|
GDPA Online
Last Updated 01.Jan.2002
Updated by Webmaster
Last Revised 01.Jan.2002
Revised by Webmaster
|