References for other algorithms and techniques used in FET:

Generating a random permutation of a vector in linear time (used to shuffle the order of time slots at which an activity can be placed):
Thomas H. Cormen, Charles E. Leiserson and Ronald R. Rivest  Introduction to Algorithms  first edition (in Romanian), Section 8.3, Exercise 8.34.

Obsolete  it was replaced in FET version 5.44.0: 32 bit random number generator:
Donald E. Knuth  The Art of Computer Programming  Volume 2  Seminumerical Algorithms, Third Edition (in Romanian), Section 3.6.

The 32 bit random number generator named MRG32k3a:
P. L'Ecuyer, ``Good Parameter Sets for Combined Multiple Recursive Random Number Generators'', Shorter version in Operations Research, 47, 1 (1999), 159164.
http://pubsonline.informs.org/doi/abs/10.1287/opre.47.1.159
Includes ideas and code from the files:
http://simul.iro.umontreal.ca/rng/MRG32k3a.h,
http://simul.iro.umontreal.ca/rng/MRG32k3a.c,
and/or https://www.iro.umontreal.ca/~lecuyer/myftp/papers/combmrg2.c.
Used with permission from the author, Pierre L'Ecuyer (9 March 2020).