CN116307643B - Scheduling method and device, electronic equipment and storage medium - Google Patents

Scheduling method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN116307643B
CN116307643B CN202310565857.7A CN202310565857A CN116307643B CN 116307643 B CN116307643 B CN 116307643B CN 202310565857 A CN202310565857 A CN 202310565857A CN 116307643 B CN116307643 B CN 116307643B
Authority
CN
China
Prior art keywords
shift
scheduling
matrix
change
staff
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.)
Active
Application number
CN202310565857.7A
Other languages
Chinese (zh)
Other versions
CN116307643A (en
Inventor
唐政江
陈捷
向飞
倪佳
肖文海
汪小琳
卢锐
吕晗殊
陈果
方锐
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Minhang Chengdu Information Technology Co ltd
Second Research Institute of CAAC
Original Assignee
Minhang Chengdu Information Technology Co ltd
Second Research Institute of CAAC
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Minhang Chengdu Information Technology Co ltd, Second Research Institute of CAAC filed Critical Minhang Chengdu Information Technology Co ltd
Priority to CN202310565857.7A priority Critical patent/CN116307643B/en
Publication of CN116307643A publication Critical patent/CN116307643A/en
Application granted granted Critical
Publication of CN116307643B publication Critical patent/CN116307643B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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
    • G06Q10/1097—Task assignment
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a scheduling method, a device, electronic equipment and a storage medium, wherein a scheduling requirement is acquired, a target limiting rule corresponding to the scheduling requirement is determined, and a scheduling limiting function is constructed according to the target limiting rule; determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record; according to a change rule, constructing a shift order change matrix, wherein elements in the shift order change matrix represent shift order change values of shift orders of the same staff in adjacent shift periods; determining the working time length of staff corresponding to each shift, and constructing a working time length matrix; and fusing the shift-in time length matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of a shift limiting function based on the current shift order of staff. The scheduling efficiency can be improved, and the scheduling scheme has higher rationality.

Description

Scheduling method and device, electronic equipment and storage medium
Technical Field
The disclosure relates to the technical field of computers, and in particular relates to a scheduling method, a scheduling device, electronic equipment and a storage medium.
Background
In the current work scheduling process of enterprise personnel, the work scheduling personnel are often adopted to schedule the personnel needing to be scheduled through Excel and other tools according to historical experience, and as the situation of the personnel performing the work scheduling is complex, various variable factors such as personnel leave, personnel physical conditions, personnel working time, personnel rotation and the like exist. During actual scheduling, due to the limitations of the traditional scheduling modes, namely: excel arrangement and papery recording can have the problems that effective management on personnel rotation is lacking, personnel scheduling efficiency is low, and scheduling scheme rationality is poor.
Disclosure of Invention
The embodiment of the application provides a scheduling method, a device, electronic equipment and a storage medium, and has the beneficial effects that: the scheduling efficiency can be improved, and the scheduling scheme has higher rationality.
The embodiment of the disclosure provides a scheduling method, which comprises the following steps:
acquiring a scheduling requirement, determining a target limiting rule corresponding to the scheduling requirement, and constructing a scheduling limiting function according to the target limiting rule;
determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record;
According to the change rule, constructing a shift level change matrix, wherein elements in the shift level change matrix represent shift level change values of the shift level of the same staff in adjacent shift periods;
determining the working time length of staff corresponding to each shift, and constructing a working time length matrix;
and fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff.
In an alternative embodiment, the shift limit function includes:
a work time limit function for limiting the work time of the staff to be less than or equal to a preset day value, zhou Shuzhi and month value;
a shift change limiting function for limiting that the number of shift change values of staff in adjacent shift cycles is smaller than or equal to the total number of staff corresponding to shifts;
a time length difference limiting function for limiting that the time length difference between the working time lengths of different staff is smaller than or equal to a preset difference threshold;
and the step length limiting function is used for limiting the step length changing value corresponding to each shift of staff in the shift period to be smaller than or equal to the total number of staff.
In an alternative embodiment, after the step of fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift order using the shift prediction matrix under the constraint of the shift restriction function based on the current shift order of the staff member, the method further includes:
determining whether the target shift scheme satisfies the shift change restriction function and the shift change step size restriction function;
if not, modifying the history scheduling record according to the shift change limiting function and the bit change step length limiting function;
and repeating the step of determining the history scheduling record, and determining the change rule of the scheduling orders of the same staff in the adjacent scheduling period according to the history scheduling record until the target scheduling scheme meets the shift change limiting function and the order change step length limiting function.
In an optional implementation manner, the determining a historical shift record, according to the historical shift record, determines a change rule of shift orders of the same employee in adjacent shift periods, and specifically includes:
for each employee, determining the shift ranking times corresponding to the employee in each shift period according to the history shift records;
Determining the rank change value corresponding to the rank of the same employee for every two adjacent shift cycles;
and constructing a rank deduction function between the ranking ranks and the rank change values according to all the rank change values, and determining the rank deduction function as a change rule of the ranking ranks for each employee.
In an alternative embodiment, the shift schedule prediction matrix is generated based on the following formula:
wherein ,representing the shift schedule prediction matrix; />Representing the shift order change matrix; m and n respectively represent the shift positions of the same staff in adjacent shift periods and the change value of the shift; />Representing a preset weight coefficient; />Representing elements in the shift time matrix; i represents a row of the matrix; j represents a column of the matrix.
In an alternative embodiment, after the step of fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift order using the shift prediction matrix under the constraint of the shift restriction function based on the current shift order of the staff member, the method further includes:
Checking the target scheduling scheme according to the scheduling limit function;
and screening target shift orders which do not accord with the shift limiting function in the target shift scheme, and configuring early warning identifications corresponding to the limiting types of the shift limiting function for the target shift orders.
The embodiment of the disclosure also provides a shift arrangement device, which comprises:
the system comprises a scheduling restriction function construction module, a scheduling restriction function generation module and a scheduling restriction function generation module, wherein the scheduling restriction function construction module is used for acquiring scheduling requirements, determining target restriction rules corresponding to the scheduling requirements and constructing a scheduling restriction function according to the target restriction rules;
the change rule determining module is used for determining a historical shift record, and determining the change rule of shift orders of the same staff in adjacent shift periods according to the historical shift record;
the first matrix construction module is used for constructing a shift order change matrix according to the change rule, wherein elements in the shift order change matrix represent shift order change values of the shift orders of the same staff in adjacent shift periods;
the second matrix construction module is used for determining the working time length of the staff corresponding to each shift and constructing a working time length matrix;
The shift generation module is used for fusing the shift-on time length matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff.
The embodiment of the disclosure also provides an electronic device, including: a processor, a memory and a bus, the memory storing machine readable instructions executable by the processor, the processor and the memory in communication via the bus when the electronic device is running, the machine readable instructions when executed by the processor performing the scheduling method described above, or steps in any one of the possible embodiments of the scheduling method described above.
The disclosed embodiments also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the above-described shift method, or steps in any one of the possible implementation manners of the above-described shift method.
The disclosed embodiments also provide a computer program product comprising a computer program/instructions which, when executed by a processor, implement the above-described scheduling method, or steps in any one of the possible implementation manners of the above-described scheduling method.
According to the scheduling method provided by the embodiment of the disclosure, the target limiting rule corresponding to the scheduling requirement is determined by acquiring the scheduling requirement, and the scheduling limiting function is constructed according to the target limiting rule; determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record; according to the change rule, constructing a shift level change matrix, wherein elements in the shift level change matrix represent shift level change values of the shift level of the same staff in adjacent shift periods; determining the working time length of staff corresponding to each shift, and constructing a working time length matrix; and fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff. The scheduling efficiency can be improved, and the scheduling scheme has higher rationality.
The foregoing objects, features and advantages of the disclosure will be more readily apparent from the following detailed description of the preferred embodiments taken in conjunction with the accompanying drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for the embodiments are briefly described below, which are incorporated in and constitute a part of the specification, these drawings showing embodiments consistent with the present disclosure and together with the description serve to illustrate the technical solutions of the present disclosure. It is to be understood that the following drawings illustrate only certain embodiments of the present disclosure and are therefore not to be considered limiting of its scope, for the person of ordinary skill in the art may admit to other equally relevant drawings without inventive effort.
FIG. 1 illustrates a flow chart of a scheduling method provided by an embodiment of the present disclosure;
FIG. 2 illustrates a flow chart of another scheduling method provided by embodiments of the present disclosure;
FIG. 3 illustrates a schematic diagram of a shift arrangement provided by an embodiment of the present disclosure;
fig. 4 shows a schematic diagram of an electronic device provided by an embodiment of the disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, but not all embodiments. The components of the embodiments of the present disclosure, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present disclosure provided in the accompanying drawings is not intended to limit the scope of the disclosure, as claimed, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be made by those skilled in the art based on the embodiments of this disclosure without making any inventive effort, are intended to be within the scope of this disclosure.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
The term "and/or" is used herein to describe only one relationship, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist together, and B exists alone. In addition, the term "at least one" herein means any one of a plurality or any combination of at least two of a plurality, for example, including at least one of A, B, C, and may mean including any one or more elements selected from the group consisting of A, B and C.
According to the research, in the current work scheduling process of enterprise personnel, the work scheduling personnel are often adopted to schedule the personnel needing to be scheduled through Excel and other tools according to the history experience, and as the situation of the personnel performing the work scheduling is complex, various variable factors such as personnel leave, personnel physical conditions, personnel working time, personnel rotation and the like exist. During actual scheduling, due to the limitations of the traditional scheduling modes, namely: excel arrangement and papery recording can have the problems that effective management on personnel rotation is lacking, personnel scheduling efficiency is low, and scheduling scheme rationality is poor.
Based on the above study, the disclosure provides a scheduling method, a device, an electronic device and a storage medium, wherein a scheduling requirement is obtained to determine a target limit rule corresponding to the scheduling requirement, and a scheduling limit function is constructed according to the target limit rule; determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record; according to the change rule, constructing a shift level change matrix, wherein elements in the shift level change matrix represent shift level change values of the shift level of the same staff in adjacent shift periods; determining the working time length of staff corresponding to each shift, and constructing a working time length matrix; and fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff. The scheduling efficiency can be improved, and the scheduling scheme has higher rationality.
For the sake of understanding the present embodiment, first, a shift scheduling method disclosed in the embodiments of the present disclosure will be described in detail, where an execution subject of the shift scheduling method provided in the embodiments of the present disclosure is generally a computer device having a certain computing capability, and the computer device includes, for example: the terminal device, or server or other processing device, may be a User Equipment (UE), mobile device, user terminal, cellular telephone, cordless telephone, personal digital assistant (Personal Digital Assistant, PDA), handheld device, computing device, vehicle mounted device, wearable device, etc. In some possible implementations, the scheduling method may be implemented by way of a processor invoking computer readable instructions stored in a memory.
Referring to fig. 1, a flowchart of a scheduling method according to an embodiment of the disclosure is shown, where the method includes steps S101 to S105, where:
s101, acquiring a scheduling requirement, determining a target limiting rule corresponding to the scheduling requirement, and constructing a scheduling limiting function according to the target limiting rule.
In specific implementation, firstly, a scheduling requirement corresponding to a typesetting process and a target limiting rule corresponding to the scheduling requirement are determined, and the target limiting rule is converted into a scheduling limiting function.
Here, the scheduling requirements may include: the number of staff needed to carry out the shift; whether to distinguish between different shifts, for example: shift, night shift, etc.; the shift cycle corresponding to each shift, for example: first-break, second-break, etc.; the maximum working time of each employee in a scheduling period; within the workflow, each employee's maximum number of days to work, weeks, months, etc.
It should be noted that the scheduling requirements may be set according to actual requirements, and are not particularly limited herein.
Wherein the target constraint rule corresponds to a scheduling requirement and is used for representing constraint conditions for a scheduling result, for example: the same employee can only appear once in the same shift; the generated shift cycle must be equal to the parameters given in the shift demand; the scheduling result of staff in the scheduling cannot exceed the limit of the maximum working time of the day, week and month; the scroll step of the staff in a single shift cannot exceed half the total number of people in the shift, etc.
Further, the shift limit function may include: a shift time limit function, a shift change limit function, a time difference limit function, and a shift change step size limit function.
Here, the working time limit function is used for limiting the working time of the staff to be less than or equal to a preset day value, zhou Shuzhi and month value. A shift change limiting function for limiting that the number of shift change values of staff in adjacent shift cycles is smaller than or equal to the total number of staff corresponding to shifts; a time length difference limiting function for limiting that the time length difference between the working time lengths of different staff is smaller than or equal to a preset difference threshold; and the step length limiting function is used for limiting the step length changing value corresponding to each shift of staff in the shift period to be smaller than or equal to the total number of staff.
It should be noted that the preset day value, zhou Shuzhi and month value, and the preset difference threshold may be selected according to actual needs, which is not limited herein.
S102, determining a history scheduling record, and determining the change rule of the scheduling orders of the same staff in the adjacent scheduling period according to the history scheduling record.
In specific implementation, a history scheduling record of completing scheduling before the current moment is obtained, preferably, the history scheduling record of the last two scheduling periods can be selected, and a change rule corresponding to the change of the scheduling level of the same staff in the adjacent two scheduling periods is aimed at in the history scheduling record.
Here, since the staff of different groups have different requirements on the working time, the staff can be classified according to the post types of the staff first, and the following corresponding relation is generated:
wherein S represents a set of S employees in number; s represents the total number of staff; m represents g classification results possibly generated after classification; g represents the number of classification results;representing the total number of people in the first classification result; />Representing the total number of people in the g-th classification result; />Representing a correspondence function.
Further, the change rule of the shift number of the same staff in the adjacent shift period can be determined through the following steps 1-3:
step 1, aiming at each staff, determining the scheduling order corresponding to the staff in each scheduling period according to the history scheduling record.
And step 2, determining the rank change value corresponding to the rank of the same staff for every two adjacent shift periods.
And 3, constructing a rank deduction function between the ranking rank and the rank change value according to all the rank change values, and determining the rank deduction function as a change rule of the ranking rank for each employee.
Here, the bit-order deduction function may be expressed as follows:
,/>
f represents the scheduling order of staff in the history scheduling record;representing a set of s employees; s represents the total number of staff; />Representing a change rule corresponding to the change of the shift level of the same staff in two adjacent shift periods; u represents a row of the matrix; i represents a shift sequence number; j represents a shift number; l represents a column of the matrix; k represents the staff currently participating in the shift.
S103, constructing a shift order change matrix according to the change rule, wherein elements in the shift order change matrix represent shift order change values of the shift orders of the same staff in adjacent shift periods.
In the implementation, according to the change rule in the history shift record of the shift change value corresponding to the shift of the same staff in two adjacent shift periods, a shift change matrix reflecting the shift change value of the shift of the same staff in the adjacent shift periods is constructed.
It should be noted that the shift level change matrix needs to satisfy the following constraint:
wherein ,representing a shift level change matrix; i represents a shift sequence number; />Representing different positions of the sequence number of the shift after one period; j represents a shift number; />A shift number representing a change of staff after a shift cycle; />Representing the change value of a cycle shift.
Further, the shift level change matrix needs to satisfy the following constraint:
wherein ,the corresponding working time length of the staff at the ith shift number and at the j shift number,the method comprises the steps of carrying out a first treatment on the surface of the D represents a set containing the length of time for all employees to work.
S104, determining the working time length of the staff corresponding to each shift, and constructing a working time length matrix.
In specific implementation, a shift-in duration matrix of shift-in duration is established according to shift-in duration corresponding to the shift-in shift of the staff.
Here, in the on-duty time length matrix, the rows of the matrix represent the on-duty shifts, the columns represent the on-duty time lengths corresponding to the on-duty shifts of the staff, and the elements in the on-duty time length matrix represent the values of the on-duty time lengths corresponding to the on-duty shifts of the staff.
And S105, fusing the shift-in duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of the staff.
In specific implementation, the shift-on duration matrix and the shift-on order change matrix are fused to generate a shift prediction matrix, the shift prediction matrix can represent shift order change conditions of all staff in two adjacent shift periods during the shift period, and further the shift prediction matrix is adopted to process according to the shift order of the staff in the current shift period so as to determine the shift order of the staff in the next shift period, and a final target shift scheme can be generated after all staff are processed.
Here, the shift schedule prediction matrix may be generated based on the following formula:
wherein ,representing the shift schedule prediction matrix; />Representing the shift order change matrix; m and n respectively represent the shift positions and shift change values of the same staff in adjacent shift periods; />Representing a preset weight coefficient;representing elements in the shift time matrix; i represents a row of the matrix; j represents a column of the matrix.
As a possible implementation manner, after step S105, for the predicted target shift scheme, a shift change restriction function and a shift change step size restriction function are adopted for verification, if the target shift scheme violates the restrictions of the shift change restriction function and the shift change step size restriction function, the previous shift period is traced back, and the shift scheme for the previous shift period is optimized until the target shift scheme meets the restrictions of the shift change restriction function and the shift change step size restriction function.
Specifically, the above possible embodiments may be implemented by the following steps 1 to 3:
and step 1, determining whether the target scheduling scheme meets the shift change limiting function and the level change step size limiting function.
And step 2, if the historical shift record is not satisfied, modifying the historical shift record according to the shift change limiting function and the bit change step length limiting function.
And step 3, repeating the step of determining the history scheduling record, and determining the change rule of the scheduling orders of the same staff in the adjacent scheduling period according to the history scheduling record until the target scheduling scheme meets the shift change limiting function and the order change step length limiting function.
Here, after checking with the shift change restriction function and the bit change step size restriction function, the following situations may also occur in the target shift arrangement scheme: 1. the staff involved in the scheduling exceeds the maximum computational range of a single shift. 2. The maximum calculated range for a single shift exceeds the actual number of people for that shift.
Further, for the two cases, if there is no change in the shift orders of the staff members of the two shift periods, the staff members should also change when the next shift period is calculated. If there is a change in the shift levels of the staff members of the two shift periods and there is a change in the shift level of each staff member, then such a change needs to satisfy the following constraint:
wherein ,yk+m The shift level change step length of the staff k currently participating in shift in the next period is represented; y is k The shift level change step length of the staff k currently participating in shift in the current period is represented; s represents a set of S employees in number; s represents the total number of employees.
As a possible implementation manner, the target scheduling scheme may be further checked according to the on-duty time length limit function and the on-duty time length difference limit function, and the scheduling violating the on-duty time length limit function and the on-duty time length difference limit function may be marked.
As another possible implementation manner, when the method is applied to a scheduling scene of a civil aviation airport ground service assurance personnel, the following factors are also considered in constructing a scheduling prediction matrix: the number of tasks is ensured to be smaller than the number of all resources, namely, the number of flights is smaller than the number of available personnel, and virtual flights need to be supplemented at the moment so that the personnel and the flights are balanced; and judging the conflict between the preset relation and time, wherein due to the conflict between the front flights and the rear flights in the guarantee time, certain personnel participating in the front flights cannot participate in the guarantee process of the flights, and the parameters in the scheduling prediction matrix need to be set to be special values, wherein the special values can be infinite.
Specifically, an sxs matrix is first establishedAnd matrix element->The following expression should be satisfied:
wherein ,representative staff->To the shift position point->Is a distance of (2); m represents the number of flights; set B represents the set of staff being serviced, and k represents the staff currently participating in the shift; s represents the total number of employees.
After this, the following steps 1 to 7 may also be performed:
step 1, under the limitation of a shift change limiting function, a shift priority matrix is established according to staff workload, wherein the matrix is an sx1 matrixS represents the total number of employees, < >>Representing the ith element in the shift priority matrix Q.
Step 2, performing the scheduling priority matrix established by the matrix A and the step 1Fusion to form benefit matrix, wherein ,/>，/>Representing a preset weight coefficient, +.>Represents the ith element in the scheduling priority matrix,/->Representing elements in the benefit matrix +_>Representing the elements in the ith row and jth column of the matrix a constructed as described above.
Step 3, slave benefit matrixSubtracting the smallest element of each row from that row so that each row has a zero element, resulting in a matrix +.>。
Step 4, slave matrixSubtracting the smallest element of each column from each column so that each column has a zero element, resulting in a matrix 。
Step 5, covering with least straight linesThe zero elements in (1) get the matrix->If the number of lines is the smallestEqual to s, go to step 7, otherwise go to step 6.
Step 6, matrixSubtracting the smallest element from all elements not covered by the straight line, and adding the smallest element at the intersection point of the straight line to obtain a matrix +.>Let->=/>Go to step 5.
And 7, starting assignment from the row or column with the least zero elements until all tasks are assigned, and obtaining an optimal assignment scheme.
Further, processing the data in the next scheduling segment, if in the segment, the segment can not be successfully scheduled by staff due to the distribution of the previous segment, and the scheduling result of the previous segment is reasonably adjusted by backtracking to the previous segment, so that the segment has schedulable people during staff scheduling.
Here, if no schedulable person is adjusted, i.e. a virtual person is added in the segment, the virtual person is the person needing external adjustment, and when no available person is externally adjusted, i.e. when the maximum number of conflicts is greater than the number of schedulable groups, the corresponding adjustment scheme includes: scheme 1, adjusting the guarantee time of flights. And 2, adjusting the guarantee sequence of flights.
For scheme 1, this concept is not generally adopted in the actual operation of the airport, mainly because an unstable factor is formed for aviation security. Airports generally employ the solution idea of scheme 2. Therefore, preprocessing is required for the flight guarantee order.
Here, the preprocessing process needs to build the following model: giving one flight needing to adjust the flight guarantee sequenceL represents the total number of flights, and due to employee deficiency, a partial flight delay must be caused, so the aim is achieved: the flight guarantee has the least total delay time and the least number of delayed flights.
Wherein, the parameters are defined as follows: y represents the number of virtual persons to be added in the segment, namely the number of people required for ensuring the flight of the segment to be successfully ensured;for 1 time, representing flight h as guaranteed delayed flight, +.>L represents a set of total number of flights, +.>Other states are represented in time 0; />-time indicating that flight h guarantee is delayed, < ->=1，/><Delta, wherein delta is a preset limit threshold; />Indicating the number of guaranteed staff needed for flight h, +.>。
Further, the mathematical model may be expressed as:
here, since this problem is a multi-objective problem, it is necessary to build a multi-objective model:
wherein ,=1; w1 and W2 are preset weights, which can be preconfigured by an administrator of the airport; />Representing a multi-objective model; />Representing the number of guaranteed staff needed by the flight h; y represents the number of virtual persons to be added to the segment, i.e. the number of people required to ensure the flight of the segment to be successfully guaranteed.
Furthermore, based on the steps, the optimal employee assignment result of civil aviation airport ground service guarantee employee scheduling and the corresponding relationship between the number of people and time can be obtained:
wherein t represents time;representing staff needed by the occasion guarantee requirement at time t; s represents a set of S employees in number; s represents the total number of staff; />Representing the total head-on demand for a shift.
Further, according to the target scheduling scheme obtained in step S105, a correspondence relationship between the current attendance scheduling number and time is formed:
wherein t represents time;representing the actual shift result at time t; s represents a set of S employees in number; s represents the total number of staff; />Representing the current attendance scheduling.
If it isAn employee shortage early warning is sent out, and the employee needs to be borrowed.
According to the scheduling method provided by the embodiment of the disclosure, the target limiting rule corresponding to the scheduling requirement is determined by acquiring the scheduling requirement, and the scheduling limiting function is constructed according to the target limiting rule; determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record; according to the change rule, constructing a shift level change matrix, wherein elements in the shift level change matrix represent shift level change values of the shift level of the same staff in adjacent shift periods; determining the working time length of staff corresponding to each shift, and constructing a working time length matrix; and fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff. The scheduling efficiency can be improved, and the scheduling scheme has higher rationality.
Referring to fig. 2, a flowchart of another scheduling method according to an embodiment of the disclosure is shown, where the method includes steps S201 to S206, where:
s201, acquiring a scheduling requirement, determining a target limit rule corresponding to the scheduling requirement, and constructing a scheduling limit function according to the target limit rule;
s202, determining a history scheduling record, and determining the change rule of the scheduling orders of the same staff in the adjacent scheduling period according to the history scheduling record.
S203, constructing a shift order change matrix according to the change rule, wherein elements in the shift order change matrix represent shift order change values of the shift orders of the same staff in adjacent shift periods.
S204, determining the working time length of the staff corresponding to each shift, and constructing a working time length matrix.
And S205, fusing the shift-in duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of the staff.
Here, the steps S201 to S205 are substantially the same as the steps S101 to S105, and have the same implementation manner and can achieve the same technical effects, and will not be described in detail.
S206, checking the target scheduling scheme according to the scheduling limit function; and screening target shift orders which do not accord with the shift limiting function in the target shift scheme, and configuring early warning identifications corresponding to the limiting types of the shift limiting function for the target shift orders.
In a specific implementation, firstly, statistics is performed on a target scheduling scheme according to an employee perspective, and the corresponding statistical result can be expressed as:
wherein ,staff representing the current participation in the shift schedule +.>In shift +.>If it is on duty, it is 1, and it is not 0.Staff representing the current participation in the shift schedule +.>In shift +.>Is in duty, is admissible>And carrying out statistics on corresponding statistics results according to the view angles of staff k currently participating in the scheduling by the representative target scheduling scheme.
Further, the target scheduling scheme is checked sequentially by adopting a shift time limit function, a shift change limit function and a time difference limit function.
And counting the target scheduling scheme according to the day, week and month aiming at the time limit function of the working hours, and carrying out early warning on the overlarge working hours on the related result exceeding the time limit. And counting the change condition of the shift orders of the staff aiming at the shift change limiting function, and if the change value of the shift orders of the current shift order minus the last shift order is larger than a threshold value, carrying out shift change overlarge early warning marking on the shift of the current shift exceeding the threshold value. And counting the average working time of all staff aiming at the time difference limiting function, calculating variance according to the average working time of each staff, and marking the result exceeding the threshold value with overlarge working time difference by the quotient of the total working time and the total number of people.
According to the scheduling method provided by the embodiment of the disclosure, the target limiting rule corresponding to the scheduling requirement is determined by acquiring the scheduling requirement, and the scheduling limiting function is constructed according to the target limiting rule; determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record; according to the change rule, constructing a shift level change matrix, wherein elements in the shift level change matrix represent shift level change values of the shift level of the same staff in adjacent shift periods; determining the working time length of staff corresponding to each shift, and constructing a working time length matrix; and fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff. The scheduling efficiency can be improved, and the scheduling scheme has higher rationality.
It will be appreciated by those skilled in the art that in the above-described method of the specific embodiments, the written order of steps is not meant to imply a strict order of execution but rather should be construed according to the function and possibly inherent logic of the steps.
Based on the same inventive concept, the embodiment of the disclosure further provides a scheduling device corresponding to the scheduling method, and since the principle of solving the problem by the device in the embodiment of the disclosure is similar to that of the scheduling method in the embodiment of the disclosure, the implementation of the device can refer to the implementation of the method, and the repetition is omitted.
Referring to fig. 3, fig. 3 is a schematic diagram of a shift arrangement device according to an embodiment of the disclosure. As shown in fig. 3, the shift scheduling apparatus 300 provided in the embodiment of the present disclosure includes:
the scheduling restriction function construction module 310 is configured to obtain a scheduling requirement, determine a target restriction rule corresponding to the scheduling requirement, and construct a scheduling restriction function according to the target restriction rule.
The change rule determining module 320 is configured to determine a history scheduling record, and determine a change rule of the scheduling order of the same employee in an adjacent scheduling period according to the history scheduling record.
The first matrix construction module 330 is configured to construct a shift order change matrix according to the change rule, where elements in the shift order change matrix represent shift order change values of the shift orders of the same employee in adjacent shift periods.
The second matrix construction module 340 is configured to determine a shift-in duration of each shift corresponding to the employee, and construct a shift-in duration matrix.
The shift generation module 350 is configured to fuse the shift-on duration matrix with the shift order change matrix, generate a shift prediction matrix, and determine a target shift scheme by using the shift prediction matrix under the constraint of the shift restriction function based on the current shift order of the staff.
The process flow of each module in the apparatus and the interaction flow between the modules may be described with reference to the related descriptions in the above method embodiments, which are not described in detail herein.
According to the scheduling device provided by the embodiment of the disclosure, the target limiting rule corresponding to the scheduling requirement is determined by acquiring the scheduling requirement, and the scheduling limiting function is constructed according to the target limiting rule; determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record; according to the change rule, constructing a shift level change matrix, wherein elements in the shift level change matrix represent shift level change values of the shift level of the same staff in adjacent shift periods; determining the working time length of staff corresponding to each shift, and constructing a working time length matrix; and fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff. The scheduling efficiency can be improved, and the scheduling scheme has higher rationality.
Corresponding to the shift scheduling methods in fig. 1 and fig. 2, the embodiment of the disclosure further provides an electronic device 400, as shown in fig. 4, which is a schematic structural diagram of the electronic device 400 provided in the embodiment of the disclosure, including:
a processor 41, a memory 42, and a bus 43; memory 42 is used to store execution instructions, including memory 421 and external memory 422; the memory 421 is also referred to as an internal memory, and is used for temporarily storing operation data in the processor 41 and data exchanged with the external memory 422 such as a hard disk, and the processor 41 exchanges data with the external memory 422 through the memory 421, and when the electronic device 400 is operated, the processor 41 and the memory 42 communicate with each other through the bus 43, so that the processor 41 performs steps of the scheduling method in fig. 1 and 2.
The disclosed embodiments also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the scheduling method described in the method embodiments above. Wherein the storage medium may be a volatile or nonvolatile computer readable storage medium.
The embodiment of the disclosure further provides a computer program product, which includes computer instructions, where the computer instructions, when executed by a processor, may perform the steps of the scheduling method described in the above method embodiment, and specifically, reference the above method embodiment will not be described herein.
Wherein the above-mentioned computer program product may be realized in particular by means of hardware, software or a combination thereof. In an alternative embodiment, the computer program product is embodied as a computer storage medium, and in another alternative embodiment, the computer program product is embodied as a software product, such as a software development kit (Software Development Kit, SDK), or the like.
It will be clear to those skilled in the art that, for convenience and brevity of description, reference may be made to the corresponding process in the foregoing method embodiment for the specific working process of the apparatus described above, which is not described herein again. In the several embodiments provided in the present disclosure, it should be understood that the disclosed apparatus and method may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown 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 may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present disclosure may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on such understanding, the technical solution of the present disclosure may be embodied in essence or a part contributing to the prior art or a part of the technical solution, or in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present disclosure. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present disclosure, and are not intended to limit the scope of the disclosure, but the present disclosure is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, it is not limited to the disclosure: any person skilled in the art, within the technical scope of the disclosure of the present disclosure, may modify or easily conceive changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features thereof; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the disclosure, and are intended to be included within the scope of the present disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.

Claims (9)

1. A method of scheduling shifts, comprising:
acquiring a scheduling requirement, determining a target limiting rule corresponding to the scheduling requirement, and constructing a scheduling limiting function according to the target limiting rule;
determining a historical scheduling record, and determining a change rule of scheduling orders of the same staff in adjacent scheduling periods according to the historical scheduling record;
According to the change rule, constructing a shift level change matrix, wherein elements in the shift level change matrix represent shift level change values of the shift level of the same staff in adjacent shift periods;
determining the working time length of staff corresponding to each shift, and constructing a working time length matrix;
fusing the shift-on duration matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff;
generating the shift schedule prediction matrix based on the following formula:
wherein ,representing the shift schedule prediction matrix; />Representing the shift order change matrix; m and n respectively represent the shift positions of the same staff in adjacent shift periods and the change value of the shift; />Representing a preset weight coefficient;representing elements in the shift time matrix; i represents a row of the matrix; j represents a column of the matrix.
2. The method of claim 1, wherein the shift limit function comprises:
a work time limit function for limiting the work time of the staff to be less than or equal to a preset day value, zhou Shuzhi and month value;
A shift change limiting function for limiting that the number of shift change values of staff in adjacent shift cycles is smaller than or equal to the total number of staff corresponding to shifts;
a time length difference limiting function for limiting that the time length difference between the working time lengths of different staff is smaller than or equal to a preset difference threshold;
and the step length limiting function is used for limiting the step length changing value corresponding to each shift of staff in the shift period to be smaller than or equal to the total number of staff.
3. The method of claim 2, wherein after said fusing the shift-in duration matrix with the shift order change matrix to generate a shift prediction matrix, determining a target shift using the shift prediction matrix based on the current shift order of the employee under the constraint of the shift restriction function, the method further comprises:
determining whether the target shift scheme satisfies the shift change restriction function and the shift change step size restriction function;
if not, modifying the history scheduling record according to the shift change limiting function and the bit change step length limiting function;
And repeating the step of determining the history scheduling record, and determining the change rule of the scheduling orders of the same staff in the adjacent scheduling period according to the history scheduling record until the target scheduling scheme meets the shift change limiting function and the order change step length limiting function.
4. The method according to claim 1, wherein the determining the historical shift record, according to the historical shift record, determines a change rule of shift orders of the same employee in adjacent shift periods, specifically includes:
for each employee, determining the shift ranking times corresponding to the employee in each shift period according to the history shift records;
determining the rank change value corresponding to the rank of the same employee for every two adjacent shift cycles;
and constructing a rank deduction function between the ranking ranks and the rank change values according to all the rank change values, and determining the rank deduction function as a change rule of the ranking ranks for each employee.
5. The method of claim 1, wherein after said fusing the shift-in duration matrix with the shift order change matrix to generate a shift prediction matrix, determining a target shift using the shift prediction matrix based on the current shift order of the employee under the constraint of the shift restriction function, the method further comprises:
Checking the target scheduling scheme according to the scheduling limit function;
and screening target shift orders which do not accord with the shift limiting function in the target shift scheme, and configuring early warning identifications corresponding to the limiting types of the shift limiting function for the target shift orders.
6. A shift scheduling device, the device comprising:
the system comprises a scheduling restriction function construction module, a scheduling restriction function generation module and a scheduling restriction function generation module, wherein the scheduling restriction function construction module is used for acquiring scheduling requirements, determining target restriction rules corresponding to the scheduling requirements and constructing a scheduling restriction function according to the target restriction rules;
the change rule determining module is used for determining a historical shift record, and determining the change rule of shift orders of the same staff in adjacent shift periods according to the historical shift record;
the first matrix construction module is used for constructing a shift order change matrix according to the change rule, wherein elements in the shift order change matrix represent shift order change values of the shift orders of the same staff in adjacent shift periods;
the second matrix construction module is used for determining the working time length of the staff corresponding to each shift and constructing a working time length matrix;
the shift generation module is used for fusing the shift-on time length matrix with the shift order change matrix to generate a shift prediction matrix, and determining a target shift scheme by adopting the shift prediction matrix under the constraint of the shift limiting function based on the current shift order of staff;
Generating the shift schedule prediction matrix based on the following formula:
wherein ,representing the shift schedule prediction matrix; />Representing the shift order change matrix; m, n represent the shift ranking and shift ranking times of the same staff in adjacent shift periods respectivelyA secondary change value; />Representing a preset weight coefficient;representing elements in the shift time matrix; i represents a row of the matrix; j represents a column of the matrix.
7. The apparatus of claim 6, wherein the apparatus is further configured to:
determining whether the target shift scheme meets a shift change limit function and a shift change step length limit function;
if not, modifying the history scheduling record according to the shift change limiting function and the bit change step length limiting function;
and repeating the step of determining the history scheduling record, and determining the change rule of the scheduling orders of the same staff in the adjacent scheduling period according to the history scheduling record until the target scheduling scheme meets the shift change limiting function and the order change step length limiting function.
8. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory in communication over the bus when the electronic device is running, the machine-readable instructions when executed by the processor performing the steps of the method of any one of claims 1 to 5.
9. A computer-readable storage medium, characterized in that it has stored thereon a computer program which, when executed by a processor, performs the steps of the method according to any of claims 1 to 5.
CN202310565857.7A 2023-05-19 2023-05-19 Scheduling method and device, electronic equipment and storage medium Active CN116307643B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310565857.7A CN116307643B (en) 2023-05-19 2023-05-19 Scheduling method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310565857.7A CN116307643B (en) 2023-05-19 2023-05-19 Scheduling method and device, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN116307643A CN116307643A (en) 2023-06-23
CN116307643B true CN116307643B (en) 2023-08-18

Family

ID=86826131

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310565857.7A Active CN116307643B (en) 2023-05-19 2023-05-19 Scheduling method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN116307643B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114154906A (en) * 2021-12-10 2022-03-08 厦门兆翔智能科技有限公司 Airport ground service intelligent scheduling method and system
CN115330195A (en) * 2022-08-12 2022-11-11 苏州盖雅信息技术有限公司 Periodic scheduling method and device, electronic equipment and storage medium
CN115660344A (en) * 2022-10-25 2023-01-31 平安银行股份有限公司 User scheduling method and device, electronic equipment and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016035336A1 (en) * 2014-09-03 2016-03-10 日本電気株式会社 Leave of absence prediction system, prediction rule learning device, prediction device, leave of absence prediction method, and computer-readable recording medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114154906A (en) * 2021-12-10 2022-03-08 厦门兆翔智能科技有限公司 Airport ground service intelligent scheduling method and system
CN115330195A (en) * 2022-08-12 2022-11-11 苏州盖雅信息技术有限公司 Periodic scheduling method and device, electronic equipment and storage medium
CN115660344A (en) * 2022-10-25 2023-01-31 平安银行股份有限公司 User scheduling method and device, electronic equipment and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
面向时变需求的某机场客舱清洁人员排班问题研究;陈颖成;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》(第01期);第C031-158页 *

Also Published As

Publication number Publication date
CN116307643A (en) 2023-06-23

Similar Documents

Publication Publication Date Title
CN109949046B (en) Identification method and device for risk group partner
Yu et al. Reputation-aware task allocation for human trustees
CN105719221B (en) Path collaborative planning method and device for multiple tasks
Serna-Suárez et al. Microgrid's energy management systems: A survey
WO2013042213A1 (en) Computer, computer system, and search program
Liu et al. Interval optimal scheduling of hydro‐PV‐wind hybrid system considering firm generation coordination
Bhadoria et al. An optimum forceful generation scheduling and unit commitment of thermal power system using sine cosine algorithm
Watson et al. Optimization of excess system capability for increased evolvability
CN116307643B (en) Scheduling method and device, electronic equipment and storage medium
Moore et al. Optimal allocation of law enforcement patrol effort to mitigate poaching activities
Huang et al. IM-LDP: Incentive mechanism for mobile crowd-sensing based on local differential privacy
JP7432087B2 (en) Data structures containing energy schedules and methods for providing data structures containing energy schedules
Wang et al. Optimization model and algorithm design for airline fleet planning in a multiairline competitive environment
CN110175728B (en) Electric vehicle charging station dispatching device based on gradient projection degradation type interior point method
CN114862065B (en) Social work task planning method and device, electronic equipment and storage medium
Pérez-Ruiz et al. Multi-period probabilistic production cost model including dispatch constraints
Azizivahed et al. Multi-area economic emission dispatch considering load uncertainty
Borokhovich et al. Improving impact sourcing via efficient global service delivery
Boon-in et al. Formal modeling of multi-server queuing network using Stochastic Petri Nets
Mukherjee et al. Using Optimization and Queuing Models to Estimate Long-Term Average Flight Delays and Cancellation Rates
Pandit et al. Discount-based pricing and capacity planning for ev charging under stochastic demand
CN110896220A (en) Interruptible load optimization control method based on cooperative game kernel method
Vagropoulos et al. Artificial neural network-based methodology for short-term electric load scenario generation
Delarue et al. Enhanced priority list unit commitment method for large scale systems with focus on low residual demand
KR102538698B1 (en) Artificial intelligence based patent law firm management method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right

Effective date of registration: 20230725

Address after: No.17, south 2nd section of 2nd Ring Road, Wuhou District, Chengdu, Sichuan 610000

Applicant after: THE SECOND RESEARCH INSTITURE OF CAAC

Applicant after: MINHANG CHENGDU INFORMATION TECHNOLOGY CO.,LTD.

Address before: 610000 No. 5, 6 and 8, floor 4, unit 1, building 1, No. 17, South Section 2, Second Ring Road, Wuhou District, Chengdu, Sichuan

Applicant before: MINHANG CHENGDU INFORMATION TECHNOLOGY CO.,LTD.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant