Shift method capable of ensuring relative fairness of shift

Abstract

The invention discloses a shift method capable of ensuring the relative fairness of a shift. The shift method comprises the first step of defining a shift algorithm parameter set according to the characters of the current shift, the second step of initializing each parameter in the parameter set, the third step of initializing the shift data to form an initial shift scheme after limiting rules are added, the fourth step of carrying out statistic on the times and total days of the night shift of each worker in the initial shift scheme, summing the night shift times and the total days of each worker of the prior periods, working out scores of the night shift times according to the grading standards of the night shift times, working out scores of the total days according to the grading standards of the total days, and calculating a fairness value based on a fairness computational formula, and the fifth step of comparing the fairness value worked out in the fourth step with an initialized adaptive value in the second step, wherein if the fairness value conforms to the adaptive value, shifting is finished. Compared with the prior art, the shift method can ensure the relative fairness of the shift in N periods.

Description

technical field [0001] The invention relates to the field of shift scheduling, and more specifically relates to a shift scheduling method that can ensure relative fairness of shift scheduling. Background technique [0002] In all walks of life, because each job position needs to be divided into different time periods, so-called job shifts are produced. In this way, a certain number of staff members need to be arranged and combined according to the job shifts to form a schedule. For this In addition to meeting some special requirements for the schedule table, such as when someone has to go to work on a certain day and which days someone asks for leave, another core and important issue is the fairness of the schedule. [0003] Due to the continuity of scheduling, the current scheduling method can only guarantee the relative fairness of the current scheduling cycle, but for N scheduling cycles, it cannot guarantee the relative fairness of scheduling, and there is room for impro...

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a scheduling method that can ensure the relative fairness of scheduling, so as to solve the problem that relative fairness cannot be guaranteed in the prior art for N scheduling cycles

Images