10.3.031_PERT_ _LESS 10.3.031 PERT LESS

St.·P,

'~.

",)

.

'\~.IJ

DISCLAIMER

Although

each

program

has

been

tested

by

its

contributor,

no

warranty,

express

or

implied,

is

made

by the

contributor

or

any

User's

Group,

as

to the

accuracy

and functioning of

the

program

'and

material,

nor

shall

the

fact

of

distribution

constitute

any

such

warranty,

and no

responsibility

is

assumed

by the

contributor

or

any

User's

Group,

in

connection

therewith.

o

• •

COMMON USERS GROUP PROGRAM REVIEW

AND

EVALUATION

(fill

out

in

typewriter,

ink

or

pencil)

Date

~OgramNO.--

__

-------------

----------------

,

ProgramName:

_______________________________________________

,

__________

___

1.

Does

the

abstract

adequately

describe-

what

the

program

is

and

what

it

does?

Comment

--------------------------------------------------

2.

Does

the

program

do

what

the

abstract

says?

Comment

--------------------------------------------------

3.

Is

the

description

clear,

understandable,

and

adequate?

Comment

--------------------------------------------------

4.

Are

the

Operating

Instructions

understandable

and

in

sufficient

detail?

Comment

.

----------------------------------~--------~----

Are

the

Sense

Switch options

adequately

described

(jf

applicable)?

Are

the

mnemonic

labels

identified

or

sufficiently

understandable?

Comment

--------------------------------------------------

5.

Does

the

source

program

compile

satisfactorily

Of

applicable) ?

Comment

--------------------------------------------------

Does

the

object

program

run

satisfactorily?·

Comment

--------------------------------------------------

7.

Number

of

test

cases

run

•

Are

any

restrictions

as

to

data,

size,

range,

etc.

covered

adequately

in

description?

Comlnent

---------------------------------------------------

8.

Does

the

Program

meet

the

minimal

standards

of COMMON?

Comment

---------------------------------------------------

9.

Were

all

necessary

parts

of the

program

received?

Comment

---------------------------------------------------

Yes

No

Yes

No

Yes

No

Yes

No

Yes

No·

10.

Please

list

on

the

back

any

suggestions

to

improve

the

usefulness

of

the

program.

These

will

be

passed

onto

the

author

for

his

consideration

o

Please

return

to:

IBM

Corporation

Program

Information

Department

40 Saw Mill

River

Road

Your

Name

Company

Address

Hawthorne, New

York

10532 U G C d

'"

Attn:

PREP

FORM COORDINATOR

sers

roup

0 e

--------

~HIS

REVIEW FORM

IS

PART OF THE COMMON ORGANIZA11ION'S PROGRAM REVIEW

AND

EVALUATION PROCEDURE. NoNMEMBERS ARE CORDIALLY INVITED TO

PARTICIPATE

IN

THIS EVALUATIONg

2/2/67

. 3

::UstL:::liJMNIN,X

; $ . . (

44t4tAJIU$44

i¥

44

pi

o

1620

10.3.031

January

3, 1964

Statement

231 IW1 = A4 (L) + . 5

in

program

1

has

been

replaced

by

statements:

231

IF

(A4(L) -99999.)

701,125,

125

701 IW1 =A4 (L) + 0 5

This

correction

eliminates

the

possibly

of

getting

an

Error

E9

when A4(L)

becomes

larger

than

99999.

4-

~

':-~

PERT

-

LESS

n

L.

Standlee

Steenrod

Computer

Research

Center

9B&ffi

University

of

Missouri

Columbia,

Missouri

1620

Users

Group

Code 3211

Augus t

30,

1963

Modifications

or

revisions

to

this

program,

as

they

occur,

will

be announced

in

the

appropriate

Catalog

of

Programs

for

IBM

Data

Processing

Systems.

When

such

an

announce-

ment

occurs,

users

should

order

a

complete

new

program

from

the

Program

Information

Department.

Ji-

•

• I

f

~

r

J

I

Ie

Deck

Labeling

Sheet

c

Deck

1 -

Fortran

Program

1

Hash

Total

75367450954418300571

Deck

2 -

Fortran

Program

2

Hash

Total

58007769218123676099

Deck

3 -

Sample

Problem

-

Input

to

Program

Hash

Total

73730844640539713845

Deck

4 -

Output

from

Program

1 _

Hash

Total

78920772480045238602

Deck

5 -

Output

from

Program

2

Hash

Total

54307502721721210377

The

above

decks

were

Hash

Totaled

with

the

1620

Users

Group

Program

1,6.031.

.(

CJ

ABSTRACT

1.

Title:

PERT-LESS

Classification:

Management

Science

2.

Author:

Organization:

L.

Standlee

Steenrod,

Computer

Research

Center,

University

of

Missouri

Date:

August

20,

1963

Users

Group

Membership

Code:

3211

3.

Direct

Inquiries

to

name:

L.

Standlee

Steenrod,

Computer

Research

Center,

9 B & PA,

University

of

Missouri,

Columbia,

Missouri

Phone:

GI

9-9533

4.

Description/purpose:

This

is

a

critical

path

program

devised

to

compute

schedules

of

paths

and

their

associated

"least

cost"

through

a

network

of

activities

of

a

large

project.

The

schedules

are

generated

between

the

project's

normal

time

and

crash

time

and

each

contains

start

and

finish

times,

costs

and

floats

for

each

activity.

These

schedules

enable

a

time

and

its

associated

"

least

cost"

to

be

chosen.

5.

Method:

Critical

Path

Programming

by

Mauchly

Associates;

other

information

-

not

available

6.

Restriction/range:

Not

applicable

7.

Specifications:

a.

Storage

used

by

program:

60

K

b.

Equipment

required

by

program:

Card

system

Auto

divide,

Indirect

addressing,

Floating

point

hardware

Program

can

be

used

on

lesser

machine

if

dimensions

are

reduced

or

part

of

labeling

in

program

deck

2

is

removed

c.

Programming

type

Fortran

II

8.

Remarks:

a.

This

program

is

a

modification

of

SHARE

program

1188

PA

GMCP.

b.

Program

consists

of

two

(2)

decks.

Deck

I

gives

intermediate

output,

Deck

II

gives

final

output

for

listing

.

("

Cj

•

o

Table

of

Contents

Discussion

Input

Format

Output

Operating

Instructions

Appendix

A -

Panel

Wiring

Appendix

B -

Program

Listings

Program

1

Program

2

Appendix

C -

Sample

Problem

Input

for

Program

Input

for

Program

Output

I

Page

5

10

12

14

16

24

30

32

33+1

r}

All

inquiries

concerning

the

following

program

should

be

directed

to:

Note

L.

Standlee

Steenrod

Computer

Research

Center

9 B &

PA

University

of

Missouri

Columbia,

Missouri

Users

Group

Code

3211

n

These

programs

(2)

are

a

translation

of

the

SHARE

program

1188

PA

GM

XP

for

the

7090

to

a

form

usable

on

the

1620.

Because

of

this

much

of

the

mathematical

method

is

unavailable.

Surmnary

Critical

Path

Programming

is

a

method

devised

to

plan

and

control

large

projects

composed

of

many

activities

that

must

be

completed

in

certain

sequences.

In

these

programs

the

critical

path

method

has

been

programmed

in

the

FORTRAN

language.

This

permits

the

computer

to

accept

a

description

of

a

project

structure

and

time-cost

information

for

each

activity

in

order

to

generate

a

series

of

project

schedules.

Each

project

schedule

has

a

certain

duration

and

cost

associated

with

it.

This

cost

arises

from

assigning

to

each

activity

in

the

project

a

scheduled

duration

and

In

general,

the

shorter

the

activity,

the

higher

the

activity

cost.

The

project

time

a

schedule

results

from

the

durations

assigned

the

various

activities

together

with

the

precedence

relation-

ships

binding

the

activities.

For

each

schedule

generated,

its

project

cost

is

the

least

possible

for

that

project

time.

The

FORTRAN

programs

are

designed

for

flexibility.

Various

types

of

computer

runs

can

be

made,

and

alternative

forms

of

output

are

obtainable.

These

are

described

in

detail

under

Input.

Discllssion

I.

Background

The

basis

of

these

programs

is

PERT

(Project

Evaluation

and

Review

Technique)

developed

for

the

U.

S.

Navy

to

help

measure

and

control

progress

on

the

Polaris

System.

The

PERT

model

assumes

that

a

project

can

be

broken

down

into

activities

(or

sub

-

projects)

and

that

the

sequence

relationship

between

these

activities

can

be

specified.

A

graphical

representation

of

a

project

can

be

obtained

by

depicting

activities

as

arrows,

each

beginning

and

ending

at

a

point

called

a

benchmark

or

event.

Several

activities

may

begin

or

end

at

a

single

event.

Figure

I

is

used

as

an

example

of

such

a

graphical

representation

':\

..

of

a

small

project.

b 9

~~

c4

I

~'-

5 e

~"

-0-'

~~

Q-t------~)-----

~-

FIGURE

I

In

this

example,

a

network

of

6

activities

(arrows

a,b,c,d,e,f)

defined

by

5

events

(circles)

might

represent

a

small

project.

The

project

begins

with

activity

"a"

is

completed,

event

"2"

is

realized

and

activities

"b"

and

"d"

are

innnediately

begun

in

parallel.

When

"d"

is

complete

at

event

"3",

activities

"e"

and

"f"

are

begun

in

parallel.

Event

"4"

is

realized,

or

occurs,

only

when

both

"b"

and

"e"

are

completed.

The

same

structure

represente~

Figure

I

can

be

described

by

listing

the

6

pairs

of

event

numbers

describing

the

6

activities;

let

us

also

list

a

sample

completion

time

for

each

of

these

activities.

Activity

Completion

Time

in

Weeks

(a)

1,2

(d)

2,3

(b)

2,4

(e)

3,4

5

(f)

3,5

6

(c)

4,5

4

FIGURE

II

Thus,

Figure

II

is

logically

equivalent

to

Figure

I.

In

the

PERT

System

it

is

only

necessary

to

supply

information

of

the

type

in

Figure

II

to

analyze

the

status

of

a

project.

Project

completion

time

can

be

obtained

by

tracing

all

paths

connecting

the

first

event

(1)

to

the

last

event

(5),

and

adding

together

the

completion

times

of

activities

along

each

given

path.

The

path

giving

the

largest

sum

would

be

called

the

"critical

path"

and

its

sum

would

be

the

project

duration.

In

Figure

I,

three

paths

connect

events

(1)

and

(5).

These

are:

a-b-c

a-d-e-c

a-d-f

(j

q

(3+9+4=16)

(3+2+5+4=14)

(3+2+6=11)

c

Path

a-b-c

is

critical,

and

project

time

is

16.

By

g1v1ng

three

time

estimates

for

each

activity,

uncertainty

is

inCOrPorated

by

the

PERT

method

into

the

overall

project

completion

time.

3

This

program

employs

a

network

representation

and

also

activity

costs.

Each

activity

is

assumed

to

have

a

"normal

time"

for

completion

and

an

associated

"normal

cost".

Likewise,

each

activity

is

assumed

to

have

a

"crash

time",

generally

less

than

the

normal,

and

on

associated

"crash

cost"

-

generally

higher

than

normal

cost.

The

Critical

Path

Progrannning

Method

assumes

that

in

the

time

-

cost

plane,

the

"normal

point"

can

be

connected

by

a

straight

line

to

the

"crash

point"

to

define

an

activity

cost

function.

Figure

III

below

represents

this

relationship.

Crash

Cost

(XA4)

Normal

Cost

(XA2)

Cost

Crash

Time

(XA3)

Activity

Cost-Time

Function

Normal

Time

(XA1)

FIGURE

'III

Time

The

Method

assigns

each

activity

a

duration

between

crash

and

normal

XA3,XAl ,

at

the

associated

cost.

See

PERT, Summary

Report

Phasel,

Special

Projects

Office,

~ureau

of

Naval

Weapons,

Department

of

the

Navy,

Washington,

D.C.

o •

o

4

An

algorithm

developed

by

J.

E.

Kelly,

Jr.

of

Mauchly

Associates

generates

a

series

of

project

schedules

(assignments

of

times

to

activities)

such

that

for

each

project

schedule,

its

associated

cost

is

the

least

possible

for

the

project

time.

The

first

schedule

generated

is

the

"normal"

project

schedule

which

results

from

setting

all

activities

at

their

normal

times.

This

is

clearly

the

least

cost

and

longest

project

schedule.

Then,

successive

schedules

are

generated

down

to

a

"crash"

time

project

schedule

which

is

the

shortest

possible

time

and

the

least

expensive

for

that

time.

The

number

of

schedules

is

unknown

in

advance,

depending

on

project

structure

as

well

as

activity

cost-time

curves.

This

generates

a

project

cost-time

function

which

when

linearly

connected,

is

like

Figure

IV

below.

Project

Cost

Crash

Project

Time

Crash

Schedule

Figure

IV

Project

Cost-Time

FlJlnction

--

Normal

Schedule

__

Project

Normal---7-"

Time

Project

Time

The

project's

cost-time

curve

can

then

be

scanned

and

the

appropriate

duration

and

cost

point

for

the

project

can

be

selected.

Corresponding

to

each

point

on

the

curve

(Figure

IV),

a

schedule

is

generated

and

each

activity

set

at

a

completion

time

between

normal

and

crash

times.

Schedules

between

indicated

points

can

be

computed

from

the

schedules

associated

with

the

two

neighboring

points.

\\

~

_~o-l

n

II.

Program

Description

This

program

is

composed

of

two

decks.

major

part

of

the

computation

and

provides

used

as

input

into

program

II.

Program

II

labels

the

final

output.

This

output

must

board

described

later.

The

first

deck

does

the

intermediate

output

to

be

primarily

arranges

and

be

listed

on

a

special

III.

Input

Data

The

input

for

Program

I

is

divided

into

four

simple

parts.

Let

us

assume

that

a

project

has

"N"

events

and

"LL"

activities.

a)

The

first

data

card

for

a

computer

run

has

an

integer

punched

in

column

2.

In

the

program

it

sets

the

value

of

a

control

variable

called

"19".

This

variable

defines

three

possible

types

of

computer

runs

the

project.

I 9 = 1

Generates

all

possible

characteristic

project

schedules.

2

Generates

"normal"

schedule

only

(the

longest

pos~ible

project

duration)

3

Generates

"normal"

and

"crash"

project

schedules.

The

"crash"

schedule

in

this

case

results

when

all

activities

are

set

at

"crash"

time.

b)

