Listing Simlib 2

5
3
0.25
365.
3
2
4
3
1
4
3
5
3
1
2
5
0.5
0.6
0.85
0.50
4
1
3
1.10
0.80
0.75
2
5
1
4
3
1.2
0.25
0.70
0.90
1.00
0.3
0.8
1.00

C234567
IMTEGER
JOBTYP,NBUSY(5),NGROUP,NMACHS(5),NTASKS(5),NTYPES,
& ROUTE(5,5),TASK
REAL LENGTH,MARRVT,MSERVT(5,5),PROBD(3)
INTEGER IRANDI
REAL ERLANG,EXPON
COMMON /MODEL/
JOBTYP,LENGTH,MARRVT,MSERVT,NBUSY,NGROUP,NMACHS,
& NTASKS,NTYPES,PROBD,ROUTE,TASK

INTEGER
LDECR,LEVENT,LFIRST,LINCR,LLAST,LRANK(25),LSIZE(25),
& MAXATR,NEXT
REAL TIME,TRNSFR(10)
COMMON /SIMLIB/
LDECR,LEVENT,LFIRST,LINCR,LLAST,LRANK,LSIZE,
& MAXATR,NEXT,TIME,TRNSFR

C234567
* Main program for job-shop model.

* Bring in declarations file.
$INCLUDE:LIBRARY.FOR
INCLUDE jobshop.dcl
INTEGER I,J

*Open input and output files.

OPEN(5, FILE =jobshp.in)
OPEN(6, FILE =jobshp.out)

*Read input parameters.

READ (5,*) NGROUP, NTYPES, MARRVT, LENGTH
READ (5,*)(NMACHS(I), I = 1, NGROUP)
READ (5,*)(NTASKS(I), I = 1, NTYPES)
DO 10 I = 1, NTYPES
READ (5,*)(ROUTE(I,J), J = 1, NTASKS(I))
READ (5,*)(MSERVT(I,J), J = 1, NTASKS(I))
10 CONTINUE
READ (5,*)(PROBD(I), I = 1, NTYPES)

*Write ruport heading and input parameters.

WRITE (6,2010) NGROUP, (NMACHS(I), I = 1, NGROUP)
2010 FORMAT (jobshopmodel//
& Number of machine groups,I20//
& Number of machines in each groups,7X,8I5)
WRITE(6,2020) NTYPES, (NTASKS(I), I = 1, NTYPES)
2020 FORMAT(/Number of job types,I125//
& Number or tasks for each job type,6X,8I)
WRITE(6,2030) (PROBD(I), I = 1, NTYPES)
2030 FORMAT(/Distribution Function Or job
types,2X,8F8.3)
WRITE(6,2040) MARRVT, LENGTH
2040 FORMAT (Mean interarrival time Or
jobs,F14.2,hours//
& Length Or the simulation,F20.1,eight-hour
days///
& Job type Machine groups on route)
DO 20 I = 1, NTYPES
20 WRITE (6,2050) I, (ROUTE(I,J), J = 1, NTASKS(I))
2050 FORMAT (/15,8X,815)
WRITE (6,2060)
2060 FORMAT(//Job type Mean service time (in hours)
for,
& successive task)

DO 30 I = 1, NTYPES
30 WRITE(6,2070)I, (SERVT(I,J) J = 1, NTASKS(I))
2070 FORMAT (/15,5X,8F8.2)

* Initialize all machines in all groups to the idle
state.

DO 40 I = 1, NGROUP
40 NBUSY(I) = 0

* Initialize SIMLIB.

CALL INITLK

* Set the maximum number of attributes per record.

MAXATR = 4

*Schedule the arrival of the first job.

TRNSFR (1) = EXPON(MARRVT,1)
TRNSFR (2) = 1.0
CALL FILE(LINCR,LEVENT)

*Schedule the end of simulation.

TRNSFR (1) = 8.0*LENGTH
TRNSFR (2) = 3.0

*Determine the next event.

50 CALL TIMING

*Call the appropriate event routine.

GO TO (60, 70, 80), NEXT
60 CALL ARRIVE(1)
GO TO 50
70 CALL DEPART
GO TO 50
80 CALL REPORT

