0.5.1

This is a small maintenance release

API Changes:

• Bump project dependencies
• Add Python 3.10 and 3.11 support

Docs

• Add scheduling article

0.5.0

This release implements several new features as well as the most complete documentation so far, with all the use cases/modules explained

Features:

• Added a new type of solver under the class MinHoursRoster for rostering problems, it can find the roster of resources for each day and shift subject to shift restrictions, resting days, shifts preferences, bans, and more.
• Added the properties waiting_probability_params, service_level_params, achieved_occupancy_params, and required_positions_params in MultiErlangC to track in which combination order each method returns a solution.

API Changes:

• The queing module was renamed to queuing
• The shifts module was renamed to scheduling

Docs

• Added tutorials on scheduling and rostering problems

0.4.1

This release implements:

• The first version of the package docs
• All the API and parameters references
• ErlangC tutorials
• GitHub tests with support for different O.S
• Changes the package support to python 3.7, 3.8 and 3.9

0.4.0

Features:

• queuing.MultiErlangC class, implements grid search to use ErlangC with several combination of parameters under a same class

Docs:

• Added examples of queuing.MultiErlangC

0.3.0

Features:

• shift.MinRequiredResources method, it solves the shift problem by using the "optimal" criteria defined as the minimum weighted amount of resources (by optional shift cost) to shift, that ensures that there are never less resources shifted that the ones required per period

Docs:

• Better explanaition per method from pyworkforce.shifts

0.2.2

Docs:

• Codecov badge and coverage goal
• Examples and code documentation
• Bug Report and Feature Request template

0.2.1

Enchacements:

• travis-ci for build, test and coverage report

Bugs Fixes:

• Fix the check of shifts.MinAbsDifference variables range
• Fix the check of max_occupancy variable range in queing.ErlangC
• Fix dependencies versions

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

0.1.1

Features:

• ErlangC for solving queue systems positions requirements

Docs:

• Examples of use of ErlangC to solve call center problem.