antonio-ramadas / nurse-rostering-solution Goto Github PK

Every nurse that has the complete weekend value set to true, must work both
week-end days or none. If she/he works only one of the two days Sat and Sun this is penalised by the
corresponding weight.

May be informal (just display on terminal), but required to ensure a valid implementation.

A shift of a given skill must necessarily be fullled by a nurse having that skill.

For each nurse the number of working weed-ends must be less than or equal to the maximum. The number of worked week-ends in excess is added to the objective function multiplied by the weight. A week-end is considered \working" if at least one of the two days (Sat and Sun) is busy for the nurse.

The number of nurses for each shift for each skill must be equal to the optimal requirement. Each missing nurse is penalised according to the weight provided.
Extra nurses above the optimal value are not considered in the cost.

A nurse can be assigned to at most one shift per day.

The number of nurses for each shift for each skill must be at least equal to the minimum requirement.

The shift type assignments of one nurse in two consecutive days must belong to
the legal successions provided in the scenario.

For each nurse the total number of assignments (working days) must be included
within the limits (minimum and maximum) enforced by her/his contract. The di�erence (in either
direction), multiplied by its weight, is added to the objective function.

At this moment, JSON is passed by argument by value (not by reference) and without any kind of trim (it is not deleted unnecessary parts). As the number of JSON files is low and their length is short, this issue does not require our attention, for now.

At this moment, the parser only stores IDs as references even though the objects of those IDs were already read. This enhancement has not been done, yet, due to constant restructuring of the project. It is strongly advisable to do this only after the parser is completed as it'll lead to more efficient coding.

Minimum and maximum number of consecutive assignments, per
shift or global, should be respected. Their evaluation involves also the border data. Each extra or missing
day is multiplied by the corresponding weight. The weights for consecutive shift constraint and for
consecutive working days are respectively 15 and 30.

The project structure needs a fresh new vision before starting the implementation of the algorithm. In case of any mistakes or improvements, they should be implemented.

Each assignment to an undesired shift is penalised by the corresponding weight.

At this moment, the only thing being done is the parser. Therefore, it is too soon to know the best data structure to be applied (map, tree, ...). So, before or at the same time of the implementation of the algorithm, it is necessary to choose better data structures as the current data structure, vectors, won't probably be the best choice.

Minimum and maximum number of consecutive days o� should be respected.
Their evaluation involves also the border data. Each extra or missing day is multiplied by the corresponding
weight.