CLOSE (5)
CLOSE (6)

STOP
END

SUBROUTINE ARRIVE(NEW)
INCLUDE jobshop.dcl
INTEGER GROUP,INDEX,NEW
REAL DELAY

*if this is a new arrival to the shop, generate the
time of the
*next arrival and determine the job type and task
number of the
*arriving job.

IF (NEW .EQ. 1) THEN
TRNSFR(1) = TIME + EXPON(MARRVT,1)
TRNSFR(2) = 1.0
JOBTYP = IRANDI(NTYPES,PROBD.2)
TASK = 1
END IF

*Determine the machine group from the ROUTE matrix.

GROUP = ROUTE(JOBTYP,TASK)

*Chec~ to see wheter all machines in this group are
busy.

IF (NBUSY(GROUP) .EQ. NMACHS(GROOUP)) THEN

*All machines in this group are busy, so place the
arriving job
*at the end of the appropriate queue. Note that the
following
*data are stored in the record for each job:
*1. Time of arrival to this machine group.
*2. Job type.
*3. Curent task number.

TRNSFR(1) = TIME
TRNSFR(2) = JOBTYP
TRNSFR(3) = TASK
CALL FILE(LLAST,GROUP)

ELSE

*A machine in this group is idle, so start service on
the
*arriving job (which has a delay of zero)

DELAY = 0.0
CALL SAMPST(DELAY,GROUP)
INDEX = NGROUP + JOBTYP
CALL SAMPST(DELAY,INDEX)
NBUSY (GROUP) = NBUSY(GROUP) + 1
CALL TIMEST(FLOAT(NBUSY(GROUP)),GROUP)

*Schedule a service completion.

TRNSFR(1) = TIME + ERLANG(2,MSERVT(JOBTYP,TASK),3)
TRNSFR(2) = 2.0
TRNSFR(3) = JOBTYP
TRNSFR(4) = TASK

END IF

RETURN
END

SUBROUTINE DEPART
INCLUDE jobshop.dcl
INTEGER GROUP,INDEX,JOBTQ,TASKQ
REAL DELAY

* Determine the machine group from which the job is
departing.

JOBTYP TRNSFR(3)
TASK = TRNSFR(4)
GROUP = ROUTE(JOBTYP,TASK)

*ChecX to see wether the queue for this machine group
is empty.

IF (LSIZE(GROUP) .EQ. 0) THEN

* The queue for this machine group is empty, so
make a machine in
* this group is idle

NBUSY(GROUP) = NBUSY(GROUP) I
CALL TIMEST(FLOAT(NBUSY(GROUP)),GROUP)

ELSE

*The queue is not empty, so start service on first job
in queue.

CALL REMOVE (LFIRST,GROUP)
DELAY = TIME - TRNSFR(1)

*Tally this delay for this machine group.

CALL SAMPST(DELAY,GROUP)

*Tally this same delay for this job type.

JOBTQ = TRNSFR(2)
TASKQ = TRNSFR(3)
INDEX = NGROUP + JOBTQ
CALL SAMPST (DELAY,INDEX)

* Schedule end of service for this job at this machine
group.

TRNSFR(1) = TIME + ERLANG(2,MSERVT(JOBTQ,TASKQ),3)
TRNSFR(2) = 2.0
TRNSFR(3) = JOBTQ
TRNSFR(4) = TASKQ

END IF

*If the current departing job has one or more tasks yet
to be done
*send the job to the next machine group-on its route.

