Module 520 in TOMS

• TOMS Information

• Components
  • Fullsource from NETLIB

520

 
ARSME: a Fortran subroutine for solving a resource constrained network
scheduling problem for the case in which the activities may be arbitrarily
interrupted and restarted later with no increase in activity duration. The
method used is an automatic revised simplex method. (See J. Weglarzet et al., ACM
TOMS 3 (1977) pp. 295-300.).
 
Classes  :  G2c5 . Routing, scheduling, and location problems in integer
                 programming
 
Type     : Fortran software in TOMS collection.
Access   : Some uses prohibited. Portable.
Precision: Single.
 
Usage    : CALL ARSME (M, M1, M2, MEND, RT, NI, NS, X, R, RL, IBV, LO, E, U, D)
 
Details  : Fullsource
Sites    : (1) NETLIB
 

Implementation of 520 from TOMS on NETLIB

 
NETLIB:    Public access repository, The University of Tennessee at
           Knoxville and Bell Laboratories
 
Precision: Single.
 
You may access components from NETLIB outside GAMS as follows.
 
   Fullsource   : echo "send 520 from toms" | mail netlib@ornl.gov