The

second

part

of

the

input

data

consists

of

four

cards

(cards

2

through

5

of

the

data

input

deck)

containing

project

description

information

that

will

subsequently

appear

on

the

schedule

printouts.

The

first

of

these

four

cards

contains

the

date

to

appear

on

all

schedules

from

this

machine

run.

It

is

punched

in

columns

1-12,

in

any

convenient

manner

(e.g.,

2

MARCH

61

or

3/1/61,

etc.).

The

second

of

these

cards

has

punched

into

columns

1-36

the

division

or

entity

involved

in

the

project.

Any

format

within

column-s------

1-36

is

permissible.

The

third

card

contains

the

project

description

punched

in

columns

1-72,

in

any

desired

manner.

The

fourth

card

has

punched

in

column

1

through

6

the

time

units

(e.g.,

"WEEKS")

appropriate

to

the

input

data

for

this~puter

run.

In

columns

7-18

are

punched

the

appropriate

cost

units

(e.

g.,

"DOLIARS"

or

"1000

DOLIARS

"l

--

c)

The

third

part

of

the

input

data

consists

of

"LL"

activity

cards

followed

by

a

trailer

card

with

a

negative,

non-zero

integer

punched

in

columns

6-10.

One

card

should

be

present

for

each

activity

in

the

project.

The

card

format,

for

each

activity,

is

as

follows:

--

p---

•

1) Columns

1-5:

Preceding

event

number.

2) Columns

6-10:

Succeeding

event

number.

This

must

be

larger

than

the

number

in

columns

1-5.

3)

Columns

12-40:

Activity

description

(any

format).

4)

Columns

41-45:

"Normal"

activity

time.

A

decimal

"XA1"

point

is

assumed

between

columns

44

and

45.

Do

no~

punch

the

point.

5)

Columns

46-55:

"Normal"

activity

cost.

A

decimal

"XA2"

point

is

assumed

between

columns

54

and

55.

Do

not

punch

the

point.

6) Columns

56-60:

"Crash"

activity

time.

Decimal

point

"XA3"

assumed

between

59

and

60 -do

not

punch

it.

-

7)

Columns

61-70:

"Crash"

activity

cost.

Decimal

point

"XA4"

~

between

69

and

70,

do

not

punch

it.

8)

Columns

71-72:

This

field

is

normally

not

punched,

hence

is

treated

as

a

zero.

Any

non-zero

integer

in

this

field

causes

the

activity

to

be

set

at

either

"normal"

or

"crash"

time,

but

at

no

pOint

in

between.

When

all

''LL''

activity

cards

are

prepared,

they

must

be

sorted

in

ascending

sequence:

major

sort

on

columns

1-5,

minor

on

columns

6-10.

Finally,

the

trailer

card

follows

with

a

negative

integer

in

columns

6-10.

The

following

conditions

on

XAl,

XA2,

XA3

and

XA4

must

hold

for

each

activity

card.

1)

XA3

<

XA3

(crash

time

<

normal

time)

2) XA2-<

XA4

(normal

cost-<

normal

time)

3)

if

xA3

= XAl,

cannot

have

XA4

#-XA2

(infinite

slope

on

time

-

cost

function)

d) The

fourth

part

of

the

input

data

consists

of

'N"

event

cards

followed

by

a

trailer

card

with

a

negative,

non-zero

integer

punched

in

columns

6-10.

One

card

should

be

prepared

for

each

event

in

the

project

-

punched

as

follows:

1) Columns

6-10:

Event

number

2) Columns

12-71:

Event

description-any

format

.3

~ o

The 'N"

event

cards

must

be

sorted

in

ascending

sequence

on

columns

6-10.

The

trailer

card

follows.

This

concludes

the

input

for

Program

I.

The

input

for

Program

II

is

the

intermediate

output

from

Program

I

plus

a

header

card

which

contains

parameters

that

specify

what

schedules

are

to

be

drawn

from

the

data

for

output

printing.

The

intermediate

output

consists

of

partially

completed

schedules.

The

last

card

of

the

intermediate

output

deck

contains

'N" -

the

number

of

events,

"LL" -

the

number

of

activities,

''MIK'' -

the

maximum

schedule

count

(k=O,

1,2,---,MIK),

"I

9"

-

for

this

computer

run.

This

card

must

be

moved

to

the

front

of

the

intermediate

output

deck.

The

header

card

is

then

placed

in

front

of

this

card.

During

a

machine

run,

if

I 9

=1,

all

characteristic

schedules

are

generated;

this

set

begins

with

the

normal

and

terminates

with

the

crash.

Each

schedule

has

a

characteristic

project

time

and

project

cost.

In

this

case,

the

above

mentioned

parameters

permit

a

selection

of

these

schedules

for

printout

according

to

several

criteria

that

will

become

evident

in

the

following

descriptions.

If

I 9

1,

the

leader

card

is

punched

in

the

following

manner.

Columns

1-5

(KE)

=1

print

every

"KD"

schedule

=2

selects

only

such

schedules

for

printing

that

differ

from

their

predecessor

by

"DT"

in

project

duration

or

"DC"

in

project

cost.

=3

selects

only

such

schedules

for

printing

that

differ

from

their

predecessor

by

"DT"

in

project

duration.

=4 no

output

printing

of

schedules.

Columns

6-10

(KD)=1,2,

...

;

if

"KE"

-1,

KD

is

the

sampling

interval

for

printing

out

schedules.

Thus,

if

KD=3,

schedules

0,3,6,9,

...

would

be

printed.

Columns

11-15

(IR)

= 0

Columns

16-20

(INDIR) = 0

will

eventually

be

used

to

incorporate

indirect

project

costs.

;../

•

o •

o

Columns

21-30

(DT)

Columns

31-40

(DC)

8

A

ten

digit

time

increment

with

a

decimal

point

assumed

or

punched

before

column 40

(see

"KE"

above).

A

ten

digit

project

cost

increment

with

a

decimal

point

assumed

or

punched

before

column 50

(see

"KE"

above).

Don't

punch

if

KE=1,4.

If

19 = 2

or

3,

the

columns

26-50

(INDIR,DT,DC)

are

ignored.

KE

and

KD

are

both

punched

one,

IR

is

punched

zero.

Most

of

the

options

for

preparing

printer

output

are

summarized

in

the

following

table.

EDITING

OPTIONS

Desired

Schedules

All

Schedules

Normal,

Every

6[th,

Crash

Normal,

6T

or6C,

Crash

Normal,

6T

AND

6C,

Crash

No

Schedules

KE

3

4

Variable

Settings

on

Parameter

Card

KD

IR INDIR

DT

DC

-----r.

----r----·--

1 ! 0

6C

6K

i:

I

i I

'0

I

6T

6C

6T

i

I:)

n

Input

Program

I

1//

J'

/J

SUMMARY

OF

INPUT

DATA

,,/'

'

I "N" E

/

~:

/ + 1

v'~t

Card,

L_

~

~_

/

~

Tr"'or

Card

=-J_~~::_-----

---

( )

§

_]

J///"LL"

Activ·

19

= 1 2 . .

-"

/ + 1

Tra·l

1ty

Cards

,

,3

1

er

Card

__

-'