IF (TASK .LT. NTASKS(JOBTYP) THEN
TASK = TASK + 1
CALL ARRIVE(2)
END IF

RETURN
END

SUBROUTINE REPORT
INCLUDE jobshop.dcl
INTEGER I,INDEX
REAL
AJDEL(5),AMDEL(5),AUTIL(5),AVGNIQ(5),OAJDEL,SUM

*Compute the average total delay in queue for each job
type and the
*overall average job delay

OAJDEL = 0.0
SUM = 0.0

DO 10 I = 1, NTYPES
INDEX = NGROUP + I
CALL SAMPST(0.0,-INDEX)
AJDEL(I) = TRNSFR(I) * NTASKS(I)
OAJDEL = OAJDEL + (PROBD(I)-SUM) * AJDEL(I)
SUM = PROBD(I)
10 CONTINUE

*Compute the average number in queue, the average
utilization, and
*the average delay in queue ~or each machine group.

DO 20 I = 1, NGROUP
CALL SAMPST(0.0,-I)
AMDEL(I) = TRNSFR(I)
CALL FILEST(I)
AVGNIQ(I) = TRNSFR(I)
CALL TIMEST(0.0,-I)
AUTIL(I) = TRNAFR(I) / NMACHS(I)
20 CONTINUE
WRITE(6,2010)
2010 FORMAT(/// Job type Average total delay in
queue)
DO 30 I = 1, NTYPES
30 WRITE(6,2020) I,AJDEL(I)
2020 FORMAT(/I5,F27.3)
WRITE (6,2030)OAJDEL
2030 FORMAT(/ Overall average job total delay =,F10.3
& ///Machine Average number Average,7X
& Average delay/
& group number in queue utilization,5X
& in queue)
DO 40 I = 1, NGROUP
40 WRITE (6,2040) I, AVGNIQ(I), AUTIL(I), AMDEL(I)
2040 FORMAT (/I5,3F17.3)

RETURN
END

library.for

SUBROUTINE INITLK

INTEGER HEAD(25) ,IOUT,LINKPR(1000) ,LINKSR(1000),
LIST,NAR,ROW
& TAIL(25)
REAL MASTER(1000, 10)
COMMON /LLIST/ HEAD, IOUT, LINKPR, LINKSR, MASTER,
NAR, TAIL
INTEGER LDECR, LEVENT, LFIRST, LINCR, LLAST,
LRANK(25),
& LSIZE(25),MAXATR,NEXT
REAL TIME, TRNSFR(10)
COMMON /SIMLIB/ LDECR, LEVENT, LFIRST, LINCR, LLAST,
LRANK, LSIZE,
& MAXATR, NEXT, TIME, TRNSFR

*Ensure integrity of variables in COMMON blockX
LLISTS, which
*appears for the first time in a subprogra~

* Initialize links.

DO 10 ROW = I,1000
LINKPR(ROW) = 0
10 LINKSR(ROW) = ROW + 1
LINKSR(1000) = 0

* Initialize list attributes.

DO 20 LIST = 1, 25
HEAD(LIST) = 0
TAIL(LIST) = 0
LSIZE(LIST) = 0
20 LRANK(LIST) = 0

* Initialize mnemonics for record location in list.

LFIRST = 1
LLAST = 2
LINCR = 3
LDECR = 4

* Initialize mnemonic for event list number.

LEVENT = 25

* Initialize system attributes.
TIME = 0.0
NAR = 1
LRANK(EVENT) = 1
MAXATR = 10

* Initialize statistical routines.

CALL SAMPST(0.0,0)
CALL TIMEST(0.0,0)

* Initialize output unit number for SIMLIB error
messages.

IOUT = 6

RETURN
END

SUBROUTINE FILE(OPTION,LLIST)

INTEGER
AHEAD,BEHIND,HEAD(25),IHEAD,IOUT,ITAIL,ITEM,LINKPR(1000
),
& LINKSR(1000),LIST,NAR,OPTION,ROW,TAIL(25)
REAL MASTER(1000,10),SIZE
COMMON /LLISTS/
HEAD,IOUT,LINKPR,LINKSR,MASTER,NAR,TAIL

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/

* If the storage array is full, stop the simulation.

IF (NAR .EQ. 0) THEN
WRITE (IOUT,10) TIME
10 FORMAT (From SIMLIB : MASTER storage array
overflow at time
& 10.3)
STOP
END IF

* If the list value is improper, stop the simulation.

IF (LIST .LT. 1 .OR. LIST .GT. 25) THEN
WRITE (IOUT,20) LIST, TIME
2O FORMAT ( From SIMLIB:,I10,
& is an improper value for file list at time
,F10.3)
STOP
END IF

* Increment the list size.

LSIZE(LIST) = LSIZE(LIST) + 1

* If the option value is improper, stop the
simulation.

IF (OPTION .LT. 1 .OR. OPTION .GT. 4) THEN
WRITE (IOUT,30) OPTION, TIME
30 FORMAT ( From SIMLIB:,I10,
& is an improper value for FILE OPTION at time
,F10.3)
STOP
END IF

* File according to the desired option

GO TO (300, 200, 100, 100), OPTION

* List is ranked. Deter~ine item on which list is to
be ranked.

100 ITEM = LRANK(LIST)

* If an invalid item has been specified, stop the
simulation.

IF (ITEM .LT. 1 .OR. ITEM .GT. MAXATR) THEN
WRITE (IOUT,110) ITEM, LIST
& is an improper value for ranking
attribute Or list,
& I3)
STOP
END IF

