CN110807618A - Dynamic scheduling method, device and equipment - Google Patents
Dynamic scheduling method, device and equipment Download PDFInfo
- Publication number
- CN110807618A CN110807618A CN201911046884.3A CN201911046884A CN110807618A CN 110807618 A CN110807618 A CN 110807618A CN 201911046884 A CN201911046884 A CN 201911046884A CN 110807618 A CN110807618 A CN 110807618A
- Authority
- CN
- China
- Prior art keywords
- card punching
- shift
- date
- card
- scheduled
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000004080 punching Methods 0.000 claims abstract description 210
- 238000009826 distribution Methods 0.000 claims abstract description 10
- 230000003203 everyday effect Effects 0.000 claims abstract description 9
- 238000003860 storage Methods 0.000 claims description 16
- 230000008569 process Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000002354 daily effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
- G06Q10/1091—Recording time for administrative or management purposes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
- G06Q10/1093—Calendar-based scheduling for persons or groups
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a dynamic scheduling method, a device and equipment, which only need to set the selectable number of shifts of staff to be scheduled within a preset date range, record the card-punching record information of the staff to be scheduled, generating a card punching sequence according to the card punching record information of the staff to be scheduled, grouping the card punching sequence, dynamically distributing the obtained card punching group to the selectable shift of the staff to be scheduled according to the preset distribution convention, the staff of treating the scheduling carries out the distribution attendance of working a shift in every day of presetting the date within range, does not need enterprise's manpower resources management personnel to every staff of treating the scheduling to carry out manual work scheduling attendance, has avoided the manual work increase and the loaded down with trivial details nature of work of manpower resources management personnel who brings of carrying out the distribution of working a shift to the staff one by one, has promoted enterprise's manpower resources management personnel's work efficiency, has reduced the manpower resources management cost of enterprise.
Description
Technical Field
The application relates to the technical field of attendance checking, in particular to a dynamic scheduling method, a dynamic scheduling device and a dynamic scheduling equipment.
Background
In enterprise management, attendance checking of employees is an important part of enterprise management. The existing attendance system needs to perform specific and single shift distribution in a selected date range for each or every group of workers, namely, needs to perform manual shift arrangement. When the number of the employees of the enterprise is small, the defects are not obvious, but the number of the employees is increased along with the enlargement of the scale of the enterprise, the types of the shifts brought by the work types are diversified, the employees are manually distributed one by one, the workload of the human resource managers is greatly increased, the complexity of the work is greatly increased, the work efficiency of the human resource managers of the enterprise is reduced, and the human resource management cost of the enterprise is increased.
Therefore, the optimization of the scheduling and attendance checking mode to improve the working efficiency of the human resource management personnel of the enterprise and reduce the human resource management cost of the enterprise is a technical problem to be solved urgently by technical personnel in the field.
Disclosure of Invention
The application aims to provide a dynamic scheduling method, a dynamic scheduling device and dynamic scheduling equipment, which are used for improving the working efficiency of enterprise human resource management personnel and reducing the human resource management cost of enterprises.
The first aspect of the present application provides a dynamic shift scheduling method, including:
obtaining a card punching sequence and an optional shift of staff to be scheduled within a preset date range, wherein the card punching sequence is composed of all card punching records of the staff to be scheduled every day, and the card punching records comprise card punching record identifiers, staff identifiers, card punching time and card punching states;
grouping the card punching sequences to obtain a plurality of card punching groups;
and finding out the unique shift of each date in the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating an employee scheduling list of the employee to be scheduled.
Optionally, after the card punching sequences are grouped to obtain a plurality of card punching groups, finding out a unique shift of each date in the date range and the corresponding card punching group according to the matching degree between the card punching groups and the selectable shifts, and before generating the employee shift list of the employee to be scheduled, the method further includes:
and determining the respective attributive dates of all the card punching groups according to the card punching states and the card punching times of the first card punching records of the card punching groups, wherein the card punching states comprise the current day starting state, the last day starting state and the next day starting state.
Optionally, finding out a unique shift of each date within the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating an employee shift list of the employee to be shifted, including:
if the selectable shifts exist in a single date in the preset date range, selecting one shift which is most matched with the card punching group corresponding to the single date from all the selectable shifts in the single date as the shift of the single date;
if the optional shift does not exist in the preset date within the preset date range, recording that the preset date is not scheduled;
and generating an employee scheduling list of the employee to be scheduled according to the scheduling condition.
Optionally, the selecting, as the shift of the single date, one shift that is most matched with the punch-card group corresponding to the single date from all the selectable shifts within the single date includes:
when the single date has the corresponding punch card group, selecting one shift which is most matched with the punch card group corresponding to the single date from all the selectable shifts in the single date as the shift of the single date;
and when the single date does not have the corresponding card punching group, randomly selecting one shift from all the selectable shifts in the single date as the shift of the single date.
Optionally, the step of finding out the unique shift of each date within the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating the employee shift list of the employee to be shifted includes:
and selecting one shift which is most matched with the card punching group corresponding to the single date from all the selectable shifts in the single date based on an optimal matching method, and taking the selected shift as the shift of the single date to generate an employee shift list of the employee to be shifted.
The second aspect of the present application further provides a dynamic shift scheduling apparatus, including:
the system comprises an acquisition module, a storage module and a display module, wherein the acquisition module is used for acquiring a card punching sequence and an optional shift of staff to be scheduled within a preset date range, the card punching sequence is composed of all card punching records of the staff to be scheduled every day, and the card punching records comprise a card punching record identifier, a staff identifier, a card punching time and a card punching state;
the grouping module is used for grouping the card punching sequences to obtain a plurality of card punching groups;
and the shift distribution module is used for finding out the unique shift of each date in the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating an employee shift list of the employee to be shifted.
Optionally, the method further includes:
and the matching module is used for determining the dates to which all the card punching groups belong according to the card punching states and the card punching times of the first card punching records of the card punching groups, wherein the card punching states comprise the current day starting state, the previous day starting state and the next day starting state.
Optionally, the shift allocation module is specifically configured to:
if the selectable shifts exist in a single date in the preset date range, selecting one shift which is most matched with the card punching group corresponding to the single date from all the selectable shifts in the single date as the shift of the single date;
if the optional shift does not exist in the preset date within the preset date range, recording that the preset date is not scheduled;
and generating an employee scheduling list of the employee to be scheduled according to the scheduling condition.
A third aspect of the present application provides a dynamic shift arrangement device, the device comprising a processor and a memory:
the memory is used for storing program codes and transmitting the program codes to the processor;
the processor is configured to execute any of the dynamic shift scheduling methods of the first aspect according to instructions in the program code.
A fourth aspect of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium is configured to store program code for executing any one of the dynamic shift scheduling methods of the first aspect.
The application provides a dynamic scheduling method, which comprises the following steps: acquiring a card punching sequence and an optional shift of staff to be scheduled within a preset date range, wherein the card punching sequence is formed by all card punching records of the staff to be scheduled every day, and the card punching records comprise card punching record identifiers, staff identifiers, card punching time and card punching states; grouping the card punching sequences to obtain a plurality of card punching groups; and according to the matching degree of the card punching group and the selectable shift, finding out the unique shift of each date in the date range and the corresponding card punching group, and generating an employee shift list of the employee to be shifted. The dynamic scheduling method provided by the application only needs to set the selectable shift of the staff to be scheduled within the preset date range, record the card-punching record information of the staff to be scheduled, generating a card punching sequence according to the card punching record information of the staff to be scheduled, grouping the card punching sequence, dynamically distributing the obtained card punching group with the grouping identification to the selectable shift of the staff to be scheduled according to the preset distribution agreement, the staff of treating the scheduling carries out the assignment of shift each day in presetting the date within range, does not need enterprise's manpower resource management personnel to every staff of treating the scheduling to carry out manual attendance of scheduling, has avoided the manual work increase and the loaded down with trivial details nature of work of manpower resource management personnel that brings of carrying out the assignment of shift one by one to the staff, has promoted enterprise's manpower resource management personnel's work efficiency, has reduced the manpower resource management cost of enterprise.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a schematic flow chart of an embodiment of a dynamic shift scheduling method provided in an embodiment of the present application;
fig. 2 is a schematic flow chart of another embodiment of a dynamic shift scheduling method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a dynamic shift scheduling apparatus provided in an embodiment of the present application;
fig. 4 is a schematic diagram of the connection of attendance management system modules corresponding to a dynamic scheduling method.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a schematic flow chart of a dynamic scheduling method provided in an embodiment of the present application, where the dynamic scheduling method provided in the embodiment of the present application includes:
step 101, obtaining a card punching sequence and an optional shift of the staff to be scheduled within a preset date range, wherein the card punching sequence is composed of all card punching records of the staff to be scheduled every day, and the card punching records comprise a card punching record identifier, a staff identifier, a card punching time and a card punching state.
And 102, grouping the card punching sequences to obtain a plurality of card punching groups.
And 103, finding out the unique shift of each date in the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating an employee shift list of the employee to be shifted.
According to the dynamic scheduling method provided in the embodiment of the application, only the number of the optional shifts of the staff to be scheduled in the preset date range needs to be set, the card punching record information of the staff to be scheduled is recorded, the card punching sequence can be generated according to the card punching record information of the staff to be scheduled, the card punching sequence is grouped, the best matched shift is selected according to the matching degree of the card punching group and the optional shift, the staff to be scheduled can carry out shift distribution every day in the preset date range, manual scheduling attendance of each staff to be scheduled by enterprise human resource managers is not needed, workload increase and work complexity of the human resource managers caused by manual one-to-one shift distribution of the staff are avoided, the work efficiency of the human resource managers of the enterprises is improved, and the human resource management cost of the enterprises is reduced.
For ease of understanding, referring to fig. 2, the present application provides another embodiment of a dynamic shift scheduling method, comprising:
202, grouping the punching sequences to obtain a plurality of punching groups;
and step 203, determining the respective attributive dates of all the card punching groups according to the card punching states and the card punching times of the first card punching records of the card punching groups, wherein the card punching states comprise the current day starting state, the previous day starting state and the next day starting state.
It should be noted that, in the process of performing attendance statistics on the staff to be scheduled, the card punching records of the staff to be scheduled should be recorded, and after the card punching record information of the staff to be scheduled is obtained, the card punching records need to be arranged according to the order of the card punching time of the card punching records, so as to form a card punching sequence. For convenience of description, a punch sequence or a punch group can be indicated by brackets, for example, 1: xxx represents a punch sequence with the number of 1 and composed of 3 punch records with the punch state of x, which can be referred to as a group [1], and x … represents a punch sequence composed of a plurality of punch records with the punch state of x, wherein x … represents 0 or more repetitions of x, and each x implicitly contains punch time and employee Identification (ID). By searching the card punching records of the staff to be scheduled within the preset date range, the card punching sequence formed by all the card punching records of the staff to be scheduled can be obtained.
It should be noted that, in the embodiment of the present application, the basis of grouping is a card punching state, and the card punching state may include the following 4 types: for convenience, t, l, n, and x are also used to indicate one time of card punching corresponding to the states, respectively, t indicates "the current day start state", l indicates "the previous day start state", n indicates "the next day start state", and x indicates other states for distinguishing from the t, l, and n states. Punch-out group [ tt … ] is denoted by T, punch-out group [ ll … ] is denoted by L, punch-out group [ nn … ] is denoted by N, and T, L, N is collectively referred to as starting card group S. In a card punching sequence generated by the staff to be scheduled through the card punching device, the remaining cards are all x except S, so that the card punching sequence can be divided into different card punching groups through S, and specifically, the card punching sequence can be as follows: the part of the punching sequence starting from one S to the next S forms one punching group, and two punching groups of [ Tx … ] and [ Lx … ] can be separated from the punching sequence [ x … Tx … Lx … ]. Each S represents the entire S to function with its first punch, i.e., S is considered a single punch. A minimum time interval for punching a card may be set in the punching device, and two t, l, or n states exceeding the minimum time interval for punching a card are classified into two different S states.
And step 204, finding out the unique shift of each date in the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating an employee shift list of the employee to be shifted.
If the selectable shift exists in a single date within the preset date range, the shift which is most matched with the card punching group corresponding to the single date is used as the shift of the single date; and if the optional shift does not exist in the preset date within the preset date range, recording that the preset date does not have a shift, and generating an employee shift schedule of the employee to be shifted.
Specifically, when a corresponding punch-card group exists in a single date, one shift which is most matched with the punch-card group corresponding to the single date is selected from all the selectable shifts in the single date to be used as the shift of the single date, and when the corresponding punch-card group does not exist in the single date, one shift is arbitrarily selected from all the selectable shifts in the single date to be used as the shift of the single date.
It should be noted that, if there are 3 optional punch-card groups corresponding to one date, where a certain date is W, the previous date is W0, and the next date is W1, then the optional punch-card groups of W are all [ Nx … ] of W0, all [ Tx … ] of W, and all [ Lx … ] of W1. If there are multiple optional play sets, one play set may be selected, such as selecting the first play set as the play set for that date.
For a punch-out group, a represents the punch-out time of the first punch-out, b represents the punch-out time of the last punch-out, and a and b may be the same, then the best matching method may be described as:
(1) and for each shift T with the selectable date, calculating the latest normal working time ts and the earliest normal working time te of the shift on the date, and calculating the matching degree d of the card hitting group and the shift as | ts-a | + | te-b |.
(2) And (3) finding out the optional shifts (at least 1) with the minimum d value in the step (1), and selecting one shift as the shift of the day, such as selecting the shift with the earliest time.
It should be noted that, in the implementation of the present application, a loose-type optimal matching method may also be selected, and the shift that does not cause the attendance abnormality of the employee (such as early return, late arrival, or miner, etc.) is preferably selected. The method can be described as:
and finding out all the optional shifts meeting a is less than or equal to ts and te is less than or equal to b from the optional shift list of a certain day as the shift scheduling shifts, solving a matching value d for the shifts, selecting the shift if the shift with the minimum d can be found, and otherwise, continuously applying the optimal matching method.
In order to more specifically understand the dynamic scheduling method provided by the present application, as shown in table 1, table 1 is a dynamic scheduling table of a certain staff to be scheduled within 5 working days. Suppose that the card-punching sequence is generated for the same staff to be scheduled, the working day is 24 hours, and the change time of the working day is 0.
TABLE 1
The first row in table 1 is a date, the second row is a card punching sequence, the third row is a card punching group obtained after the card punching sequence of the second row is grouped, and the fourth row is an optional card punching group corresponding to a working day. For [1: Lx ] in Table 1, S is L, and the punch card on group [1] is workday 1, based on the meaning of L and the earliest punch card time of L is workday 2. Because the punch record was generated by the user, this means that the user was on weekday 1 for a shift across days, and only on weekday 2 did the punch start working.
For [2: Nxxxxx ], S is N, according to the meaning of N, and the earliest time to punch a card for N is weekday 2, a punch for group [2] is weekday 3, which means that the user was on a morning shift on weekday 3 and the user started to punch a card on weekday 2.
For [3: Txxx ], S is T, the punch card of the group [3] as the working day 3 can be obtained according to the meaning of T and the earliest punch card time of T as the working day 3, so that the working day 3 has two optional punch card groups, and the selection can be made automatically in concrete implementation, for example, the first group is directly selected as the punch card group finally corresponding to the working day. It should be noted here that in the case that the user is in the correct card punching mode, there should be only 1 optional card punching group at most in one working day.
For [4: Txxx ], a similar group [3 ].
For [5: Nx ], similar to group [2 ].
Workday 2 was considered spacious because it failed to match a punch card team.
In order to make the attendance system operate correctly, the user needs to follow the corresponding card punching method or rule, wherein the simplest way is as follows:
when the first punch is performed for a new shift, the day on which the punch time is located is considered to be "today".
If the shift is a "today" shift, then the status of the punch card selects t;
if the shift is a "tomorrow" shift, then the status of the punch card selects n;
if the shift is a "yesterday" shift, then the state of the punch card for the shift selects l.
That is, if a shift of "today" starts at "today", then the first punch is t; if the shift of "tomorrow" started on "today," then the first punch is n; if "today" started the last "yesterday" shift, then the first punch is/.
The generation process of the card punching sequence is described as the second behavior example in table 1 below:
the user needs the last shift across days on weekday 1, but since the user is late, the user only punches cards on weekday 2, thus creating a set of weekday 1 punch cards starting with L [1: Lx ]. The user is absenteezing on weekday 2, so no alternate punch-down set for that day is generated. The user needs the last shift from workday 2 on workday 3 and the user checks to work on workday 2 on schedule, thus generating a set of workday 3 punch-outs starting with N [2: Nxxxxx ]. But due to the user mistakenly punching a card, another set of 3: Txxx is generated. The user is on work on weekday 4, thus creating a set of weekday 4 open groups starting with T [4: Txxx ]. The user was on a morning shift on weekday 5, but the user generated a punch-down group only on weekday 4 [5: Nx ] because no punch-down was made on weekday 5.
Compared with the prior art, the dynamic scheduling method provided by the embodiment of the application has the beneficial effects that:
the system only needs to assign different optional shifts to the employees in the attendance system, does not need to distribute the specific shift of each working day for each employee, and is matched with the function of assigning the optional shift for batch employees, so that the system is convenient for the management work of the human resources of enterprises to a greater extent;
aiming at the scheduling process of an employee, only a card punching sequence and optional shift information need to be input, and other information is not needed, so that the complexity of an attendance system and an operation flow is reduced;
the problem of attribution of the card punching records is solved, if one card punching record is positioned between the superposition time periods of a plurality of selectable shifts, the shift to which the card punching record belongs cannot be determined, and particularly, if one card punching record belongs to the superposition time periods of different shifts of two continuous working days (for example, the previous working day has a cross-day shift, and the next working day has a morning shift);
the method can be applied to attendance management of various enterprises, companies or units.
For ease of understanding, referring to fig. 3, an embodiment of a dynamic shift scheduling apparatus is also provided, including:
the obtaining module 301 is configured to obtain a card punching sequence and an optional shift of the staff to be scheduled within a preset date range, where the card punching sequence is formed by all the card punching records of the staff to be scheduled every day, and the card punching records include a card punching record identifier, a staff identifier, a card punching time, and a card punching state.
And the grouping module 302 is configured to group the card punching sequences to obtain a plurality of card punching groups.
The shift distribution module 303 is configured to find out a unique shift of each date within a date range and a corresponding card punching group according to a matching degree between the card punching group and the selectable shift, and generate an employee shift schedule of the employee to be shifted.
Further, the method also comprises the following steps:
the matching module 304 is configured to determine dates to which all the card punching groups belong according to the card punching states and the card punching times of the first card punching records of the card punching groups, where the card punching states include a current day starting state, a previous day starting state, and a next day starting state.
Further, the shift assigning module 303 is specifically configured to:
if the selectable shifts exist in a single date in the preset date range, selecting one shift which is most matched with the card punching group corresponding to the single date from all the selectable shifts in the single date as the shift of the single date;
if the optional shift does not exist in the preset date within the preset date range, recording that the preset date does not have a shift;
and generating an employee scheduling list of the employee to be scheduled according to the scheduling condition.
As shown in fig. 4, the attendance management system based on the dynamic scheduling method in the present application includes an input module 401, a card punching module 402, a storage module 403, an output module 404, and an attendance module 405. The input module 401 is configured to, on one hand, input HR management information including staff information (including staff identifiers), shift information (including shift identifiers, latest normal work time, earliest normal work time), and optional shift allocation settings of staff (staff may designate different optional shifts on each date), and store the input HR management information in the storage module 403 after being processed by the attendance module 405, and on the other hand, control the attendance module 405 to perform dynamic scheduling, attendance calculation, or result output according to an operation of an operator. The card punching module 402 is used for punching a card by an employee, and generates a card punching record at a time, wherein the record comprises 4 information of an employee identifier, a card punching record identifier, a card punching state, a card punching date and a card punching time, and the card punching record is processed by the dynamic shift attendance module 405 and then stored in the storage module 403. The storage module 403 stores the data generated by the dynamic scheduling attendance module 405, and provides corresponding data for the attendance module 405. The attendance module 405 processes data input by the input module 401 and the card punching module 402 and stores the data in the storage module 403, performs dynamic scheduling and attendance calculation according to the operation of the input module 401 and stores the result data in the storage module 403, and the output module 404 acquires the data of the storage module 403 and outputs the data through the output module 404.
The present application further provides an embodiment of a dynamic shift scheduling apparatus, which includes a processor and a memory:
the memory is used for storing the program codes and transmitting the program codes to the processor;
the processor is used for executing any one of the dynamic scheduling method embodiments according to instructions in the program code.
Also provided herein are embodiments of a computer-readable storage medium for storing program code for performing any of the aforementioned embodiments of dynamic scheduling methods.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for executing all or part of the steps of the method described in the embodiments of the present application through a computer device (which may be a personal computer, a server, or a network device). And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.
Claims (10)
1. A dynamic scheduling method is characterized by comprising the following steps:
obtaining a card punching sequence and an optional shift of staff to be scheduled within a preset date range, wherein the card punching sequence is composed of all card punching records of the staff to be scheduled every day, and the card punching records comprise card punching record identifiers, staff identifiers, card punching time and card punching states;
grouping the card punching sequences to obtain a plurality of card punching groups;
and finding out the unique shift of each date in the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating an employee scheduling list of the employee to be scheduled.
2. The dynamic scheduling method of claim 1, wherein after the card punching sequence is grouped to obtain a plurality of card punching groups, the unique shift of each date in the date range and the corresponding card punching group are found out according to the matching degree of the card punching groups and the selectable shifts, and before the employee scheduling list of the employee to be scheduled is generated, the method further comprises:
and determining the respective attributive dates of all the card punching groups according to the card punching states and the card punching times of the first card punching records of the card punching groups, wherein the card punching states comprise the current day starting state, the last day starting state and the next day starting state.
3. The dynamic scheduling method of claim 2, wherein the step of finding out a unique shift and a corresponding punch-out group of each date in the date range according to the matching degree of the punch-out group and the selectable shift to generate the employee scheduling list of the employee to be scheduled comprises the steps of:
if the selectable shifts exist in a single date in the preset date range, selecting one shift which is most matched with the card punching group corresponding to the single date from all the selectable shifts in the single date as the shift of the single date;
if the optional shift does not exist in the preset date within the preset date range, recording that the preset date is not scheduled;
and generating an employee scheduling list of the employee to be scheduled according to the scheduling condition.
4. The dynamic scheduling method of claim 3, wherein the selecting, as the single-date scheduling, one of all the selectable shifts within the single date that most matches the punch-card group corresponding to the single date comprises:
when the single date has the corresponding punch card group, selecting one shift which is most matched with the punch card group corresponding to the single date from all the selectable shifts in the single date as the shift of the single date;
and when the single date does not have the corresponding card punching group, randomly selecting one shift from all the selectable shifts in the single date as the shift of the single date.
5. The dynamic scheduling method of claim 1, wherein the step of finding out a unique shift and a corresponding punch-down group of each date in the date range according to the matching degree of the punch-down group and the selectable shift to generate the employee scheduling list of the employee to be scheduled comprises:
and selecting one shift which is most matched with the card punching group corresponding to the single date from all the selectable shifts in the single date based on an optimal matching method, and taking the selected shift as the shift of the single date to generate an employee shift list of the employee to be shifted.
6. A dynamic shift arrangement device, comprising:
the system comprises an acquisition module, a storage module and a display module, wherein the acquisition module is used for acquiring a card punching sequence and an optional shift of staff to be scheduled within a preset date range, the card punching sequence is composed of all card punching records of the staff to be scheduled every day, and the card punching records comprise a card punching record identifier, a staff identifier, a card punching time and a card punching state;
the grouping module is used for grouping the card punching sequences to obtain a plurality of card punching groups;
and the shift distribution module is used for finding out the unique shift of each date in the date range and the corresponding card punching group according to the matching degree of the card punching group and the selectable shift, and generating an employee shift list of the employee to be shifted.
7. The dynamic scheduling apparatus of claim 6, further comprising:
and the matching module is used for determining the dates to which all the card punching groups belong according to the card punching states and the card punching times of the first card punching records of the card punching groups, wherein the card punching states comprise the current day starting state, the previous day starting state and the next day starting state.
8. The dynamic scheduling apparatus of claim 7, wherein the shift allocation module is specifically configured to:
if the selectable shifts exist in a single date in the preset date range, selecting one shift which is most matched with the card punching group corresponding to the single date from all the selectable shifts in the single date as the shift of the single date;
if the optional shift does not exist in the preset date within the preset date range, recording that the preset date is not scheduled;
and generating an employee scheduling list of the employee to be scheduled according to the scheduling condition.
9. A dynamic shift arrangement apparatus, comprising a processor and a memory:
the memory is used for storing program codes and transmitting the program codes to the processor;
the processor is configured to execute the dynamic scheduling method of any one of claims 1-5 according to instructions in the program code.
10. A computer-readable storage medium for storing program code for performing the dynamic shift scheduling method of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046884.3A CN110807618A (en) | 2019-10-30 | 2019-10-30 | Dynamic scheduling method, device and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046884.3A CN110807618A (en) | 2019-10-30 | 2019-10-30 | Dynamic scheduling method, device and equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110807618A true CN110807618A (en) | 2020-02-18 |
Family
ID=69489587
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911046884.3A Pending CN110807618A (en) | 2019-10-30 | 2019-10-30 | Dynamic scheduling method, device and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110807618A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111882218A (en) * | 2020-07-28 | 2020-11-03 | 四川大学华西医院 | Scheduling and attendance checking method based on VBA and C # |
| CN111932116A (en) * | 2020-08-10 | 2020-11-13 | 西安忒亚电子科技有限公司 | Controller fairness scheduling method based on control requirements |
| CN114333095A (en) * | 2021-12-31 | 2022-04-12 | 新开普电子股份有限公司 | Attendance checking method and attendance checking system for non-fixed shift |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101236666A (en) * | 2008-02-22 | 2008-08-06 | 金蝶软件（中国）有限公司 | Brushing card data processing system and method |
| CN101436316A (en) * | 2008-12-04 | 2009-05-20 | 金蝶软件（中国）有限公司 | Method and system for filtering work attendance data |
| CN104281932A (en) * | 2014-10-28 | 2015-01-14 | 用友优普信息技术有限公司 | Intelligent shift acquisition device and method |
| CN105488659A (en) * | 2015-11-26 | 2016-04-13 | 江苏方天电力技术有限公司 | Centralized attendance checking and intelligent staff shift arrangement management method |
| WO2016169259A1 (en) * | 2015-04-24 | 2016-10-27 | 凯拔（中国）科技有限公司 | Method for normalizing attendance original data and shift data in attendance computation |
| CN106529144A (en) * | 2016-10-27 | 2017-03-22 | 上海览海在线健康管理有限公司 | Method and system for intelligent scheduling in online medical process |
-
2019
- 2019-10-30 CN CN201911046884.3A patent/CN110807618A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101236666A (en) * | 2008-02-22 | 2008-08-06 | 金蝶软件（中国）有限公司 | Brushing card data processing system and method |
| CN101436316A (en) * | 2008-12-04 | 2009-05-20 | 金蝶软件（中国）有限公司 | Method and system for filtering work attendance data |
| CN104281932A (en) * | 2014-10-28 | 2015-01-14 | 用友优普信息技术有限公司 | Intelligent shift acquisition device and method |
| WO2016169259A1 (en) * | 2015-04-24 | 2016-10-27 | 凯拔（中国）科技有限公司 | Method for normalizing attendance original data and shift data in attendance computation |
| CN105488659A (en) * | 2015-11-26 | 2016-04-13 | 江苏方天电力技术有限公司 | Centralized attendance checking and intelligent staff shift arrangement management method |
| CN106529144A (en) * | 2016-10-27 | 2017-03-22 | 上海览海在线健康管理有限公司 | Method and system for intelligent scheduling in online medical process |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111882218A (en) * | 2020-07-28 | 2020-11-03 | 四川大学华西医院 | Scheduling and attendance checking method based on VBA and C # |
| CN111882218B (en) * | 2020-07-28 | 2024-03-05 | 四川大学华西医院 | Scheduling attendance checking method based on VBA and C# |
| CN111932116A (en) * | 2020-08-10 | 2020-11-13 | 西安忒亚电子科技有限公司 | Controller fairness scheduling method based on control requirements |
| CN111932116B (en) * | 2020-08-10 | 2023-09-29 | 西安忒亚电子科技有限公司 | Control requirement-based controller fairness scheduling method |
| CN114333095A (en) * | 2021-12-31 | 2022-04-12 | 新开普电子股份有限公司 | Attendance checking method and attendance checking system for non-fixed shift |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110807618A (en) | Dynamic scheduling method, device and equipment | |
| CN104580284B (en) | Traffic assignments device and method for distributing business | |
| CN111858055B (en) | Task processing method, server and storage medium | |
| CN103810045B (en) | Resource allocation methods, explorer, Resource Server and system | |
| CN109409763B (en) | Dynamic test task scheduling method and scheduling platform based on greedy grouping strategy | |
| CN108183933A (en) | Information push method, apparatus and system, electronic equipment and computer storage media | |
| CN103365708A (en) | Method and device for scheduling tasks | |
| CN109284895A (en) | Project task distribution method, device, computer equipment and storage medium | |
| CN112333342B (en) | Intelligent voice calling method, device, equipment and storage medium | |
| CN113204598A (en) | Data synchronization method, system and storage medium | |
| CN111507608A (en) | Work order early warning method and device and storage medium | |
| CN114757639A (en) | Data processing method, device, equipment and storage medium | |
| CN112232713A (en) | Information processing method, device and storage medium | |
| CN113205370B (en) | Data processing method, data processing device and electronic equipment | |
| CN110532114B (en) | Timed task management system and distribution method based on message queue | |
| CN117078208A (en) | Project management system of intelligent environment-friendly supervision platform | |
| CN116629826A (en) | Scheduling method, device, equipment and storage medium | |
| CN110796353A (en) | Scheduling processing method and device | |
| CN114840586A (en) | Data conversion method, equipment, server and computer readable storage medium | |
| CN113902350A (en) | Scheduling method and device and computer readable storage medium | |
| CN111613312B (en) | Equipment operation condition comparison analysis method and device | |
| CN110852700A (en) | Data sorting method and device for workflow system | |
| CN109919470B (en) | Method and device for distributing customer information | |
| CN111552561B (en) | Task processing method and device | |
| CN114035910B (en) | Double-parallel machine scheduling method for shortening emergency response time |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: Room 1301, No.132, Fengqi Road, phase III, software park, Xiamen City, Fujian Province Applicant after: Xiamen Entropy Technology Co.,Ltd. Address before: 361000, Xiamen three software park, Fujian Province, 8 North Street, room 2001 Applicant before: XIAMEN ZKTECO INFORMATION TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200218 |
|
| RJ01 | Rejection of invention patent application after publication |