4

Card

"Label"

Input

Program

II

,/1

I

/

-

--1

~

r----,l

.

L_

ij~/

~

n

Intermediate

Output

N,LL,MIK,I9

1

Parameter

Card

/0-..

•

lO

IV.

Output

All

the

selected

schedules

are

printed

and

then

the

project

time-cost

curve

is

printed

at

the

end.

Each

schedule

selected

for

output

printing

is

arranged

into

three

parts.

Common

project

information

is

shown

on

every

page.

a)

Activity

List

The

first

part

of

every

schedule

report

contains

a

detail

line

for

each

activity.

Printed

with

each

activity

is

the

minimum

schedule

information:

the

activity

"Duration"

and

"Direct

Cost".

In

addition,

the

report

provides

the

earliest

start

and

finish,

the

latest

start

and

finish,

and

three

floats

-

total,

free,

and

independent.

Exact

definitions

of

these

quantities

can

be

found

in

"Definitions".

b)

Event

List

The

second

part

of

every

schedule

report

contains

a

detail

line

for

each

event.

A

detail

line

is

prepared

for

each

event

giving

its

earliest

and

latest

occurrence

times.

c)

Critical

Activities

The

third

part

of

every

schedule

contains

a

detail

line

for

each

critical

activity.

Since

such

activities

have

zero

float

values

are

not

printed.

The

other

information

that

appeared

for

these

critical

activities

under

"activity

List"

is

repeated

here

for

convenience.

All

output

is

to

be

listed

with

a

special

407

Panel

Board

(diagram

in

Appendix

A)

or

the

"FORGO"

panel

board.

V.

Miscellaneous

Details

a)

Constraints

on

Project

Size

Number

of

activities

(LL) < 50

Number

of

events

(N)

~

50 -

These

restrictions

are

due

to

the

dimension

statements.

The

size

may

be

increased

somewhat

with

no

overlap

or

if

Disk

File

is

available

the

number

can

easily

be

increased.

b)

Program

Stops

Only

one

stop

besides

the

ones

at

the

end

of

each

program

is

provided.

It

appears

in

Program

I

on

the

typewriter

as

ERROR

-

CORE

3

STOP

If

this

error

occurs,

or

any

other

irregularity,

first

check

the

input

data

as

the

error

will

usually

be

found

here.

I "

~

~~

\~

11

c)

Scaling

of

Input

Data

J.

E.

Kelley's

algorithm

is

an

"integer"

algorithm.

Hence,

to

assure

convergence,

it

is

necessary

to

scale

input

data.

To

be

safe,

activity

costs

as

described

under

III

-

c,

should

be

kept

less

than

105

in

magnitude.

Should

they

be

larger,

we

would

suggest

a

change

of

cost

units

(e.g.,

substitute

"Thousands

of

Dollars"

for

"Dollars").

d)

Event

Numbering

The

events

of

the

project

network

must

be

numbered

such

that

the

"head"

of

an

activity

arrow

has

a

larger

event

number

than

its

"tail".

e)

Accuracy

Since

the

algorithm

is

an

"integer"

algorithm

some

errors

occur

due

to

truncation.

These

errors

should

be

expected

and

in

relation

to

the

total

should

be

small.

VI.

Definitions

a)

General

Definitions

1.

Total

Float

for

activity

(I,J)

is

defined

to

be

the

latest

occurrence

of

event

J

minus

the

sum

of

the

earliest

occurrence

of

event

I

and

the

duration

of

activity

(I,J).

2.

Free

Float

for

activity

(I,J)

is

defined

as

the

earliest

occurrence

for

event

J

minus

the

sum

of

the

earliest

occurrence

of

event

I

and

the

duration

of

activity

(I,J).

3.

Independent

Float

for

activity

(I,J)

is

defined

to

be

the

earliest

occurrence

of

event

J

minus

the

sum

of

the

latest

occurrence

of

event

I

and

the

duration

of

activity

(I

,J)

.

b)

Definitions

of

Variables

used

in

the

FORTRAN

Programs.

l.

N:

Number

of

events

in

the

project

network.

2.

LL: Number

of

activities

in

the

project

network.

3.

B:

The

total

fixed,

direct

cost

for

a

schedule.

4.

IK: The number

of

a

schedule

(IK

=

O,1,2,

...

,MIK)

} f

c)

•

o

12

5.

IAl(L):

The

preceding

event

number

of

the

Lth

activity.

6.

IA2(L):

The

succeeding

event

number

of

the

Lth

activity.

7.

A4(L):

Absolute

value

of

slope

of

time

-

cost

curve

of

activity

"L"

S.

AS

(L):

"Crash"

time

for

activity

"L".

9.

A9

(L):

"Normal"

time

for

activity

"L".

10.

AlO(L) :

Duration

of

activity

"L".

VII.

Operating

Instructions

First

clear

the

computer

by

pressing

INSTANT

STOP

RESET

INSERT

Type

on

the

typewriter

160001000000

Then

press

the

R-S

button

on

the

typewriter

or

RELEASE,

START

on

the

computer,

Wait

about

15

seconds

then

press

INSTANT

STOP

RESET

Set

I/O,

Parity

switches

to

stop;

overflow

to

program.

Place

Program

Deck

I,

Subroutine

Deck*

and

Input

Data

for

Program

I

in

the

1622 Read

Hopper.

Press

LOAD

on

the

1622

and

PUNCH

START

on

the

1622.

When

the

typewriter

types

"LOAD

SUBROUTINES",

press

START

on

the

1620.

When

the

typewriter

types

"ENTER

DATA",

press

START

on

the

1620.

When

the

"READER

NO

FEED"

light

on

the

1620

lights,

press

READER

START

on

the

1622.

*If

the

last

card

of

Program

I

is

numbered 807

in

columns

78, 79,

80,

the

Subroutines

are

E£!

in

the

program

and

must

be

added

separately.

/

.9

o

~

13

When

Program

I

is

finished,

the

typewriter

will

type

"END

OF

PROGRAM

1,

LOAD

PROGRAM

2,

AND

DATA

IN

PROPER

ORDER

-STOP".

Remove

the

blank

cards

from

the

Punch

Hopper,

press

NON

PROCESS

RUNOUT

on

the

1622,

remove

the

2

blank

cards

from

the

end

of

the

deck

and

then

take

the

last

card

from

this

deck

and

place

it

on

the

front

of

the

deck.

Place

the

header

card

in

front

of

this

card.

This

is

now

the

input

data

to

Program

II.

Clear

the

computer

again

as

directed

before.

Place

Program

Deck

II,

Subroutine

Deck*

and

Input

Data

for

Program

II

in

the

1622 Read

Hopper.

Press

LOAD

and

PUNCH

START

on

the

1622.

When

the

typewriter

types

"LOAD

SUBROUTINES",

press

START

on

the

1620.

When

the

typewriter

types

"ENTER

DATA",

press

START

on

the

1620.

When

the

"READER

NO

FEED"

light

on

the

1620

lights,

press

READER

START

on

the

1622.

When

Program

II

is

finished,

the

typewriter

will

type

"STOP".

Remove

the

blank

caEcls

from

the

Punch

Hopper,

press

NON

PROCESS

RUNOUT

on

the

1622,

remove

the

2

blank

cards

from

the

end

of

the

deck.

This

is

the

final

output

ready

for

listing

on

the

407

Printer

with

special

panel

(see

Appendix

A).

VIII.

Equipment

Reguired

1620

computer

(60K

memory)

1622

card

Reader

-Punch

407

Printer

Fortran

II

Compiler

-1620 -

FO

-019

Version

1

*If

the

last

card

of

Program

II

is

numbered 717

in

columns

7S,

79,

80,

the

Subroutines

are

not

in

the

program

and

must

be

added

separately.

.2

()

•

~

14

Appendix

A

Panel

Wiring:

This

panel

is

to

be

used

to

list

the

output

from

Program

II.

The

FORGO

panel

can

also

be

used

if

the

wire

to

the

overflow

(upper

left

section)

is

removed,

this

controls

the

printing

of

the

student

number,

page

number

and

the

data

at

the

top

of

each

page.

This

panel

is

controled

by

characters

in

column 1

and

performs

in

the

following

way.

Column

blank

c

+

o

(zero)

I

1-5

J-n

407

Control

Normal

operation

Print

a C

in

column

1.

No

space

before

printing.

Double

space

before

printing.

Shift

columns

25-72

of

card

to

column

73-120

of

sheet.

Skip

to

channels

1-5

on

the

407

carriage

control

tape

Short

skip

to

channels

1-5

of

the

407

carriage

control.

All

other

characters

cause

some

combination

of

the

above

operations.

Carriage

Control

Tape:

This

tape

should

be

punched

as

follows:

Column Punch

2

1-5

16 4

22 3

33

2,4

44 3

49 4

62 12

68

1-5

82 4

88 3

99

2,4

110 3

116 4

123 12

The

tape

should

be

132 columns

long.

c o •

o

~

•

t

IBM

INTERNATIONAL BUSINESS MACHINES CORPORATION

IBM

407,

408,

409

ACCOUNTING MACHINES, CONTROL

PANEL

DIAGRAM

FIXED

408,

409

CARRIAGE CONTROL

PANEL

--

r~---·--

'0

-

co

S!lt(TO~~

;·:~UO

B

"

'I'

"',.>~~~~"\'~~~~"\'~"\'~~"\'~~~~~~'\

i

I;~

o-~-~':""~'

-;,--o-o-,~·

i

..

-'R'"

-

--

~

-----""-""---

,

CZ3

~

~..,

" •

~

•

EZoIO

---

--(;

~

-

---

~-'

~

~)

• v

~

_

"-,

1

- -

:-:

------<..

-

,.",,,-

-

'"''

-

--

::~

i;,"''':.1

.,:

c.

---4-:::~-=:==-~:'.':-==.c~--=-1

==~

~

i;·Ulhrij'

~;~·~rr

,~')',::==t"

,n'

-~~--:

,_:~'

~

I

~',',"

~;_'O"_

'_~

C~~=,'"

"~:,:

=-~

~F

'

""".":-',

REPORT

JE

R r -

L,=E~S~s

___

_

L

.S"t:~b

d

Le.

E;..

.

st.e._~

111"

~c{_

';),/,':

• .>i<.AII. NO_

DAH

A

(..t..l-

;2

9 ) I

~

:3

~~

,9-6UOM-Sl

• •

o

C

c

o

16

Appendix

B

The

following

are

the

program

listings.

~RAIII

1

DIMENSION

ZI(50).IA1(50).IA2(50

••

A4(50).A.(501.A9(50).I£I(50)

Dl~NSlON

1!Z(50).A'(50)

DIMENSION

IE4(50)

,lAs(

50)

.f5UO

J

."6"0"A7(50)

1 FO""A T

el2

)

3

FORMAT(ZI5.7A4.AZ.ZlF5.G.FIO.OJ.F2.01

4 FORMATC5X.15,10(A4.A2tJ

8

FORMAT(2I5.7A4.AZ.ZlF5.0.F10.0J.FIO.O)

106

FORMAT«

Z(

A4.l2)

16e

A4,A2"12

(A4.A2)

Il(

A4,A2 U

RE~

AND

PUNCH

~08

DESCttI'TION

CARD

REAO

1.19

~EAO

l06.CZUllhU-h46)

PUNCH

106.rZl(ll).ll-1,46)

"""-1

L-O

'-0

12'

L-L+1

It!.

"

tAU

L)