* If this is not the first record in this list,
continue.

IF (LSIZE(LIST) .EQ. 1) GO TO 400

* Search the list for the proper location.

ROW = HEAD(LIST)
120 IF (OPTION .EQ. 4) GO TO 130

* Rank the list in increasing order.

IF (TRNSFR(ITEM) .GE. MASTER(ROW,ITEM)) GO TO 150

* The correct location has been found.

GO TO 140

* Rank the list in decreasing order.

130 IF (TRNSFR(ITEM) .LE. MASTER(ROW,ITEM) GO TO 150

* Correct location found. Insert before last record
exa~ined.

140 IF (ROW .EQ. HEAD(LIST)) GO TO 300

* Insert in proper location between preceding,
succeeding records.

AHEAD = LINKSR(BEHIND)
ROW = NAR
NAR = LINKSR(ROW)
IF (NAR .GT. 0) LINKPR(NAR) = 0
LINKPR(ROW) = BEHIND
LINKSR(BEHIND) = ROW
LINKPR(AHEAD) = ROW
LINKSR(ROW) = AHEAD

* Go to transfer tha data.

GO TO 500

* Continue searching, consider the next row.

150 BEHIND = ROW
ROW = LINKSR(BEHIND)
IF (TAIL(LIST) .NE. BEHIND) GO TO 120

200 IF(LSIZE(LIST) .EQ. 1) GO TO 400
ROW = NAR
NAR = LINKSR(ROW)
ITAIL = TAIL(LIST)

LINKPR(ROW) = ITAIL
LINKSR(ITAIL) = ROW
LINKSR(ROW) = 0
TAIL(LIST) = ROW

GO TO 500

300 IF (LSIZE(LIST) .EQ. 1) GO TO 400
ROW = NAR
NAR = LINKSR(ROW)
IHEAD = HEAD(LIST)
LINKPR(IHEAD) = ROW
LINKSR(ROW) = IHEAD
LINKPR(ROW) = 0
HEAD(LIST) = ROW

GO TO 500

* Insert the first record in the list.

400 ROW = NAR
NAR = LINKSR(ROW)
LINKSR(ROW) = 0
HEAD(LIST) = ROW
TAIL(LIST) = ROW

* Transfer tha data.

500 DO 510 ITEM = 1, MAXATR
510 MASTER(ROW,ITEM) = TRNSFR(ITEM)

* Update the area under the number-in-list curve.

CALL TIMEST(FLOAT(LSIZE(LIST)),20 + LIST)

RETURN
END

SUBROUTINE REMOVE (OPTION,LIST)

INTEGER
HEAD(25),IHEAD,IOUT,ITAIL,ITEM,LINKPR(1000),LINKSR(1000
)
& LIST,NAR,OPTION,ROW,TAIL(25)
REAL MASTER(1000.10),SIZE
COMMON /LLIST/

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/

* If the list value is improper, stop the simulaton.

IF (LIST .LT. 1 .OR. LIST .GT. 25) THEN
10 FORMAT ( From SIMLIB:,I10
& is an improper value for REMOVE LIST at
time ,F10.3)
STOP
END IF

* If the list is empty, stop the simulation.

IF (LSIZE(LIST) .LE. 0) THEN
20 FORMAT ( From SIMLIB: underflow of list ,I2,
& AT TIME ,F10.3)
STOP
END IF

LSIZE(LIST) = LSIZE(LIST) 1

* If the option value is improper, stop the
simulation.

IF (OPTION .NE. 1 .AND. OPTION .NE. 2) THEN
WRITE (IOUT,30) OPTION, TIME
& Is improver value for REMOVE OPTION at
time ,F10.3)
STOP
END IF

