sap ppppmodule sap r3 system planing with sap ps

8/18/2019 Sap Ppppmodule SAP R3 system planing with sap ps

1/36

•The picture here illustrates a typical R/3 system.

•Multiple presentation layers from multiple computers communicate with

the application servers over the local or wide area network.

•For a single R/3 system, there may e multiple application servers in order

to alance the operational load.•!ll these application servers interact with a single dataase server.

•!nd as the picture illustrates, the dataase server acts as the

interface etween the e"ternal R#$M% and the application servers.

•! single dataase, the R/3 dataase server that accesses it and the set of

one or more application servers and their processes, that govern the

usiness administration and the data sent and received from the dataase

server& all these components that constitute a logically single R/3

system, is called as an R/3 instance.


2/36

•The presentation server is simply a )*+ )raphical *ser +nterface- that is running at the

users workstation. +t is a very light component, called as a thin client in common

terminology. +t is capale of sending reuests to the application server, receiving the

reuests ack and displaying the screen ack to the user.

•Multiple instances of presentation servers can e"ecute in the same work station.

•!nd generally the presentation layers are, to a good e"tent, downward compatile with theapplication servers, in terms of the version. For e.g., ! 01.2 4 version )*+ would e ale to

communicate with a 01.5 $4 version application server.

•The messages e"changed etween the presentation layer and the application server are in

a %!6 proprietary format. The presentation layer is capale of accepting the screen

information sent from the application server, format and generate the screens appropriately

for the platform it is running on.

•The dataase server, as we saw earlier, acts as an interface etween the application server

and the R#$M%.

•!s we know already, the R/3 system does not include the R#$M%. +n other words, R/3 is

independent of the R#$M%. R/3 is operational on a numer of commercial R#$M%s.

•The vendor specific #$ driver resides in the dataase server.


3/36

+n the R/3 system architecture, the application, presentation and dataase server

are separated out. This fulfills the prereuisite for distriuting load into several

application servers for client8server configurations. 9ence in terms of dataase,

the system can e distriuted at different levels.

This architecture enales the host services can e ad:usted without any issues i.e.

scalaility, in cases where the loads on the system changes comprehensively as

a result of increase in the user numers or ecause of components has een

added.

This displays that the R/3 system has the fle"iility while choosing hardware or

software.


4/36

%cheduling uses the uantity structure of network activities to derive dates in an

automated way.

%ingle network schedules all activities of the network. +f it is connected to other

networks y relationships, their dates are treated like constraints.

+n overall network scheduling, the system schedules all networks connected yrelationships.


5/36

elements and @"trapolate it.

+n


6/36

%cheduling parameter> They determine scheduling. These are created for

specific plants and network types.

'. !d:ust asic dates> +t determines that after the scheduling run, the

scheduled dates are copied to the asic dates of the network header.

A. %cheduling Type> +t determines the type of scheduling eing carried out. For e.g.forward first and then ackward scheduling.

3. %tart in the past> +t determines how much time ack was the start date. +f

its more than the days mentioned, scheduling is done from current date.

1. !utomatic %cheduling> %cheduling is carried out when saving is carried out.

5. Bog !utomatic> +f log is generated, it is displayed automatically.

2. $reak %pec. %cheduling> The e"act time at which a reak is scheduled.