.lA2

CU.

(Z1

C

I)

• I

-It.)

.XAltXA2

,XA3

.XA4.

XAS

XA2-100.*XAZ

XA4-100.*XA4

rF(IAZ(LttI7S.1S2.1!Z

132

IFeXAI-X"3)141.148.133

133

IF(XA4-XAZ.l.,,14,.15'

148

"4(l)-0.0

Z-XAZ

GO

TO

161

I"

n-le

IF

O(A5U46.147,146

146

W--I.

141

"4

(l)

-W*CXA4-XAZ»

IUAI-U3J

Z-XA4+A4CL)*XA3*VV

161

a-lI+z

UCLI-U3

AgeLI-UI

Z-Zl1ooo.

XXAI-XAI

XXAZ-XAz/IO'O.

XXA3-XA'

UA4-XA4/100.

PUNCH

l.tAl

CI.1

.lA2

(LhUH

I

It

1-1.8»

.XXAhXXA2.XXA3.XXA4.Z

IFCA4(L)-1.)75.75.2Jl

15

IF(A4(I.))225.76.225

16

IF(XAS)77.71.11

77

VM--l.

GO

TO

90

18 VIII-t.

GO

TO

'0

225

VIII-ASSF(A4(L

••

/A4(L'

90 tFeVM)Z26.Z28.Z28

226

IF(A4(l)+I

••

125.227,227

:J-J

o

2Z7

A4(l)--I.

GO

TO

125

228

IF(A8(L)-A9(L»)230.229.230

229

A4(U-0.0

GO

TO

125

230

A4Cl)-1.

GO

TO

125

231

IVI-A4(ll+.5

A4(L)-JW1

GO

TO

125

173

lL-L-1

N-1

110

REAO

4.IE1(N).CIICI).I-1.20)

IF(IE1(NI)122,113,113

113

PUNCH

4.IE1(NJ.(ZI(II.J-1,20)

N=N+1

GO

TO

110

122

N-,.-1

12-1

IE4(l

)-1

C

RENUMBERING

NODES

DO

210

I3-1,lL

206

IFCIA1(13)-IE1fI2)J207.210,207

201

12-12+1

lE4(12)-13

GO

TO

206

210

IAl(

13)-12

13-1

217

DO

222

J2-1,N

218

IF(IA2(13)-IEl(121)217.219,222

219

IA2(13)-12

13=13+1

IF(13-LL)218,218,223

222

CONTINUE

223

00

224

12-1,N

£5(12)·0.0

224

IEl(

121-12

IE4(N)-lL+1

1500

GO

TOC1505.1135,1735.,19

1505

N02N-1

DO

1570

l-l,NO

KlaIE4(I)

K.2-IE4(

1+1)-1

DO

1560

K"Kl,K2

Ja

IA2

CK)

X=A9CK)+E5(1)

IF(E5(JJ-X)1550.1560.1560

1550

E5(J)-X

1560

CONTI

NUE

1570

CONTINUE

;;..-i

~

17

COMPUTER

TECHNOLOGY

•

IIC.

..

O

1590

DO

1595

L-1,LL

A3(L)-0.0

IA5(U-0.0

1595

A6

(l)

-0.

DO

1690

l-l,NO

Kl-IE4(l

)

K2-IE4(

1+1)-1

DO

1680

L-U.K2

J-IA2(l)

A6(L)-A9(l}+ES(II-E5IJ)

A7(L)-A8(L)+ES(ll-E5(J)

IF(A7(L)

1650,1675.1650

U50

IFIA6Il))

1655.1665.1655

1655

1A5IL).,l

GO

TO

1680

1665

IA5(L)-2

GO

TO

1680

1675

IA5(U-3

1680

CONTINUE

1690

CONTINUE

C

1135

STARTS

CORE

3

DIMENSION

A90(50),AI00(SOI.E6(50)

1135

DO

1952

L-1,LL

AIOO(L)-A9(U

1952

A90(L)-A9(LJ

IK.O

2000

TC-O.

DO

2011

J-l.LL

IF(A4(JJ)2002,2007.2007

2002

V=-l.

2003

IF(AIOO(J)-A90(J))2006,200

4

.2004

2004

tF(A4(J)+1.I2010.2005,200S

2005

A90(J)-0.O

GO

TO

2011

2006

AI00(J)-A8(J)

GO

TO

2004

2007

Val.

IF(A4(J)-1.)2009,2009,2010

2009

A90(J)=O.

GO

TO

2011

2010

A90(J)·AI00(J)*A4(J)*V

TC-TC+A90IJI

2011

COHTI

NUE

TC-S-TC

00

2050

I-I,

..

E5

(I)

-0.

2050

E6(1)-.95E31

NO-N-I

DO

2100

I-I,NO

~

18

/

.)-

)

CJ

U-IE4(

l'

K2-IE4(

1+1

I-I

DO

2090

K-U

.K2

J.

I

A2

no

X-AI00(lO+E,

(I)

IF(E'(JI-X)2011,2090,2090

2011

E5(J)-X

2090

CONTINUE

2100

CONTI

NUE

E6(N)-E5(N)

DO

2140

I-I,NO

lOaN-

I

Kl-rE4IIO)

K2-IE4(10+l)-1

DO

2130

K-Kl.K2

J"'IA2

(K)

X-E6

(J

)-AI00

(10

IF(E6(10)-X)2130,2111,2111

2111 E6(10)"'X

2130

CONTINUE

2140

CONTINUE

TC-TCI1000.

X=E6(NIII0.

PUNCH

5,IIC.,TC,X.B

5

FORMAT

(14.3EI2.6)

DO

2180

J-l,LL

2180

A90(J)-A90(JI/I000.

PUNCH

9,(A100(I),I-l,LL)

PUNCH

9.(A90(I),I-l.LLI

DO

2220

I-l.NO

Kl-IE4(

I I

K2-IE4(1+1)-1

DO

2220

L-UtK2

A90IL)-E5(1)

J=IA2tL)

2220

AI00(L)-E6(JI

PUNCH

9.tA90(1).I-l,LL)

PUNCH

9,(A100(I).I-l.lL)

DO

2270

l-l.NO

Kl-rE4(J)

K2-IE4(

1+1)-1

DO

2270

L-Kl.K2

A90(L)-E6(I)

J:aIA2

(ll

2270

AlOO(L)-ES(J)

DO

2218

J"1.N

ES

(J)

-E'(

J)

/l0.

ZZ78

E6tJ)-E6(J)/lO.

PUNCH

9.(A90tI),I-l,lll

PUNCH

9.(A100(I),I-l.LL)

':~

19

"I

b

•

o •

c

~

'c:.J

20

21

IElCI)-l

PUNCH

10.(E5(11.1-1.NI

4175

CONTINUE

PUNCH

10.(E6CI).1-1.NI

LISW-1

9 FORMAT(8EIO.41

DO

4340

1-1.NO

10

FORMAT

(

8E10.4)

ISW"IElC

I)

2!00

GO

TO(2510.9000.2505.9000).19

GO

TO(4'40.4120.4120.4215),ISW

2505

DO

2507

L-l.LL

4215

U-I!4(1)

2507

A100(L)-A8(LI

KZ-IE4(

I+ll-l

19-4

DO

4325

K-U.K2

I

K-IK+l

KSW=IA5(K)

GO

TO

2000

GO

TO(4'25.4235.4253).KSW

2510

IF(NNA-112514.2512.2514

4235

IF(A3(K»4325.4325.4240

2512

IKaO

4240

UC-A3(K)

2514

CONTINUE

GO

TO

4265

4000

DO

4005

1-2.M

4253

Z-A4C10

4005

IE1(I)-4

IE21l

1

--I

4254

If(A3(K)-Z)4325.4'Z5.4255

E6(1)-.95E37

4255

UC-A3CK)-Z

4265

J3.IA2(K)

IEUII-2

J3SW-IE1(J31

4030

NO-N-1

GO

TO(429~.4120.4120,4325).J3SW

DO

4115

l=l.NO

4295

IFIE6(II-UCI4296.4296.4297

1

SW-

lEU

J 1

4297

E6(1)-UC

GO

TOI417S.4050.4175.4175).ISW

4296

IE2(1)--J3

4050

U-IE4(I)

lEUII-2

K2-IE411+1I-l

LBSW-2

DO

4160

K=IO.

K2

GO

TO

4340

KSW-IA50U

4325

CONTINUE

GO

TO(4160.4075.41001.KSW

lElIl)-3

4075

IFIA4IKI)4076.4018.4078

4340

CONTINUE

4076

Z=-A4(KI

IEUN)-3

GO

TO

4079

GO

TO(6000.43551.LBSW

4078

Z-A4(

10

4355

DO

4395

1-1.N

4079

IFCA3(KI-ZI4080.4160.4160

LSW=IEl(

II

4080

Z-Z-A3(KI

GO

TO(4395.4395.4385.41201,LSW

IF(E6(II-ZI4081.4082.4082

4385

IElell:4

4081

ERS=E6

(II

4395

CONTINUE

GO

TO

4105

GO

TO

4030

4082

ERS-Z

5000

IF(E6(NI-.9E3715005.9000.9000

GO

TO

4105

4100

ERS-E6II)

5005

IF(E6(NI)4120,5010,5010

5010

IF(IE2(N»)4120,5014.5014

4105

J3aIA2(KI

5014

JO-N

J~SW=IEl(J31

5015

IF(IE2(JO»5020,5045,5045

GO

TO(4160,4160.4120,4135),J3SW

5020

Z--I.

4120

PRINT

4125

J1=-IE2(J0)

4125

FORMAT

Cl~H

ERROR-CORE

3)

10-JO

STOP 3

JO-J1

4135

JEl(J31"2

GO

TO

5060

E6(J31-ERS

5J45

Z-1.

rE2(J3)·I

J1-IE2(JO)

IF(J3-N)4160.5000,4160

10-J1

4160

CONTI

HUE

:~II

'"l

~:

,-

5060

U-l£4(10)

K2-rE4(10+U-l

DO

50"

L-U.ICZ

IF(IAZ(LJ-JOJ509,.5010,5095

5010

A3(L)-A3(L)+Z*E6CNJ

.JO-Jl

IF(JO-l)~015.4000,501S

5095

CONTINUE

6JOO IIC-IIC+1

,,"A-Z

6005

01-.95E37

02-.95£37

03-.95E37

6010

DO

601'

I-l,NO

U-IE4(l

)

1C2-1£4(1+1)-1

ICSWI-IEl(I,

6020

DO

6015

1C-1C1,1C2

JaIA2

(IC)

ICSW2-tEl(JI

6030

GO

TO

C6031,6031,60l4,6034).KSWl

6031

GO

TO

(6085,6085.6040.6040),KSW2

6034

GO

TO

(6035.6035,6085,6085),KSW2

6035

IFCA6(1C»)6085,6085,6037

6037

IFCQ2-A6(K)16085,6085.6043

6043

Q2-A6(KI

GO

TO

6085

6040

IFCA6(KI16060,6070,6070

6060

X&-A6(K)

IF(Q1-XI60'~,6015.6062

6062

QI-X

GO

TO

6085

6070

rF(A7(K»)6010.6015,6085

6080

X--A7 (te)

IFCQ3-X)6085,6085,6082

6082

Q3-X

6015

COHTINUE

6016

COHTINUE

IF(Q1-Q216091,60,I,6092

6091

IFCQ1-Q3)6093,6093,6095

6092

IFIQ2-Q3)6094.6095,6095

6093

Q4-Q1

GO

TO

6019

6094

04-02

GO

TO

6089

60'5

Q4-Q3

6~19

DO

6162

I-l.HO

KIaIE4C

I'

IC2-IE4CI+1I-1

KSWl- IElC

II

~

22

.2

t,

Fl

~~

6090

DO

6161

K-1C1.K2

J-IA2

(K)

KSW2-IEl(J)

6100

GO

TO

(6101.6101,6104.6104',KSWI

6101

GO

TO

C6110,6110,6103,6103),KSWZ

6103

A6(teJ-A6(K)+04

A7

(ICI

-A7C10+Q4

GO

TO

6110

6104

GO

TO

C6106,6106,6110,61l0',KSW2

6106

A6(KlcA6(KI-Q4

A7(I(I-A7CK)-Q4

6110

IFCA7(I(JJ6130,6159,6130

6130

IFCA6{K))6150,61'5,6150

6150

IA5(10-l

GO

TO

6161

6155

IA5(KI-2

GO

TO

6161

6159

IA5(K)-'

6161

CONTINUE

6162

CONTINUE

DO

6201

K-l,LL

A90(K)-A9(KJ

IF

CA6(K))

6171.6171.6172

6111 AlOO(K)-A9(K)

GO

TO

6201

6172

AlOOCK)-A'(K)-A6IK)

6201

CONTINUE

6230

GO

TO

2000

9000

MIKsIK

IFCI9-4)9002,'OOI.9001

9001

19.3

9002

PUNCH

6451,N,LL.MIK.I9

PRINT

6450

23

6450

FORMATC58HEND

OF

PROGRAM

1,

LOAD

PROGRAM

2.

AND

DATA

IN

PROPER

ORO

lER)

6451 FORMATf315,I2)

9008

STOP

END

•

.,

D

'J

o t

o

24

C

PROGRAM

Z

DIMENSION

ZI(50).AIOO(SO).CHECK(SO)

DIMENSION

Z3(S).lZ(20).SMLCCSO).SMLTI(SO).CAPTJ(SO).CAPTI(SO)

DIMENSION

SMLTX(50).XXA4C50).XXA6(SO),KKK(SO),lZZ(ZO,SO)

DIMENSION

KK(50).MM(50I,lZ3IS,50),XXAICSO),XXA2150).XXA3(SO)

DIMENSION

AIOOA(50I,COSTACSOI,SMLTIACSO)

DIMENSION

CAPTJA(50)

DIMENSION

IKBCSOI,TCB(50I,EEB(SOI,MCOUNA(SO)

REAO

l03.KE.KD,IR.INDIR,DT,OC

103

FORMAT(4IS,ZFlO.l)

IFCKE-41

105.

310.

310

lOS

READ

106,N.LL.MIK.I9

106

FORMAT(3I5.IZ)

READ

26.(Zl(Il).Il-l,46)

Z6

FORMATCZ(A4,AZ)/6(A4,AZ)/lZ(A4,A2)/3(A4,A211

DO

114

J2El,LL

114

READ

8.KKCIZI,MM(I21,CZZ3IIl.I21.ll-l.8).XXA1(IZ),XXA2CI2).XXA3(IZ

1).XXA4(IZ,.XXA6(12,

00

118

13-=

1.N

lIS

READ

4.KKK(I3),(ZZZ(Il,I3),11=1.201

8

FORMAT(ZIS,7A4.AZ,2CF5.0,FlO.OI,FlO.O)

4

FORMATC5X.I5.l0CA4.AZ),

KSW2=1

KCOUNTsO

KSW1"KE

READ

5.IK.Te,EE.6

5

FORMAT(I4.3EIZ.6)

KO-O

JI-42

T2-EE

JCOUNT=O

13=EE

ARGl-O.O

TCZ::TC

TC3:TC

NOPGE-l

JHEAD-l

146

NCOUNT"O

NHEAD-l

NI-42

9

FORMA

T(

8EIO.4)

READ

9,(AlOOCIl).Il-l,LL)

READ

9.(SMLC(Ill.Ilal,LL)

READ

9.CSMLTIIIl),Il=I.LL)

READ

9,(CAPTJII1),Ilz1,LLI

READ

9,(CAPTI(llltI1~I.LL)

READ

9.ISMLTXlIl),Il-l,LL)

154

MCOUNT=O

00

204

ILL-I,LL

158 IFINCOUNT)

184,

159,

184

3i

~

\-_~

~

25

159

PUNCH

160,NOPGE

160

FORMATr1HI,45X.Z6HA C T I V I T Y

LIS

T/1HI,Z3X,37X.4HPAGE,16

11

NOPGE:NOPGE+l

IF(NHEADI

163,

178,

163

NHEAD=O

PUNCH

165.(ZlIIl),Il;5.161,(Z1IIl1,Ilzlt41

165

FORMATI13HO

DIVISION -

,6IA4,A21,5X.2IA4.AZI)

PUNCH

167,(Zl(Il),Il=17.401

167

FORMATI18H

PROJECT

TITLE -

.9(A4.A21/1HI,23X.3(A4.AZ»

PUNCH

169,ZI1411.Z11421

169

FORMAT(14HO

TIME

UNIT

-

,A4,A21

PUNCH

171,CZl(IlI,Il=43.46ltIK

171

FORMATr14H

COST

UNIT

-

,2(A4,AZ1,46X/IHI,37X,8HSCHEDULE.12X.I61

PUNCH

173,TC

173

FO~MAT(/1HI,23X,14X,11HDIRECT

COST,F15.11

PUNCH

175.LL,EE

175

FORMAT(19H

ACTIVITY

COUNT

-

,I5,48X/IHI.23X,14X,8HOURATION,F18.11

PUNCH

177.N

177

FORMATf19H

EVENT

COUNT

-

,151/1111

178

PUNCH

179

FORMATC12HOPREC.

SUCC.,47X,13HDIRECT

EAR/IHI,23X,5HLIEST.9X,6HL

lATEST,15X,5HFLOATI

PUNCH

182

18Z

FORMAT(12H

EVENT

EVENT.7X,11HDESCRIPTION,15X,8HDURATION,6X,13HCOST

1

START

IIHI,Z3X,48H-

FINISH

START

-FINISH

TOTAL

FREE

IND

2EP.I/l

184

IF(NCOUNT-Nll

188, 185,

185

NCOUNT"'O

Nl::55

GO

TO

189

188

NCOUNT=NCOUNT+l

189

K"'I(.I(.I

ILL)

M=MMIILLI

DO

36

11=1.8

36

Z3CI1)=ZZ3(Il,ILL)

XAl=XXAlIILLI

XA2=XXAZ

I I

LL

I

XA3-XXA3IILLI

XA4z)(XA4IILLI

xA6=XXA6

I I LLI

COST-XA6-SMLCIILL)

EF=SMLTIIILL)+A100CILL)

SLzCAPTJ(ILLI-Al00CILL)

TF::CAPTJIILLI-SMLTI(ILL)-AI00IILL)

FF"SMLTX(ILLI-SMLTIIILLI-AIOO(ILL)

ARG2=SMLTX(ILLI-CAPTICILLI-AIOO(ILLI

IF(ARGI-ARG2)

092,

093,

093

092

FI=ARG2

GO

TO

094

32..-

•

093

FIaARGl

0'4

X-TF

EF.EF/lO.

SLaSL/lO.

TF-TF/lO.

FF-FF

110.

SMLTX(ILL)·SMLTX(ILlJ/lO.

CAPTI(ILL)·CAPTI(ILL1/10.

CAPT~(ILlJ-CAPTJ(ILl)/lO.

AlOO(llL)-AlOO(ILL)/lO.

SMLTICILl).SMLTI(llL)/lO.

FI-FI/lO.

26

PUNCH

199.K.M.(Z3(Il).11-1,8J.AlOO(ILL),COST,SMLTI(ILL),EF,SL.CAP

IT~(ILL).TF,FF.FI

199

FORMAT(lX,I5,I6,lX.7A4,A2.FlO.1.Fll.l,F8.l/1HI.Z~X,6F8.l)

200

IF(X)

201,

204

201

MCOUNT-MCOUNT+l

CH£CK(MCOUNTI-ILL

AIOOA(MCOUNT)aAIOO(IlL)

COSTA

(MCOUHT)-COST

SMLTIA(MCOUNT)·SMLTI(ILLI

CAPTJACMCOUNT)-CAPTJ(ILLI

204

CONT

!NUE

Nla42

NCOUNT-O

..

HEAD-I

REAO

9.CAIOOell),ll-I

...

,

READ

9.(SMLCell),II-I.N)

DO

2"

INN-I,"

IF

(NCOUNT)

227, 210,

221

210

PU"CH 211.HOPGE

211

FORMAT(lHl,49X,20HE

V E N T

lIS

T,2X/IHI,23X,31X,4HPAGE,16)

1iIOft6E-HOPGE+l

IF

(NH£AO)

213.

222,

213

NK£AO-O

PUNCH

165,CZICI1),Il-5,161,(ZICIl),Il=I,4)

PUNCH

167,CZlfll),Il-17,401

PUNCH

l69.Zl(4l),Zl(4Z)

PUNCH

171.fZlClll,ll-43,46"IK

PUNCH

173,TC

PUNCH

175.LL.EE

PUNCH

171,"

222

PUNCH

223

FORMATClHO,7lX/lHI,23X.5X8HEARLIEST,9X,6HlATEST)

PUNCH

225

FORMATC7H

EVENT,27X,IIHOESCRIPTION,27X/lHI,23X,4XlOHOCCURRENCE.6X

l.lOHOCCURRENCEIII

227

lFC"COUNT-Nll

231.

228,

228

..

COUNT-O

NI-55

()

:3

3

c

GO

TO

232

231

NCOUNT-NCOUNT+l

212

K-KU,

(I"")

DO

46

11-1.20

46

Z2(ll)-Zl2Cll.INNI

233

PUNCH

234.K,(Z2(ll),Ilcl.20),AI00(INN),SMLCeIMN)

234

FORMATtlX.I6,2X,lO(A4.A2),3X/lHI,23X,FI3.1,FI6.11

240

NCOUNT-O

"1-42

MH£AO-l

IF(~COUNTI

27'.

273.

243

DO

272

IM-i,MeOUMT

IFC

..

COUNT)

265.

245,

265

245

PUNCH

246.NOPGE

27

246

FORMATCIH1.40X.31HC R I

TIC

A

LAC

T 1 Y I

11HI,2'X.7HT

I £

IS.30X,4HPAGE,16)

NOPGE-NOPGE+l

IF'NHEAD)

250.

258,

250

NHEAD.O

PUNCH

165.eZl(lll.II-5,16).(Zl(Il),Il-l,4)

PUNCH

167.(ZI(lll.11-17,40)

PUNCH

169,ZI141),Zl(42)

PUNCH

171,(ZlCIl),Il-43.46),IK

PUNCH

173.

TC

PUNCH

175,LL,EE

PUNCH

177

,"

2-58

PUNCH

2'5

CJ

259

FORMATC70X,2HEA/IHI,2JX.23HRl.

START

LAT.

FINISH)

PUNCH

261

FORMAT(12H PREC.

SUCC.,50X,10HDIRECT

IIHI,23X,21HTI~E

FOR

T

lIME

FOR)

PUNCH

263

FORMATCl2H

EVENT

EVENT,9X,11HDESCRIPTION.16X,8HDURATION.7X,4HCOST,

15X/IHI,23X,21HACTIVITY

ACTIVITY/II

265

IF(NCOUNT-Nl)

269,

266,

266

NCOUN1-0

NI-55

GO

TO

270

269

"COUNT-

..

COUMT+l

270

J2-CHECK(IMI

K-KK(~21

"'MM(J2)

I)()

56

11-1,8

56

Z3(Il)-ZZ3(Il.J21

XVZ-AIOOA(IM)

COST-COSTAr

1M)

YZX-SNLTIA(1Ml

ZXY-CAPTJAIIM)

272

PUNCH

303.K,M.(Z3(Ill,Il-1,8J.XYZ.COST.TlX.ZXY

303

FORMAT(lX,15,16,3X,7A4,A2,2FI2.1,Fll.1/1HI,23x.eX,FI4.1)

3../

o •

o

GO

TO

99.

~16

READ

5,IK.TC.EE,B

324

IFCMIK-IK)

325,

333

325

K5W2-2

GO

TO

146

'3~

GO

TOC

334,

354.

3621.KSWI

334

K1-KO+I(D

IF(IK-Kl1

338.

336,

338

336

KO-II(

GO

TO

1

...

6

338

READ

9,(AI00(ll).Il-l.LL)

READ

9,(SMLC(Il).Il-1.LLI

READ

9,(SMLTI(ll).Ilal.LL)

REAO

9,tCAPTJ(Il1.ll-1.LLI

READ

9.(CAPTI(II).ll-l.LLI

READ

9.(SMLTX(ll),Il=I.LL)

READ

9.(SMLTX(Il).Il=I.N)

REAO

9.'SMLTXell).Il-1.NI

MCOUNT-O

00

~51

I

lei

.LL

TF-CAPTJ(121-SMLTI(I2)-AI00(I2)

IffTF)

351.

350.

351

350

MCOUNT-MCOUNT+I

351

CONTINUE

GO

TO

273

354

T21-T2-DT

IFIEE-T21)

356.

358

356

T2-EE

TC21-TC2+DC

IF(TC-TC21)

146.

357.

351

TC2=TC

GO

TO

146

358

TC2I

a

TC2+DC

IF(TC-TC21)

338.

360.

360

TCZ

..

TC

GO

TO

146

362

131-T3-DT

TC31-TC3+DC

IF(EE-T311

365.

338

365

IF(TC-TC3l)

338.

366.

366

13-EI:

TC3"TC

GO

TO

I

...

,

999

STOP

END

~

\ __ #

29

)

\-

GO

TO(

213.

310.

2111.19

271

19-2

READ

5,1I(.TC.EE.8

GO

TO

146

213

KCOUNT.KCOU~T+l

IKBCKCOUNT)-IK

TCB(KCOUNTI=TC

EEB(KCOUNT

I-EE

MCOUNACKCOUHTI-MCOUNT

214

IF(K5W2-11

216.

316.

276

00

308

12-1.KCOUNT

IF(JCOUNT)

369.

278.

369

218

PUNCH

219.NOPGE

~

28

279

FORMAT(IHl.41X.30HT

I M E

--

COS

T

FUN

C

11HI,23X,1HT

ION

1,30X.4HPAGE.16)

HOPGE-NOPGE+l

IF(JHEAO)

283,

293.

283

JHEAD-O

PUNCH

165.(ZICII).11-5.16),(ZI(II).1121,4)

PUNCH

167.(ZI(lll,ll-l1.401

PUNCH

169,ZI(41),ZI14Z)

PUNCH

288.CZlllll.11-43.46)

288

FORMATI14H

COST

UNIT -

.2(A4.A2))

PUNCH

290.LL

290

FORMATIIHO.18H ACTIVITY

COUNT

-

,16)

PUNCH

292.N

292

FORMAT(19H

EVENT

COUNT

-

.161/111)

293

PUNCH

294

FORMATII5X.7HOPTIMAL)

PUNCH

296

FORMAT(72H

SCHEDULE

DIRECT PROJECT CRITICAL IN

lDIRECT

T/lHI.Z3X.4HOTAL)

PUNCH

299

FORMAT(76H

NUMBER

COST

DURATION

ACTIVITIES

leOST

COSTIII

369

IFIJCOUNT-Jl)

373,

310.

310

370

JCOUNT=O

Jl

..

55

GO

TO

301

313

JCOUNT:JCOUNT+l

301

IK-IK8(12)

TC-TCBeI2)

EE-EEBIIZ)

MCOUNT-MCOUNA(IZ)

306

COSTIN-O.O

307

TOTCOSsTC+COSTIN

308

PUNCH

309.IK,TC.EE,MCOUNT.COSTIN.TOTCOS

309

FORMAT(IX,I7.2FI4.1,I9,4X.2FI4.11

310

PUNCH

66

FORMAT(lHO.10HENO

OF

JOBI

jG

f

Appendix

C

The

following

is

a

sample

problem

and

its

results.

Input

for

program

1

+1

17

JULY"

CQURSE

CE

."

CONSTRUCTION

~JfCT

DAYS

l)OU.ARS

1 2 L!AO

TIME

1 5 G

2 3 A

2 4 B

3 4 C

3 5 OU"'Y

4 6 E

5 6 D

6 7 F

-100

1

START

2

3

4

5

6

7

~UUSH

-100

c

NfTWORK

00

40

00

80

24000

80

40OGO

60

17000

00

50

15000

.0

27000

140

28

DOG

~1

;;

31

30

SAMPLE

PROJECT

00 00

10

500

1

20

60000

40

72000

30

29000

00

10

51000

70

33000

G

140

2S00C

"

A

C

it

()

•

o c ~

32

33

Input

for

program

II

in

its

proper

order.

.0000E-99

.8000£+01

.1200£+02

.80ooE+Ol

.1700E+02

.3100E+02

1 1

.0000E-99 .0000E-99

.80ooE+Ol

.1200E+02

.8000E+01

.1700E+02

.3100E+02

7 9 4 1 2

.1830~OE+05

.270000E+02

.359666E+08

17

JULY

63

.0000E-99

.40~OE+02

.4000E+C2

.8000E+~2

.4000E+C2

.0000E-99

.5000E+C2

.9000E+02

COURSE

CE

453

.1400£+03

CONSTRUCTION PROJECT

NETWORK

.0000E-99

.6666E+02

.2400E+04

.6400E+04

.1600E+04

.0000E-99

.4500E+04 .2100E+04

DAYS

DOLLARS

.0000E-99

1 2

LEAD

TIME

O. O.

O.

o.

.0000E-99

.0000E-99 .0000E-99

.4000E+02 .4000E+02

.8000E+02 .4000E+02

1 5 G

40.

O.

10.

500.

66.

.1300E+03

2 3 A

80.

24000.

20.

60000.

7200.

.0000E-99

.4000E+02

.4000£+02

.8000E+02

.8000£+02

.4000E+02 .1300E+03 .1300E+03

2 4 B

80.

40000.

40.

72000.

10400.

.2700E+03

3 4 C

60.

11000.

30.

29000.

4100.

.0000£-99

.0000E-99

.4000E+02

.8000E+02

.4000E+02

3 5

I)UMMY

O. O. O.

O. O.

•

1300E+03

4 6 E

50.

15000.

10.

51000.

6000.

.0000E-99

.4000E+02 .4000E+02

.8000E+02 .8000E+02 .4000E+02 .1300E+03 .1300E+03

5 6 0

90.

27000.

70.

33000.

5400.

.2700E+03

6 7 F

140.

28000.

140.

28000.

2800.

.0000E-99

.4000E+Ol .8000E+Ol

.4000E+Ol

.1300E+02

.2700E+02

1

START

.0000E-99 .0000E-99

.4000E+Ol

.8000E+Ol

.4000£+01

.1300£+02

.2700E+02

2 3

.2055~OE+05

.250000£+02

.359666E+08

3

.0000E-99

.1000E+02

.2000E+02

.8000E+02

.6000E+02

.0000E-99

.3000E+02

.9000E+02

4 •

1400E+03

5

.0000E-99

.1666£+02

.1200E+04

.6400E+04 .2400E+04

.0000E-99

.2700E+04 .2700E+04

6

.0000E-99

7

FINISH

.0000£-99

.0000E-99

.0000E-99 .0000E-99

.2000E+02

.8000E+02 .2000E+02

o

.151000£+05

.330000E+02

.359666E+08

.1100£+03

.0000E-99

.4000E+02 .8000E+02

.8000£+02

.6000E+02

.0000E-99

.5000E+02

.9000£+02

.0000E-99

.2000E+02

.2000£+02

.8000E+02

.8000£+02

.2000E+02

.1100£+03

•

1400E+03

.2500E+03

.0000E-99

.6666E+02

.4800E+04

.6400E+04

.2400E+04

.0000E-99

.4500E+04

.2700E+04

.0000E-99

.0000£-99

.0000E-99 .0000E-99

.2000E+02

.8000E+02

.2000E+02

.0000£-99

.1100£+03

.0000E-99

.OOOOE-9~

.0000E-99

.8000E+02 .8000E+02

.1400E+03

.8000E+02

.0000E-99

.2000E+02

.2000E+02 .8000E+02

.8000E+02

.2000E+02

.1100E+03 .1100E+03

.1900E+03

.2500E+03

.0000£-99

.1000E+03

.8000£+02

.1400E+03

.1000£+03

.1900E+03 .1900E+03

.0000£-99

.0000E-99

.2000E+Ol

.8000E+Ol .2000E+Ol

.1100E+02

.2500E+02

.3300E+03

.0000E-99

.2000E+Ol

.8000E+Ol

.2000E+Ol

.1100E+02

.2500E+02

.0800£-99

.0000E-99

.0000£-99

.8000E+02

.1400E+03 .1000E+03

4

.2295COE+05

.230000E+02

.359666E+08

.1900E+03

.0000E-99

.1000E+02 .2000E+02

.8000E+02

.6000E+02

.0000E-99

.1000E+02

.7000E+02

.0000E-99

.8000E+02

.80ooE+02

.1400E+03

.1400E+03 .8000E+02

.1900[+03

.1900E+03

.1400E+03

.3300f+03

.0000E-99

.1666E+02

.1200E+04

.6400E+04

.2400E+04

.0000£-99

.9000E+03

.2100E+04

.0000E-99

.8000E+01

.1400E+02

.8000E+01

.1900E+02 .3300E+02

.0000E-99

.0000£-99

.0000E-99

.8000E+Ol

.1400E+~2

.1000E+02 .1900E+02

.3300[+02

.0000E-99 .0000E-99

.0000E-99

.2000E+02

.2000£+02

.8000E+02 .2000E+02

1

.1590~OE+05

.310000E+02

.359666E+08

.9000E+02

.0000E-99

.4000E+02

.8000E+02

.8000E+02 .4000E+02

.0000E-99

.5000E+02

.9000E+02

.0000E-99

.2000E+02

.8000E+02

.2000E+02

.9000E+02

.9000£+02

•

1400E+03

.2300E+03

.0000E-99

.6666E+02

.4800E+04

.6400E+04 .1600E+04

.0000E-99

.4500E+04

.2700£+04

.0000E-99

.0000£-99

.2000£+02

.8000E+02

.2000E+02

.0000£-99

.9000E+02

.0000E-99 .0000E-99

.0000E-99

.8000E+02

.8000E+02 .1200E+03

.8000E+02

.0000E-99

.2000E+02 .2000E+02

.8000E+02

.8000£+02

.2000E+02

.9000E+02

.9000£+02

.1700E+03

.2300E+03

.0000E-99

.8000E+02

.1200E+03

.8000E+02

.1700E+03

.0000E-99

.2000E+01

.8000E+01

.2000E+Ol

.9000£+01

.2300E+02

.3100E+03

.0000£-99

.0000E-99

.8000E+02

.1200E+03

.8000E+02

.0000E-99

.0000[-99

.2000E+01 .8000E+01

.2000[+01

.9000[+01

.2300E+02

.1700E+03

.0000E-99

.8000E+02

.8000£+02

.1200£+03

.1200E+03

.8000E+02

.1700E+03 .1700E+03

.3100£+03

ACT'

I V I T Y L I S T

OIVISION

-COURSE

CE

4U

11

JULY

63

PROJECT

TITLE

-CONSTRUCTION PROJECT

NETWORtt

TIME UNIT -

DAYS

COST UNIT -DOLLARS SCHEDULE

DIRECT COST

ACTIVITY

COUNT

-9 DURATION

EVENT

COUNT

-7

PREC.

SUCC. DIRECT EARLIEST LATEST

EVENT

EVENT DESCRIPTION DURATION

COST

START -

FINISH

START -

FINISH

TOTAL

1 2

LEAD

TIME

0.0

0.0 0.0

0.0

0.0 0.0

1 5 G

4.0

-.6

0.0

4.0

6.0

10.0

6.0

2 3 A

8.0

2400.0

0.0

8.0

0.0

8.0

0.0

2

,.

8

8.0

4000.0

0.0

8.0

6.0

14.0

6.0

3 4 C

6.0

1700.0

8.0

14.0

8.0

14.0

0.0

3 5

DUNMY

0.0

8.0

10.0

2.0

4 6 E S.O

150ChO

14.0

19.0

14.0

19.0

0.0

5 6 0

9.0

21100.0

8.0

17.0

10.0

19.0

2.0

6 7 F

14.0

2.00.0

19.0

3300

19.0

33.0

0.0

EVE

N T

LIS

T

DIVI

SI

ON

-

COURSE

CE

453

PROJECT

TITLE

-COHSTRUCTI

ON

PROJECT

NETWORK

TIME

UNI

T -

DAYS

COST

UNIT -

DOLLARS

ACTIVITy

COUNT

-

EVENT

COUNT

-

EVENT

START

4

5

6

7

FINI

SH

DESCRIPTION

17

JULY

63

EARLIEST

OCCURRENCE

0.0

8.0

14.0

8.0

19.0

33.0

SCHEDULE

DIRECT

COST

DURATION

LATEST

OCCURRENCE

0.0

8.0

14.0

10.0

19.0

33.0

PAGE

0

15100.0

330'0

FLOAT

FREE

0.0

4.0

0.0

6.0

0.0

z.o

0.0

PAGE

o

15100.0

33.0

0

INDEP.

0.0

4.0

0.0

6.0

0.0

o

C;

o

I_ALtA

!!

1:1

C R I

DIVISION

-COURSE

CE

4n

PROJECT

TITLE

-CONSTRUCT!

ON

PROJECT NETWORK

TIME

UNIT

-DAYS

COST

UNIT

-

DOLLARS

ACTIVITy

COUNT -9

EVENT COUNT - 7

PREC.

SUCC.

EvENT

EVENT

DESCRIPTION

1 2 LEAD

TIME

2

:3

A

3

,.

C

4 6 E

6 7 F

DIVISION

-COURSE

CE

453

PROJECT

TITLE

-CONSTRUCT!

ON

PROJECT

NETWORK

TIME

UNIT

-DAYS

COS

T

UN

IT

-DOLLARS

ACTiViTY

COUNT

-

EVENT

COUNT

-

PREC.

SUCC.

T I C A L

ACT

I V I T I E S

17

JULY

63

EARL.

START

DIRECT

TIME

FOR

DURATION COST

ACTIVITY

0.0

S.O

2400.0

0.0

6.0

1700.0

S.O

5.0

1500.0

14.0

2800.0

19.0

ACTIVITY

LIS

T

17

JULY

63

DIRECT

EARLIEST

EVENT EVENT

DESCRIPTION

DURATION

COST

START

-

FINISH

1 2

LEAD

TIME

0.0

1 5 G

4.0

-.6

0.0

4.0

2 3 A

8.0

2400.0

0.0

8.0

2 4 B

8.0

4000.0

0.0

8.0

3 4 C

4.0

2500.0

8.0

12.0

3 5

DUMMY

0.0 0.0

8.0

4 6 E

5.0

1500.

a

12.0

17.0

5 6 0

9.0

2700.0

8.0

17.0

6 7 F

14.0

2800.0

17.0

31.0

4-1

SCHEDULE

DIRECT

COST

DURATION

LAT.

FINISH

TIME

FOR

ACTIVITY

0.0

8.0

14.0

19.0

33.0

SCHEDULE

DIRECT

COST

DURATION

LATEST

START -

FINISH

0.0

4.0

8.0

0.0

8.0

4.0

12.

a

8.0

12.0

8.0

12.0

17.0

8.0

17.0

31.0

TOTAL

0.0

4.0

0.0

4.0

0.0

PAGE

0

15100.0

33.0'

PAGE

1

15900.0

31.0

FLOAT

FREE

0.0

4.0

0.0

4.0

0.0

...

(LX.iL

: (LI.liM ; .4ifiW1ll#U j

1m2

iiaaUmUUiiJiu!UJtJua:a:t4AIiiaLiUaztalie:

it t

Ii

saL"

am

41

lUi

i..

Mil,

($£&(!iiliiliktilaiiUilw::a:U;;Ui;Mi£iiUSim

MiU.;WUUU

Ul&SUiUL

4

INDEP.

0.0

4.0

0.0

4.0

0.0

.'

(!APNUM»;.

444#$%44

DIYISION -

COURSE

CE

.~,

~ECT

TITLE

-

COIIISTRUCTION

PROJECT

NETWORK

TIME

UNIT -

DAYS

COST UNIT -

DOLt..ARS

ACTIVITY

COUNT

- ,

EVENT

COUMT

-7

EVENT

DESCRIPTION

1 START

2

3

4

5

6

7

FlNI

SH

EVE

N T

LIS

T

17

JULY"

EARLIEST

OCCURRENCE

0.0

8.0

12.0

8.0

17.0

31.0

SCHEDULE

DIRECT

COST

DURATION

LATEST

OCCURRENCE

0.C!

0.0

8.0

12.0

8.0

17.0

31.0

CRITICAL

ACTIVITIES

DIVISION

-

COURSE

CE

453

F>ROJECT

TITLE

-CONSTRUCTION

F>ROJECT

NETWORk.

TIME UNIT -

DAYS

COST

UNIT -

DOLLARS

ACTIVITy

COUNT

- 9

EVENT

COUNT

- 7

PREC.

SUCC.

EVENT

DESCRIF>TIOfI

1 2

LEAD

TIME

2 3 A

3 4 C

3 5

DUMMY

It

6 E

5 6

I)

6 7 F

17

JULY

63

DIRECT

DURATION

COST

0.0

.

lI.o.

2400.0

4.0

2500.0

0.0

5.0

150().0

9.0

2700.0

14.0

2100.0

EARL.

START

TIME

FOR

ACTIVITY

0.0

1.0

12.0

8.0

17.0

SCHEDULE

DIRECT

COST

DURATION

LAT.

FINISH

TIME

FOR

ACTIVITY

0.0

8.0

12.0

8.0

17.0

31.0

PAGE

1

U900.0

31.0,

F>AGE

1

15900.0

31.0

.1

I

o

A ( T I V I T Y L I S T

DIVISJote

-

COUitSf

CE

US

17

JULY U

~ROJECT

T J TLE -CONSTRUCTI

ON

NOJECT

~

TINE

UNn

-

D~YS

(OST

UNIT

-DOLLARS SCHEDULE

DIRECT COST

ACTIVITY

COUNT

-9 OURATIC*

EVENT

COUNT

-7

(~'1'1

.yi

PREC.

SUCC.

DIRECT

EARLIEST

LATEST

EVENT

EVENT DESCIUPTIOIII DURATION COST START -

FINISH

START -

FINISH

TOTAL

2

LEAO

TIME

0.0

0.0 0.0

5 G

4.0

-.6

0.0

4.0

0.0

4.0

0.0

3 A

4.0

4800.0

0.0

4.0

0.0

4.0

0.0

4 B

!I.O

4000.0

0.0

!I.O

0.0

8.0

0.0

4 C

4.0

2500.0

4.0

8.0

4.0

8.0

0.0

5

DUMMY

0.0 0.0

4.0 4.0 4.0

4.0

0.0

6 E

5.0

1500.0

8.0

13.0

8.0

13.0

0.0

6 D

9.0

27CO.0

4.0

13.0

4.0

13.0

0.0

7 F

14.0

2800.0

13.0

27.0

13.0

27.0

0.0

EVE

N T

LIS

T

DIVISION

-COURSE

CE

453

PROJECT T

lTLE

-CONSTRUCT!

ON

PROJECT

NETWORK

17

JuLy

63

o

TIME UNIT -DAyS

COST UNIT -DOLLARS

ACTIVITy

COUNT

-

EVENT

COUNT

-

EVENT

START

FINISH

t4;t¥iW,.4QY

84TM41M4i4414MOM

AP.MW

M4W<4i9.f

Q.

,Ii«

,.

$

._

a 4¢ 1$$(¥UiItAQ .

DESCRIPTION

.2144

4.

_ . .

==£==4$U'._.=44

EARLIEST

OCCURRENCE

0.0

4.0

8.0

4.0

13.0

27.0

SCHEOULE

DIRECT COST

DURATION

LATEST

OCCURRENCE

0.0

4.0

8.0

4.0

13.0

27.0

$#MiW

4A4AUA

PAGE

2

11300.0

27.0

FLOAT

FREE

0.0

PAGE

2

18300.0

27.0

i¢4WW.

I"DEP.

0.0

i4

#4#4$

44,0;a

444414.4

BI.\

C R [ T I

C;

A L

ACT

I V I

TIE

S

DIVISION

-COUItSE

C(

455

11 JULY U

PROJECT

TITLE

-COMSTRUCTI

ON

PROJECT NUWORK

TIlliE UNIT -

DAYS

COST UNIT -

DCK.LAItS

ACTIVITy

COUNT

-9

EVENT

COUNT

- 7

EARL. START

PREC,

suee. I>lRE(T TIME

FOR

EVENT

DESCRIPTlOfit

DUJltATlOH

COST

ACTIVITY

1 2

LEAO

TIME

0.0

1 5 G

4.0

-.6

0.0

2 3 A

4.0

4800.0

0.0

2 4 B

8.0

Ituuo.o

0.0

3

,.

C

4.0

2500.0

4.0

3 5

DUMMY

0.0

4.0

4 6 E

5.0

1500.0

8.0

5 6 D

9.0

2700.0

4.0

6 7 F

14.0

2800.0

13.0

ACTIVITY

LIS

T

DIVISION

-

COURSE

CE

453

17

JULY

63

PROJECT

TITLE

-CONSTRUCTI

ON

PROJECT

NETWORK

TIME UNIT -

DAYS

COST UNIT -

DOLLARS

ACTIVITy

COUNT

-

EVENT

COUNT

-

PREC.

SUCC. DIRECT EARLIEST

EVENT

DESCR

I

PTI

ON

DURATION

COST

START -

FINISH

2

LEAD

TIME

0.0

0.0 0.0 0.0

5 G

1.0

49.3

0.0

1.0

:3

A

2.0

6000.0

0.0

2.0

4 B a.o

4000.0

0.0

8.0

4 C

6.0

1700.0

2.0

8.0

5

DUMMY

0.0 0.0

2.0 2.0

4 6 E

3.0

3300.0

8.0

11.0

5 6 D

9.0

2700.0

2.0

11.0

6 7 F

14.0

2800.0

11.0

25.0

SCHEOULE

DIRECT COST

DURATION

LAT.

FINISH

TIME

FOR

ACTIVITY

0.0

4.0

8.0

4.0

13.0

27.0

SCHEOULE

DIRECT

COST

DURATION

LATEST

START -

FINISH

0.0

1.0

2.0

0.0

2.0

0.0

8.0

2.0

8.0

2.0

8.0

11.0

2.0

11.0

25.0

TOTAL

0.0

1.0

0.0

PAGE

1.300.0

27.0

PAGE

3

20550.0

25.0

FLOAT

FREE

0.0

1.0

0.0

9

0

10

lNOEP.

0.0

1.0

0.0

o

c

DIVISION

-COURSE

CE

453

PROJECT

TITLE

-CONSTRUCTI

0tI

PROJECT NETWORK

TIME

UNIT

-

DAyS

COST

UNIT

-DOLLARS

ACTIVITy

COUNT -9

EVENT

COUNT

-7

EVENT

DESCRIPTION

1 START

2

3

..

5

6

7

FINI

SH

E.V

E N T

LIS

T

17

JULY

63

EARLIEST

OCCURRENCE

0.0

2.0

B.O

2.0

11.0

25.0

SCHEDULE

DIRECT

COST

DURATION

LATEST

OCCURRENCE

0.0

2.0

8.0

2.0

11.0

25.0

PAGE

3

20550.0

25.0

11

CRITICAL

ACTIVITIES

PAGE

12

DIVISION

-COURSE

CE

453

!"ROJECT

TITLE

-CONSTRUCTION PROJECT

NETW~I(

o

TIME

UNIT

-DAYS

COST

UN

IT

-DOLLARS

ACTIVITy

COUNT - 9

EVENT

COUNT

- 7

PREC.

SUCC.

EVENT EVENT

DESCRIPTION

LEAD

TIME

A

4 e

4 C

5

DUMMY

4 6 E

5 0

6 F

AtMMMQ;4.@$#4¥4** .4.

>.1«

4

P@@'A

..

¥4tM¥4

.. S

PUtO$(

4

..

#_=

sa_a..

..am

4¢4MS$4I q \

17

JULY

63

DIRECT

DURAT

ION

COST

0.0

2.0

6000.0

B.O

4000.0

6.0

1700.0

0.0

3.0

3300.0

9.0

2700.0

14.0

2800.0

EARL.

START

TIME

FOR

ACTIVITY

0.0

2.0

8.0

2.0

11.0

SCHEDULE

DIRECT

COST

DURATION

LAT.

FINISH

TIME

FOR

ACTIVITY

0.0

2.0

8.0

2.0

11.0

ll.O

25.0

3

20550.0

25.0

445*

I ( #,%¥44MM#MMU4Q44

44MgqoAAA4TWM,$",

" i ,

«M

%.#.4*( t PUt,

-11

A C T I V I T Y

LIS

T

DIVISION

-COURSE

CE

.53

17

JULY

63

PROJECT

TITLE

-COfilSTRUCTI

ON

PROJECT

NETWORK

T I1"E UNIT -

DAYS

COST UNIT -DOLLARS, SCHEDULE

DIRECT COST

ACTIVITy

COUNT

-9

DURATI~

EVENT

COUNT

-7

PREC.

SUCC.

DIKE'CT EARLIEST LATEST

EVENT

DESCRIPTION

DURATION

COST

START -

FINISH

START -

FINISH

TOTAL

1 2

LEAD

TIME

0.0

0.0 0.0

0.0

1 5 G

1.0

49.3

0.0

1.0

2.0

1.0

2 3 A

2.0

6000.0

0.0

2.0

0.0

2.0

0.0

2 4 8 e.o

4000.0

0.0

8.0

0.0

8.0

0.0

3 4 C

6.0

1700.0

2.0

8.0

2.0

8.0

0.0

3 5

DUMMY

0.0 0.0

2.0

2.0 2.0

0.0

4 6 E

1.0

5100.0

8.0

9.0

8.0

9.0

0.0

5 6 D

7.0

33<10.0

2.0

9.0

2.0

9.0

0.0

6 7 F

14.0

2800.0

9.0

23.0

9.0

23.0

0.0

EVE

N T

LIS

T

DIVISION

-COURSE

CE

453

PROJECT

TIlLE

-CONSTRUCT!

ON

PROJECT

NETWORK

TIME UNIT -

DAYS

COST

UNIT -DOLLARS

ACTIVITY

COUNT

-

EVENT

COUNT

-

EVENT

1 START

2

3

4

5

6

7

FIN!

SH

DESCRIPTION

17

JULY

63

EARLIEST

OCCURRENCE

0.0

2.0

8.0

2.0

9.0

23.0

SCHEOULE

DIRECT COST

DURATION

LATEST

OCCURRENCE

0.0

2.0

e.o

2.0

9.0

23.0

PAGE

4

22"0.0

2300·

FLOAT

FREE

0.0

1.0

0.0

PAGE

4

22950.0

23.0

13

"

0

INOEP.

0.0

1.0

0.0

14

( R ( T i C A L A ( T I V I T I E S

0

c

o

DIVISION

-(OURSE

(E

45!

17

JULY

PROJECT

TnLE

-

C,*STRUCTIOH

fl'ttOJECT HETWOItK

TIME

UNIT

-DAYS

COST

UNIT

-DOLLARS

ACTtVITY

COUNT -9

EVENT

COUNT

-7

PREC. SUCC.

EVENT EVENT

DES(RIPTIotc

DURATION

1 2 LEAD

TIME

0.0

2 3 A

2.0

2 4 B

8.0

3 4 C

6.0

3 5

DUMMY

0.0

'+

6 E

1.0

5 6 0

7.0

7 F

14.0

TIM

E

--

( 0 S T

DIVISION

-

COURSE

CE

453

PROJECT

TITLE

-CONSTRUCT!

ON

PROJECT NETWOlilK

TIME

UNIT

-DAYS

COST

UNI

T - DOLLARS

ACTIVITY

COVNT-

EVENT

COUNT

-

OPTIMAL

SCHEDULE

[)IRECT

NUMBER

COST

15100.0

15900.0

18300.0

20550.0

22950.0

END

OF

JOB

PROJECT

CRITICAL

DURATION

ACTIVITIES

33.0

31.0

27.0

25.0

23.0

17

JULY

63

INDIRECT

COST

0.0

¢¢#s

;.;;;AI,

'.:Z

U

444aq;=_C

qQ..MM.'::

;;ii1i.Ui2UZiu::u:uaua"_uu,,

••

a_

63

EARL.

START

DIRECT

TIME

FOR

COST

ACTIVI

TY

0.0

6000.0

0.0

,+000.0

0.0

1700.0

2.0

0.0

2.0

5100.0

8.0

3300.0

2.0

2800.0

9.0

FUN

C T

ION

TOTAL

COST

15100.0

15900.0

18300.0

20550.0

22950.0

PAGE

15

SCHEOULE

'+

DIRECT

COST

22950.0

DURATIC»I

23.0

LAT.

FINISH

TIME

FOR

ACTIVITY

0.0

2.0

8.0

2.0

9.0

23.0

PAGE

16

10.3.031_PERT_ _LESS 10.3.031 PERT LESS

10.3.031_PERT_-_LESS 10.3.031_PERT_-_LESS

Navigation menu

Versions of this User Manual:

Views

Navigation