* IF there is more than one record in the list,
continue.

IF (LSIZE(LIST) .EQ. 0) GO TO 300

* Remove according to the desired option.

GO TO (100, 200), OPTION

Remove the first record in the list.

100 ROW = HEAD(LIST)
IHEAD = LINKSR(ROW)
LINKPR(IHEAD) = 0
HEAD(LIST) = IHEAD

* Go to transfer the data.
GO TO 400

* Remove the last record in the list.

200 ROW = TAIL(LIST)]
ITAIL = LINKPR(ROW)
LINKSR(ITAIL) = 0
TAIL(LIST) = ITAIL

* Go to transfer the data.
GO TO 400

* Remove the only record in the list.

300 ROW = HEAD(LIST)
HEAD(LIST) = 0
TAIL(LIST) = 0

400 LINKSR(ROW) = NAR
LINKPR(ROW) = 0
NAR = ROW
DO 410 ITEM = 1, MAXATR
410 TRNSFR(TEM) = MASTER(ROW,ITEM)

* Update the area under the number-in

CALL TIMEST(FLOAT(LSIZE(LIST),20 + LIST)

RETURN
END

SUBROUTINE TIMING
INTEGER
HEAD(25),IOUT,LINKPR(1000),LINKSR(1000),NAR,TAIL(25)
REAL MASTER(1000,10)
COMMON /LLISTS/

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/

* Remove the first event from the event list.

CALL REMOVE (LFIRST,LEVENT)

* Check for a time reversal.

IF (TRNSFR(1) .LT. TIME) THEN
WRITE (IOUT,10) TRNSFR(2), TRNSFR(1), TIME
10 FORMAT ( From SIMLIB: Attempt to schedule an
event of type
& F3.0/ at time ,F10.3 when the clock is
F10.3)
STOP
END IF

* Advance the simulation clock.

TIME = TRNSFR(1)
NEXT = TRNSFR(2)

RETURN
END

SUBROUTINE CANCEL(ETYPE)

INTEGER
AHEAD,BEHIND,HEAD(25),IOUT,ITEM,LINKPR(1000),LINKSR(100
0),
& NAR,ROW,TAIL(25)
REAL ETYPE,HIGH,LOW,MASTER(1000,10),SIZE,VALUE
COMMON /LIST/

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/
LDECR,LEVENT,LFIRST,LINCR,LLAST,LRANK,LSIZE

* Search the event list.

IF (LSIZE(LEVENT) .EQ. 0) RETURN
ROW = HEAD(LEVENT)
LOW = ETYPE 0.1
HIGH = ETYPE + 0.1
10 VALUE = MASTER(ROW,2)
IF (LOW .LT. VALUE .AND. HIGH .GT. VALUE) GO TO
20

* Go to the next event.

IF (ROW .EQ. TAIL(EVENT)) RETURN
ROW = LINKSR(ROW)
GO TO 10

* Cancel this event.

20 IF (ROW .NE. HEAD(LEVENT)) GO TO 30

* Remove the first event in the event list.

CALL REMOVE(LFIRST,LEVENT)
RETURN

30 IF (ROW .NE. TAIL(LEVENT)) GO TO 40

* Remove the last event in the event list.

CALL REMOVE(LLAST,LEVENT)
RETURN

* Remove this event which is somewhere in the middle
of event list.

40 AHEAD = LINKSR(ROW)
BEHIND = LINKPR(ROW)
LINKSR(BEHIND) = AHEAD
LINKPR(AHEAD) = BEHIND
LINKSR(ROW) = NAR
LINKPR(ROW) = 0
NAR = ROW
LSIZE(LEVENT) = LSIZE(LEVENT) 1

* Place the attributes of the canceled event in the
TRNSFR array.

DO 50 ITEM = 1, MAXATR
50 TRNSFR(ITEM) = MASTER(ROW,ITEM)

* Update the are under the number-in-list curve.

CALL TIMEST(FLOAT(LSIZE(LEVENT)),45)

RETURN
END

SUBROUTINE SAMPST(VALUE,VARIBL)

INTEGER
HEAD(25),IOUT,IVARLINKPR(1000),LINKSR(1000),NAR,NOBS(20
),
& ITAIL(25),VARIBL
REAL
MASTER(1000,10),MAX(20),MIN(20),SUM(20),VALUE
COMMON /LIST/

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/

* Force saving of local accumulator arrays between
calls.

SAVE MAX,MIN,NOBS,SUM

* If the variable number is improper, stop the
simulation.

IF (VARIBL .LT. -20 .OR. VARIBL .GT. 20) THEN
WRITE (IOUT,10) VARIBL,TIME
10 FORMAT ( From SIMLIB ,I10,
& is improper value for SAMPST variable
at time,
& F10.3)
STOP
END IF

* Execute the desired option.

IF (VARIBL) 300, 100, 200

* Initialze the routine.

100 DO 110 VAR = 1, 20
SUM(IVAR) = 0.0
MAX(IVAR) = -1.0E+30
MIN(IVAR) = 1.0E+30
110 NOBS(IVAR) = 0
RETURN

* Collect data.

200 SUM(VARIBL) = SUM(VARIBL) + VALUE
IF (VALUE .GT. MAX(VARIBL)) MAX(VARIBL) = VALUE
IF (VALUE .LT. MIN(VARIBL)) MIN(VARIBL) = VALUE
NOBS(VARIBL) = NOBS(VARIBL) + 1
RETURN

* Report the results.

300 IVAR = -VARIBL
TRNSFR(1) = 0.0
TRNSFR(2) = NOBS(IVAR)
TRNSFR(3) = MAX(IVAR)
TRNSFR(4) = MIN(IVAR)
IF (NOBS(IVAR) .EQ. 0) RETURN
TRNSFR(1) = SUM(IVAR) / TRNSFR(2)

RETURN
END

SUBROUTINE TIMEST(VALUE,VARIBL)
INTEGER
HEAD(25),IOUT,IVAR,LINKPR(1000),LINKSR(1000),NAR,TAIL(2
5),
& VARIBL
REAL
AREA(45),MASTER(1000,10),MAX(45),MIN(45),PREVAL(45),TLV
C(45),
& VALUE,TRESET
COMMON /LLISTS/

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/
& MAXATR,NEXT,TIEM,TRNSFR

* Force saving of local accumulator arrays between
calls.

SAVE AREA,MAX,MIN,PREVAL,TLVC

* If the variable value is improper, stop the
simulation.

IF (VARIBL .LT. -45 .OR. VARIBL .GT. 45) THEN
WRITE (IOUT,10) VARIBL, TIME
10 FORMAT ( From SIMLIB:,I10
& is improper value for TIMEST variable
at time,
& F10.3)
STOP
END IF

* desired option.

IF (VARIBL) 300, 100, 200

100 DO 110 IVAR = 1, 45
AREA(IVAR) = 0.0
MAX(IVAR) = -1.0E+30
MIN(IVAR) = 1.0E+30
PREVAL(IVAR) = 0.0
110 TLVC(IVAR) = TIME
TRESET = TIME
RETURN

200 ARE(VARIBL)=AREA(VARIBL)+(TIME
TLVC(VARIBL))*PREVAL(VARIBL)
IF (VALUE .GT. MAX(VARIBL)) MAX(VARIBL) = VALUE
IF (VALUE .LT. MIN(VARIBL)) MIN(VARIBL) = VALUE
PREVAL(VARIBL) = VALUE
TLVC(VARIBL) = TIME
RETURN

300 IVAR = -VARIBL
AREA(IVAR) = AREA(IVAR) + (TIME TLVC(IVAR))
*PREVAL(IVAR)
TLVC(IVAR) = TIME
TRNSFR(1) = AREA(IVAR) / (TIME TRESET)
TRNSFR(2) = MAX(IVAR)
TRNSFR(3) = MIN(IVAR)

RETURN
END

SUBROUTINE FILEST(LIST)

INTEGER ILIST,LIST

INTEGER
LDECR,LEVENT,LFIRST,LINCR,LLAST,LRANK(25),LSIZE(25)
& MAXATR,NEXT
COMMON /SIMLIB/

* Compute summary statistlcs for the list.

ILIST = -(20 + LIST)
CALL TIMEST(0.0,ILIST)

RETURN
END

SUBROUTINE OUTSAM(UNIT,LOWVAR,HIVAR)

INTEGER HIVAR,I,IVAR,LOWVAR,UNIT

INTEGER
LDECR,LEVENT,LFIRST,LINCR,LLAST,LRANK(25),LSIZE(25)
& MAXATR,NEXT
COMMON /SIMLIB/

* Write header.

WRITE (UNIT,10)
10 FORMAT (/ SAMPST ,24X,Number/
& Variable,26X,of/
& Number
,6X,Average,11X,Values,10X,Maximum,
& 10X,Minimum/IX,76(_))

* Loop for desired SAMPST variable range.

DO 20 IVAR = LOWVAR, HIVAR

* Obtain and write summary satatistics on SAMPST
variable IVAR.

CALL SAMPST (0.0,-IVAR)

20 WRITE (UNIT,30) IVAR, (TRNSFR(I), I = 1, 4)
30 FORMAT(/3X,I3,3X,4(1X,E15.7,IX))
WRITE (UNIT,40)
40 FORMAT (1X,76(-))

RETURN
END

SUBROUTINE OUTTIM(UNIT,LOWVAR,HIVAR)

INTEGER HIVAR,I,IVAR,LOWFAR,UNIT

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/

* Write header.

WRITE (UNIT,10)
10 FORMAT (/ TIMEST /
& Variable 7X TIME/
& Number 6X
Average,10X,Maximum,10X,Minimum/
& 1X,59(-))

* Loop for desired TIMEST variable range.

DO 20 IVAR = LOWVAR, HIVAR

* Obtain and write sumcary statistics on TIMEST
variable IVAR.

CALL TIMEST(0.0,-IVAR)

20 WRITE (UNIT,30) IVAR, (TRNSFR(I), I = 1, 3)
30 FORMAT (/3X,I3,3X,3(1X,E15.7,1X))
WRITE (UNIT,40)
40 FORMAT (1X,59(-))

RETURN
END

SUBROUTINE OUTFIL(UNIT,LOWFIL,HIFIL)

INTEGER HIFIL,I,IFIL,LOWFIL,UNIT

INTEGER
& MAXATR,NEXT
COMMON /SIMLIB/
LDECR,LEVENT,LFIRST,LINCR,LLAST,LRANK,LSIZE

* Write header.

WRITE (UNIT,10)
10 FORMAT (/ File ,8X,Time/
&
Number,7X,Average,10X,Maximum,10X,Minimum/
& 1X,59(-))

* Loop for desired file number range.

DO 20 IFIL = LOWFIL, HIFIL

* Obtain and write summary statistics on file IFIL.

CALL FILEST(IFIL)
20 WRITE (UNT,30) IFIL, (TRNSFR(I), I = 1, 3)
30 FORMAT (/3X,I3,3X,3(1X,E15.7,1X))
WRITE (UNIT,40)
40 FORMAT (1X,59(-))

RETURN
END

REAL FUNCTON ERLANG(M,RMEAN,ISTRM)
INTEGER I,M,ISTRM
REAL MEXP,RMEAN
REAL EXPON

*Generate an M-Erlang random variate with mean RMEAN
using stream
*ISTRM.

MEXP = RMEAN / M
ERLANG = 0.0
DO 10 I = 1, M
10 ERLANG = ERLANG + EXPON(MEXP,ISTRM)

RETURN
END

REAL FUNCTION EXPON(RMEAN,ISTRM)

INTEGER ISTRM
REAL RMEAN,U
REAL RAND

* Generate a U(0,1) random variate from stream ISTRM

U = RAND(ISTRM)

* Generate an exponential random variate with mean
RMEAN.

EXPON = -RMEAN * LOG(U)

RETURN
END

INTEGER FUNCTION IRANDI(NVALUE,PROBD,ISTRM)

INTEGER I,ISTRM,NVALUE
REAL PROBD(1),U
REAL RAND

* Generate a U(0,1) random variate from stream ISTRM.

U = RAND(ISTRM)

*Generate a random integer between 1 and NVALUE in
accordance with
* the (cummulative) distribution function PROBD.

DO 10 I = 1, NVALUE 1
IF (U .LT. PROBD(I)) THEN
IRANDI = I
RETURN
END IF
10 CONTINUE
IRANDI = NVALUE

RETURN
END

REAL FUNCTION UNIFRM(A,B,ISTRM)

INTEGER ISTRM
REAL A,B,U
REAL RAND

* Generate a U (O,}) random variate from stream ISTRM.