(. %hift ?rder> #uring scheduling. +t determines how the system deals with partially

completed activities.

7. Batest material dates> ased on latest and earliest dates, the reuirementsdates for a material is determined.

;. Reduction type> @ither all activities or only those in the critical path are reduced.

'C. Ma"imum reduction level> There are up to 2 levels in reduction strategy. The

highest level is displayed.

''. Rescheduling> !fter scheduling run is done, it determines how the system is


7/36

allocating work in


8/36


9/36

%cheduling Type> #etermines type of scheduling eing carried out.

'. %tart in the past> +t determines how much time ack was the start date. +f

its more than the days mentioned, scheduling is done from current date.

A. %cheduling form> +t specifies as in on what asis is the scheduling eing

carried out D +t determines that after the scheduling run, the

scheduled dates are copied to the asic dates of the network header.

1. Bog !utomatic> +f log is generated, it is displayed automatically.

5. %hift ?rder> #uring scheduling, it determines how the system deals with partially

completed activities.

2. %chedule when saving> %cheduling is done on saving.

(. Batest material dates> ased on latest and earliest dates, the reuirements

dates for a material is determined.

7. Ma"imum reduction level> There are up to 2 levels in reduction strategy. Thehighest level is displayed.

;. Reduction type> @ither all activities or only those in the critical path are

reduced.


10/36

'.

A.

3.

1.

@very time a network is scheduled, forward and ackward scheduling is

carried out y the systemE and if activated it determines float and capacity

reuirements for activities, reduction level used to schedule the network,

earliest and latest dates for the relationship.

Forward scheduling determines the earliest dates.

$ackward scheduling determines the latest

dates.

Float> +f earliest dates are not same as latest

dates, then float occurs.The %cheduling results are>

• %cheduled start and finish for the network.

• @arliest start and finish dates earliest dates- and the latest start and finish

dates latest dates- for activities and earliest and latest dates for relationships.

• Reduction levels used to reduce the network and float times total and free float-

for activities.• !nd capacity reuirements for activities.


11/36

?ther influencing factors in scheduling>

+nternal processing> the normal #uration maintained in the activity is used y

the system for scheduling internally processed activity.

@"ternal processing> 6lanned delivery time or normal #uration e"plicitly to

e activated in control key- will e used y system for scheduling e"ternallyprocessed activity.

)eneral costs activity> #uration

Relationship> Time interval> Fi"ed or as a percentage.

The work centers can e maintained in internally or e"ternally processed activity

and in relationships, and work centers contains following informations>

'. Formulas for calculating duration of activities

A. Factory calendar and operating time for each workday.


12/36

! network must and always scheduled forwards and ackwards and scheduling type

specifies whether forward scheduling or ackward scheduling is carried out first.

Forward scheduling calculates the earliest start and finish dates for all activities, and

the scheduled finish date of the network. ! start activity is an activity in a network

that does not have a predecessor.

$ackward scheduling calculates the latest start and finish dates for an activity latest

dates- and the scheduled start date of the network. ! target activity is an activity in

a network that does not have a successor.


13/36

Scheduling Assembly Networks:

?verall =etwork %cheduling can e performed for a sales order item.

This function schedules the network assigned to the sales order item and all

other networks with relationships to it total network scheduling-.

The function leads to an update of all items in the sales order with assignmentsto the total network.

Overall Network Scheduling with Selection Options:

This function is used along with selection criteria to specify which network/su8

network are to e taken into account as part of overall network scheduling.

! prereuisite for the use of the ?verall network scheduling with selection options

function is that suitale levels are defined eforehand for the pro:ect system and

network types and numer intervals are assigned to it.


14/36

Activity Element & PR !ates

The system calculates dates for activity elements with reference to the start or

finish dates of the activity. Gou maintain a time interval for the start and a time

interval for the finish.

"aterial Re#uirements !ate

The system calculates the reuirements date for components with reference to the

start or the finish date of the activity.


15/36

Gou can maintain constraints for the start and finish of activities and / 4or offsets

for-4 activity elements.

onstraints can e relevant for oth the earliest and the latest

dates. Gou can maintain constraints for asic and forecast sets of

dates.


16/36

Begend>

@% H earliest start

@F H earliest finish

B% H latest start

BF H latest finish

TF H total float

FF H free float

Floats supply information aout time reserves availale for individual activities and

one can use floats calculated in scheduling, for e"ample in capacity leveling, to

shift activities etween their earliest and latest dates or to e"tend their duration.

Total float> The amount of time an activity can e shifted from its earliest dates into

the future without affecting the latest dates of its successor. Total float> H B%8@%

or BF8@F-

Free float> The amount of time an activity can e shifted from its earliest datesinto the future without affecting the earliest dates of its successor. Free float H

@% successor D @F activity-


17/36

The slide descries the calculation of total floats and free floats>

The total float can e calculated as the difference etween the earliest and

latest start of an activity.

+n the aove e"ample>

#ay 2 C>CC- 8 #ay 5 C>CC- H ' #ay.

The free float of an activity can e calculated as the difference etween the

earliest start of the successor and the earliest finish of the activity.

+n the aove e"ample>

#ay ; C>CC- 8 #ay ( A1>CC- H ' #ay.

A


18/36

Reduction>

Reduction can e used when the time period within which activities are scheduled

is not enough for processing all the activities.

This reduces the scheduled duration of internally8processed activities and for

which reduction strategy has een maintained.*p to si" reduction levels can e defined for each reduction strategy. The

percentage reduction reuired can e entered for each reduction level.

A


19/36

3-4 Cost Planning

Based on the resource and material planning using WBS and networks, as

escribed above, the system can automatically calculate planned costs for the

ocurement and the consumption of resources and material. This form of cost

anning is referred to as network costing,

you only use work breakdown structures for mapping pro!ects,

ou manually plan costs on the WBS element level for the later performance ofe individual pro!ect parts.

Two important criteria for a cost planning#s level of detail are the characteris

y cost element and. by date.

ost planning by cost element

a cost planning references one or several cost elements, thisype of cost planning is referred to as a planning by cost elemeost elements are dened in the Cost Element Accounting ofontrolling and correspond to cost-relevant chart of accountsems. Using cost elements, you can structure and classity theonsumption of production factors that is valuated with regard he business purpose. Using cost element reports see !ection

#.#$ or hierarchy reports see !ection#.%$se - detailed planning ,Unit costing , Easy cost planing

ate Planning If a cost planning references the period of thero&ected cost , this type of cost planning is referred to as beineriod based.ost plannings by date allow you to analy'e planned costspecicallyor a period e.g., monthly$ in (eporting and to compare them he actual costs incurred during a period.Use - detailed planning see !ection ).*.)$ and networ+ costinasy Cost lanning is only conditionally date-specic

ote -the other cost planning forms in !A ro&ect !ystem are


20/36

• %ales 6ro:ect D 6ro:ects which have the recognition of revenue at the starting or

during the course of the pro:ect e"ecution.


21/36

Gou define the company using company codes and usiness areas !ccounting view- and

controlling areas, profitaility segments and profit centers ontrolling view-.

The operating concern is the organiJational unit for which the market is uniformly

segmented.

The controlling area is the organiJational unit within the company used to represent

an internal system for cost accounting purposes.

The company code is the alance sheet unit in Financial !ccounting. ompany codes can

e assigned to the controlling area in an =>' or '>' ratio company8code8specific cost

accounting-. +n the ustomiJing settings for the controlling area, you can specify whether

company8code8specific cost accounting is possile. This setting should e considered

carefully and made when you create the controlling area.

The financial management area is the organiJational unit within which you plan, control,

and monitor funds and udgets.

+n the 6ro:ect %ystem module, it is sufficient to assign the company code to one financial

management area. +n Funds Management, you have to assign the financial

management area to the controlling area.

Gou use the usiness area for calculating alances internally.

1


22/36

The 6ro:ect %ystem module has no organiJational units of its own.

#epending on the pro:ect type and configuration, the organiJational units from a wide

range of areas are used sales and distriution, purchasing, production, accounting,

controlling, personnel, and so on-.

1


23/36


24/36

!ll usiness processes throughout the supply chain are e"ecuted in one

system sharing all information


25/36


26/36


27/36

•The picture here illustrates a typical R/3 system.

•Multiple presentation layers from multiple computers communicate with

the application servers over the local or wide area network.

•For a single R/3 system, there may e multiple application servers in order

to alance the operational load.•!ll these application servers interact with a single dataase server.

•!nd as the picture illustrates, the dataase server acts as the

interface etween the e"ternal R#$M% and the application servers.

•! single dataase, the R/3 dataase server that accesses it and the set of

one or more application servers and their processes, that govern the

usiness administration and the data sent and received from the dataase

server& all these components that constitute a logically single R/3

system, is called as an R/3 instance.


28/36

•The presentation server is simply a )*+ )raphical *ser +nterface- that is running at the

