ByQueueLength implements sort.Interface for []*Queue based on Length.

AlwaysQueueArrBeh always puts incoming jobs in the given queue. Processors don't even enter into it.

An ArrBeh ("arrival behavior") assigns new jobs to queues or processors.

An ArrProc (short for "arrival process") generates new Jobs at some interval.

An Assignment indicates where a Job has been assigned by an Arrival Behavior. The string Type will be either "Processor" or "Queue", and the correspo

To run a simulation, you have to implement the System interface: https://godoc.org/github.com/danslimmon/qsim#System

ConstantArrProc generates jobs at a constant interval. It implements the ArrProc interface.

To run a simulation, you have to implement the System interface: https://godoc.org/github.com/danslimmon/qsim#System

A Job is the object that passes through a queueing system.

OneToOneFIFODiscipline moves Jobs from Queues to Processors based on the following algorithm: – There is a one-to-one relationship between Queues and

PoissonArrProc generates jobs according to a Poisson process. This means that the distribution of intervals between arrivals is an exponential distrib

A Processor is the piece of the queueing system that processes jobs.

A Queue holds Jobs until they're ready for processing.

Schedule holds simEvents in the order that they need to be run. Events that have already occurred are removed.

ShortestQueueArrBeh implements the ArrBeh interface, assigning new Jobs by the following algorithm: – If there is at least one idle Processor, pick a

A System is the thing you simulate. You implement this interface and pass your implementation to RunSimulation().

An event scheduled to occur in the simulation We'll run the function F at tick Time. F will be called at time Time with the current clock time as its