U = RAND(ISTRM)

* Generate a U(A,B) random variate.

UNIFRM = A + U * (B - A)

RETURN
END

REAL FUNCTION RAND(ISTRM)
INTEGER
B2E15,B2E16,HI15,HI31,ISTRM,IZGET,IZSET,LOW15,LOWPRD,
& MODLUS,MULT1,MULT2,OVFLOW,ZI,ZRNG(100)
INTEGER IRANDG,RANDST

* Force saving of ZRNG between calls.

SAVE ZRNG

(Continued.)
* Define the constants.

DATA MULT1,MULT2/24112,26143/
DATA B2E15,B2E16,MODLUS/32768,65536,2147483647/

* Set the default seeds for all 100 streams.

DATA ZRNG/1973272912, 281629770,
20006270,1280689831,2096730329,
& 1933576050, 913566091, 246780520,1363774876,
604901985,
& 1511192140,1259851944, 824064364, 150493284,
242708531,
& 75253171,1964472944,1202299975,
233217322,1911216000,
& 726370533, 403498145, 993232223,1103205531,
762430696,
& 1922803170,1385516923, 76271663, 413682397,
726466604,
& 336157058,1432650381,1120463904, 595778810,
877722890,
& 1046574445, 68911991,2088367019, 748545416,
622401386,
& 2122378830,
640690903,1774806513,2132545692,2079249579,

