0.2.0

Features:

• MinAbsDifference solver to find the optimal number of resources (agents, operators, doctors, etc) to allocate in a shift, based on a pre-defined requirement of number of resources per period of the day (periods of hours, half-hour, etc)

Bugs Fixes:

• Number of positions required found by ErlangC when the achieved occupancy were greater than the max_occupancy parameter, it was not being calculated, but instead it was being replaced by the ErlangC value, which was resulting in ignoring the parameter

Docs:

• Added example using MinAbsDifference solver