users workstation. +t is a very light component, called as a thin client in common

terminology. +t is capale of sending reuests to the application server, receiving the

reuests ack and displaying the screen ack to the user.

•Multiple instances of presentation servers can e"ecute in the same work station.

•!nd generally the presentation layers are, to a good e"tent, downward compatile with theapplication servers, in terms of the version. For e.g., ! 01.2 4 version )*+ would e ale to

communicate with a 01.5 $4 version application server.

•The messages e"changed etween the presentation layer and the application server are in

a %!6 proprietary format. The presentation layer is capale of accepting the screen

information sent from the application server, format and generate the screens appropriately

for the platform it is running on.

•The dataase server, as we saw earlier, acts as an interface etween the application server

and the R#$M%.

•!s we know already, the R/3 system does not include the R#$M%. +n other words, R/3 is

independent of the R#$M%. R/3 is operational on a numer of commercial R#$M%s.

•The vendor specific #$ driver resides in the dataase server.


29/36

+n the R/3 system architecture, the application, presentation and dataase server

are separated out. This fulfills the prereuisite for distriuting load into several

application servers for client8server configurations. 9ence in terms of dataase,

the system can e distriuted at different levels.

This architecture enales the host services can e ad:usted without any issues i.e.

scalaility, in cases where the loads on the system changes comprehensively as

a result of increase in the user numers or ecause of components has een

added.

This displays that the R/3 system has the fle"iility while choosing hardware or

software.


30/36A


31/36

• he !A () system consistsof application modules that

support businesstransactions and areintegrated real-time

– /ecause of integration, a change

in one application module willresult in an automatic update ofthe data in the other applicationmodules involved

0 All application modules have

common A


32/36A

architecture and user interfacesame 1loo+ 2 feel3 andnavigation$.


33/36

•!ccelerated %!6 is a comprehensive solution for the implementation of the

R/3 %ystem, comprising a proven methodology, tools and a range of services

for the rapid implementation and ongoing optimiJation of R/3 installations

•+t provides a standard implementation Khow8to guideK that fills in the gaps of

diverse methodologies and varying individual implementation skills and

e"periences.

•+t is essential that you create a pro:ect plan when starting your !%!6

implementation pro:ect.

A


34/36

+ntegration allows %!6, as a tool, to support all phases of pro:ect management y

communicating with sales and distriution, materials management and accounting

in a real time environment.

A


35/36

The 6ro:ect %ystem is an integrated solution that helps you perform all of the tasks in

a pro:ect 8 no matter which sector of industry you are active in.

+t includes the functions you need in all pro:ect phases.

A


36/36

sap ppppmodule sap r3 system planing with sap ps

Documents