& 78130110,
852776735,1187867272,1351423507,1645973084,
& 1997049139, 922510944,2045512870, 898585771,
243649545,
& 1004818771, 773686062, 403188473,
372279877,1901633463,
& 498067494,2087759558, 493157915,
597104727,1530940798,
& 1814496276, 536444882,1663153658, 855503735,
67784357,
& 1432404475, 619691088, 119025595, 880802310,
176192644,
& 1116780070,
277854671,1366580350,1142483975,2026948561,
& 1053920743,
786262391,1792203830,1494667770,1923011392,
& 1433700034,1244184613,1147297105,
539712780,15929719,
& 190641742,1645390429, 264907697,
620389253,1502074852,
& 927711160, 364849192,2049576050, 638580085,
547070247/

* the next random number.

ZI = ZRNG(ISTRM)
HI15 = ZI / B2E16
LOWPRD = (ZI HI15 * B2E16) * MULT1
LOW15 = LOWPRD / B2E16
HI31 = HI15 * MULT1 + LOW15
OVFLOW = HI31 / B2E15
ZI = (((LOWPRD LOW15 * B2E16) MODLUS +
& (HI31 OVFLOW * B2E15) * B2E16) + OVFLOW
IF (ZI .LT. 0) ZI = ZI + MODLUS
HI15 = ZI / B2E16
LOWPRD = (ZI HI15 * B2E16) * MULT2
LOW15 = LOWPRD / B2E16
HI31 = HI15 * MULT2 + LOW 15
OVFLOW = HI31 / B2E15
ZI = (((LOWPRD LOW15 * B2E16) MODLUS) +
& (HI31 OVFLOW * B2E15) * B2E16) + OVFLOW
IF (ZI .LT. 0) ZI = ZI + MODLUS
ZRNG(ISTRM) = ZI
RAND = (2 * (ZI / 256) + 1) / 16777216.0
RETURN

ENTRY RANDST(IZSET,ISTRM)
ZRNG(ISTRM) = IZSET
RETURN

* Return the current ZRNG for stream ISTRM.

ENTRY IRANDG(ISTRM)
IRANDG = ZRNG(ISTRM)
RETURN

END

Listing Simlib 2

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Listing Simlib 2

Hochgeladen von

Copyright:

Verfügbare Formate

5

Das könnte Ihnen auch gefallen