CN114266398A - Automatic duty table generation method and device - Google Patents
Automatic duty table generation method and device Download PDFInfo
- Publication number
- CN114266398A CN114266398A CN202111584772.0A CN202111584772A CN114266398A CN 114266398 A CN114266398 A CN 114266398A CN 202111584772 A CN202111584772 A CN 202111584772A CN 114266398 A CN114266398 A CN 114266398A
- Authority
- CN
- China
- Prior art keywords
- duty
- scheduling
- configuration information
- shift
- post
- 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
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The disclosure provides an automatic generation method of an executive table, which can be applied to the technical field of operation and maintenance. The method comprises the following steps: acquiring on-duty station configuration information and scheduling configuration information; updating a preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information; determining an on-duty preview table according to the updated scheduling algorithm; and adjusting the on-duty preview list according to the adjustment information to generate the on-duty list. The present disclosure also provides an automatic value shift table generation apparatus, device, storage medium, and program product.
Description
Technical Field
The disclosure relates to the technical field of operation and maintenance, in particular to the technical field of automatic scheduling, and particularly relates to a method, a device, equipment, a medium and a product for automatically generating a duty schedule.
Background
In the operation and maintenance work of large-scale commercial banks, in order to ensure the stability and continuity of the system operation, operation and maintenance management personnel need to carry out operation, maintenance and scheduling on duty on a relevant core service system, so that the normal operation of the system is ensured, and the economic loss caused by the fact that the system fault cannot be timely found and checked and cannot be timely disposed is avoided.
In one example, for the operation and maintenance duty scheduling, the scheduling is performed by adding some universal strategies based on a fixed time and a fixed algorithm. The scheduling method cannot meet the scheduling requirements of complex conditions and special conditions, and cannot achieve efficient arrangement of personnel for specific scenes. Even some unreasonable situations may occur, such as continuous shift of people, for example, different requirements of people in different time intervals in one shift cannot be met, the time intervals cannot be flexibly configured, flexible configuration and arrangement of weekend working days, conventional working days and legal holidays in the same shift cannot be met, or configuration flow is complicated.
Disclosure of Invention
In view of the foregoing, the present disclosure provides a method, apparatus, device, medium, and program product for automatic generation of a shift list.
According to a first aspect of the present disclosure, a method for automatically generating a value shift table is characterized in that the method comprises:
acquiring on-duty station configuration information and scheduling configuration information;
updating a preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information;
determining an on-duty preview table according to the updated scheduling algorithm; and
and adjusting the on-duty preview list according to the adjustment information to generate an on-duty list.
According to the embodiment of the disclosure, the configuration information of the duty station includes basic information of the duty station, a duty person, configuration of the duty time period and a duty state, the configuration information of the duty station includes a duty name, an approver, a shift change, a security level, a duty station, a duty date and a duty state, and updating a preset duty algorithm according to the configuration information of the duty station and the configuration information of the duty station includes:
determining a scheduling requirement according to the configuration information of the on-duty post;
performing service abstraction and modeling according to the scheduling requirement to generate constraint conditions, wherein the constraint conditions comprise necessary constraint conditions and unnecessary constraint conditions; and
and updating the preset scheduling algorithm according to the constraint condition.
According to an embodiment of the present disclosure, the determining the on-duty look-ahead table according to the updated scheduling algorithm includes:
solving the constraint condition according to the updated scheduling algorithm to determine an optimal solution; and
and determining an on-duty look-ahead table according to the optimal solution.
According to the embodiment of the disclosure, the post basic information includes a post name, a place on duty, a post person in charge, a department to which the post person belongs, a post task and a post description, and the determining of the scheduling requirement according to the configuration information of the place on duty includes:
and determining the scheduling requirement according to the post task, the post description, the post time period and the scheduling date.
According to the embodiment of the disclosure, solving the constraint condition according to a preset scheduling algorithm to determine an optimal solution comprises:
solving the constraint condition according to a preset scheduling algorithm and recording solving times;
when the solving times is larger than a preset threshold value, determining that the optimal solution does not exist under the current constraint condition; and
and deleting unnecessary constraint conditions according to the priority of the constraint conditions, and then solving again until an optimal solution is determined.
According to the embodiment of the present disclosure, solving the constraint condition according to a preset scheduling algorithm to determine an optimal solution further includes:
and when determining that no optimal solution exists and the constraint condition only needs the constraint condition, informing the scheduling personnel to modify the scheduling requirement.
According to an embodiment of the present disclosure, the method further comprises:
issuing the duty list;
acquiring shift request information; and
and updating the duty list according to the shift request information.
A second aspect of the present disclosure provides an automatic value shift table generation apparatus, including: the acquisition module is used for acquiring the configuration information of the on-duty post and the scheduling configuration information;
the updating module is used for updating a preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information;
the generating module is used for determining the on-duty preview list according to the updated scheduling algorithm; and
and the adjusting module is used for adjusting the on-duty preview list according to the adjusting information to generate the on-duty list.
A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the above method of automatic generation of a watch.
The fourth aspect of the present disclosure also provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the above-mentioned automatic watch generation method.
A fifth aspect of the present disclosure also provides a computer program product comprising a computer program which, when executed by a processor, implements the above automatic duty list generation method.
According to the automatic duty schedule generation method provided by the embodiment of the disclosure, on the basis of an operation theory, an on-duty scheduling problem is subjected to abstract modeling, a preset scheduling algorithm is generated, the preset scheduling algorithm is updated according to on-duty station configuration information and scheduling configuration information, the updated scheduling algorithm is solved, an on-duty pre-browsing schedule is determined, and the on-duty scheduling schedule is adjusted according to field requirements and scheduling statistical analysis. The scheduling algorithm can be added into a configuration strategy of a user, so that different scene requirements can be met, the on-duty management efficiency is improved, and the safe and efficient implementation of operation and maintenance work is further ensured.
Drawings
The foregoing and other objects, features and advantages of the disclosure will be apparent from the following description of embodiments of the disclosure, which proceeds with reference to the accompanying drawings, in which:
FIG. 1 schematically illustrates a flow diagram of a duty management system according to an embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow chart of a method for automatic generation of a shift list according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow chart of another method for automatic generation of a watch list according to an embodiment of the present disclosure;
fig. 4 schematically shows a block diagram of the structure of an automatic duty table generation apparatus according to an embodiment of the present disclosure; and
fig. 5 schematically shows a block diagram of an electronic device adapted to implement a method for automatic generation of a watch list according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
The terms appearing in the present disclosure are explained first:
and (4) post: the minimum unit of duty of operation and maintenance duty.
Scheduling: the on-duty management personnel select certain on-duty personnel, and for certain posts, the on-duty management personnel are arranged and combined within a certain time according to a certain algorithm strategy.
Working day: aiming at the field operation and maintenance condition, the working days are divided into three types, namely a normal working day, a weekend working day and a legal holiday working day.
On duty: work is performed in the current shift.
Operational research: the method is an important subject of modern management, mainly aims to provide scientific basis for managers in decision making, and is an important method for realizing effective management, correct decision making and modern management.
The traditional typesetting algorithm is usually based on fixed time and fixed algorithm, the round-robin is performed in the time dimension, and then the manual adjustment is performed by combining the user, so that the traditional scheduling algorithm is difficult to simultaneously ensure the fairness and the rationality of the scheduling, the difference between various working days cannot be distinguished, and the complex operation and maintenance scene cannot be met.
Based on the technical problem, an embodiment of the present disclosure provides an automatic value shift table generation method, which is characterized in that the method includes: acquiring on-duty station configuration information and scheduling configuration information; updating a preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information; determining an on-duty preview table according to the updated scheduling algorithm; and adjusting the on-duty preview list according to the adjustment information to generate the on-duty list.
Fig. 1 schematically shows a flow chart of a duty management system according to an embodiment of the present disclosure. It should be noted that the flowchart shown in fig. 1 is only an example of an application scenario that may be used in the embodiments of the present disclosure to help those skilled in the art understand the technical content of the present disclosure, but does not mean that the embodiments of the present disclosure may not be used in other devices, systems, environments or scenarios.
As shown in fig. 1, the user can set the shift attributes and the basic shift attributes such as the shift group and the shift date/time period according to the requirement. And configuring the duty time intervals of different working days and the duty number of people in each time interval. After the configuration of the scheduling strategy for the configured posts is completed, the scheduling algorithm can perform the minimum weight scheduling of each person according to different working days and different time intervals, uniformly hash each person to each time interval of each working day in sequence, and automatically judge whether the shift is continuous or not. And some auxiliary strategies are configured, for example, new and old employees are matched with duty, the number of the employees in the duty time period is required to be more than 1, the new and old employees can be automatically screened and put together, fairness can be properly sacrificed, and at least one old employee in each shift is guaranteed. For example, the sex-assisted strategy, the person on duty can be adjusted according to the sex during the duty period from 10 pm to 6 am. The method comprises the steps that a scheduling pre-viewing list of a time period is generated through a preset scheduling algorithm, a user can adjust staff according to site requirements and scheduling statistical analysis of the staff, then the duty list of the adjusted time period is directly copied to the following date according to a period to be scheduled and filled, the duty list starts to take effect after being issued, the duty list can automatically inform the duty staff to go to duty in the appointed time period according to notification configuration, the duty condition is recorded, if the duty needs to be adjusted under special conditions, the duty staff can submit an application in a duty management system, an administrator is responsible for processing application information, and the duty list is adjusted according to the application information.
The automatic shift table generation method according to the disclosed embodiment will be described in detail below with reference to fig. 2 to 3 based on the shift management system described in fig. 1.
Fig. 2 schematically illustrates a flow chart of a method for automatic generation of a shift list according to an embodiment of the present disclosure.
As shown in fig. 2, the automatic duty table generation method of this embodiment includes operations S210 to S240, and the automatic duty table generation method may be performed by a server or other computing device.
The method provided by the embodiment of the disclosure is applied to an on-duty management system and comprises a plurality of modules of legal holiday configuration, on-duty groups, on-duty positions, on-duty scheduling, on-duty calendar, on-duty notification, on-duty handover, duty management and on-duty log.
The legal holiday configuration provides the configuration of national legal holidays of a specified year, and the legal holidays are configured to a duty management system according to the legal holidays published by the country and the legal holiday dates are calibrated; the duty groups and duty positions provide pre-grouping of personnel and delineation of duty positions, and configure working day attributes of the positions and duty periods of three working days; and the on-duty scheduling is carried out according to the defined posts, personnel and strategies, the background calls a scheduling algorithm to generate a scheduling list, and the scheduling personnel carries out scheduling list adjustment and then issues the scheduling list.
The on-duty calendar shows the on-duty arrangement and on-duty details of the person in the current month, and initiates a shift application; the shift management can adjust the shift of personnel, the shift management can be divided into my application and my examination and approval, the shift application can be edited, the authorized personnel can also examine and approve the shift, and the result after the examination and approval is directly updated to an on-duty table and an on-duty calendar; the on-duty notification can inform the on-duty personnel of going on duty in advance, and the on-duty personnel can be notified in a short message, mail or in-station mail mode; the on-duty handover ensures that personnel can be handed over on duty and off duty normally, and ensures that the on-duty items can be transferred normally; the on-duty log records the on-duty condition of the shift, and can carry out standard arrangement and filing, thereby being convenient for tracing the problems.
Operation S210-operation S240 mainly relate to two data models of an on-duty station and an on-duty scheduling mode, wherein the on-duty station preprocesses personnel and station attributes, and the on-duty scheduling mode utilizes an algorithm to schedule the personnel.
In operation S210, the on-duty station configuration information and the scheduling configuration information are acquired.
According to the embodiment of the disclosure, the duty station configuration information comprises basic duty information, duty personnel, duty time period configuration and duty state, and the scheduling configuration information comprises a scheduling name, an approver, a shift, a security level, a scheduling position, a scheduling date and a scheduling state.
In one example, a manager configures an on-duty station to generate on-duty station configuration information, which mainly comprises station basic information, a station on-duty person, station time period configuration and a station state, wherein the station basic information comprises station names (global unique), on-duty points, station responsible persons, affiliated departments, station tasks, station description and other basic information; the duty personnel can come from duty groups or users in the system; the method comprises the steps of configuring the duty time period, wherein the duty time period of three working days (normal working days, weekend working days and legal holidays) is reasonably and properly configured according to the on-site duty requirement, and at least one of the three working days is required to be configured; the post state comprises release and non-release, and the release operation can be carried out after the post information passes the user number verification. The post released defaults to a post that the administrator has configured. Only the post issued can be scheduled.
After the configuration of the duty station is completed, the configuration of the duty scheduling is needed, and the configuration information of the duty scheduling comprises a duty scheduling name, an approver, a shift change, a security level, a duty scheduling station, a duty scheduling date and a duty scheduling state. The scheduling name is used for distinguishing approval tasks; the approver is a person with approval authority in the current shift scheduling task; the shift switching comprises two states of opening and closing, the shift switching is not required to be opened during routine daily duty, and the shift switching is required to be opened during important duty; the security level represents the security importance of the current duty position, the security level is default to be low when the duty is closed, the duty log can be generated by default if the security level is selected to be medium after the duty is opened, and the duty personnel can confirm the security level. If a high security level is selected, the person on duty is required to fill in a detailed on duty record.
In operation S220, the preset scheduling algorithm is updated according to the on-duty station configuration information and the scheduling configuration information. In operation S230, an on-duty look-ahead table is determined according to the updated shift scheduling algorithm.
In an example, the preset scheduling algorithm in the embodiment of the disclosure is a scheduling algorithm with a minimum weight determined by performing abstract modeling on an operation and maintenance duty service based on an operation theory, specifically, scheduling requirements for different on-site operation and maintenance scenes, such as no permission of continuous shift, new and old employee collocation, different values of time for both men and women, no independent waiting for night shift, are summarized and abstracted into constraint conditions, and in addition, a new scheduling requirement can be obtained according to configuration information in operation S210, a new constraint condition is abstracted, the preset scheduling algorithm is updated, the preset scheduling algorithm obtains optimal solutions for the constraint conditions, a shift-on preview table is determined according to the optimal solutions, and the optimal solutions can have multiple groups, that is, the shift-on preview table can have multiple groups; meanwhile, there may be a case of no solution, that is, the optimal solution cannot be found according to the current constraint condition, and at this time, according to the priority of the constraint condition, part of the constraint conditions are sequentially deleted and solved again until the optimal solution is obtained.
In operation S240, the shift pre-viewing list is adjusted according to the adjustment information to generate a shift list.
In an example, after the shift schedule review table is generated, there may be a case that needs to be adjusted, and the manager may manually adjust the shift schedule review table on the interface to generate a final shift schedule.
According to the automatic shift schedule generation method provided by the embodiment of the disclosure, the shift scheduling algorithm is updated according to the acquired shift position configuration information and shift scheduling configuration information, so that different operation and maintenance scene requirements can be met, and the shift preview schedule is determined according to the updated shift scheduling algorithm; the on-duty preview table is adjusted according to the adjustment information to generate the on-duty table, so that the office automation degree is improved, the on-duty management efficiency is improved, and the safe, stable and efficient implementation of operation and maintenance work is guaranteed.
FIG. 3 schematically illustrates a flow chart of another method for automatic generation of a watch list according to an embodiment of the disclosure. As shown in fig. 3, operations S310 to S380 are included.
In operation S310, duty configuration information and shift scheduling configuration information are acquired.
The present operation is the same as the technical solution and the technical principle of operation S210 shown in fig. 2, and is not described again.
In operation S320, the preset scheduling algorithm is updated according to the on-duty station configuration information and the scheduling configuration information.
Operation S320 includes operations S321 to S323 according to the embodiment of the present disclosure.
In operation S321, determining a shift scheduling requirement according to the on-duty station configuration information; the post basic information comprises a post name, a duty spot, a post person in charge, a department to which the post person belongs, a post task and a post description. And determining the scheduling requirement according to the post task, the post description, the post time period and the scheduling date. In operation S322, performing business abstraction and modeling according to the scheduling requirement to generate constraint conditions, where the constraint conditions include essential constraint conditions and non-essential constraint conditions; in operation S323, the preset shift scheduling algorithm is updated according to the constraint condition.
Operation S320 is illustrated with an example scenario:
determining the duty requirement as follows according to the duty configuration information:
1) each person is worth one shift per day
2) The duty should not exceed 5 days per week
3) Each shift should not be lower than two
4) Continuous shift should not occur
5) The new and old employees can be matched as much as possible
6) Female staff cannot be scheduled to work at night
7) The user can watch the work fairly as much as possible, and each person has uniform value and different time periods of the work.
Three shifts are carried out on normal working days, four people in the early shift (8:00-16:00), three people in the afternoon shift (16:00-24:00) and two people in the late shift (24:00-8: 00); two-shift system is carried out on weekend working days, wherein two persons are in the morning (8:00-16:00) and two persons are in the afternoon (16:00-24: 00); the statutory holiday realizes two-shift system, namely two persons in the early shift (8:00-16:00) and two persons in the afternoon shift (16:00-24: 00). There are currently 12 employees, 6 new employees, 6 old employees. Inputting the configuration information of the on-duty position of the on-duty requirement into an on-duty management system, and performing service abstraction and mathematical modeling as follows:
employee number i ═ 1, 2, 3, … 12, 1 to 6 are old employees, 7 to 12 are new employees, 6 and 7 are female employees; week number j ═ 1, 2, 3, … 7; the shift number k is 1, 2, 3; the number of people required per shift djk，j＝1，2，...，7；k＝1，...，3。
Decision variable xijkIs 1 or 0 when xijkWhen 1, characterization worker i is scheduled to the kth shift on day j.
Other constraints, the following constraints are in order of decreasing priority:
the necessary constraints are:
1) one shift of each person at most
2) Every person can not work for two shifts every other day at any time
xi，j，3+xi，j+1，1＜＝1，i＝1，2，...，12；j＝1，..，5
xi，6，2+xi，7，1＜＝1，i＝1，2，...，12
xi，7，2+xi，1，1＜＝1，i＝1，2，...，12
3) Each person has a rest of at least two days per week
4) The number of people per shift meets the requirement
Non-essential constraints:
5) female staff out of duty at night
6) The new and old employees can be matched as much as possible
7) Make the best of fairness
Early shift: it requires 5x4+2x2 ═ 24 (people), averaging up to 12 people, all 2 morning shifts.
…
Middle shift: 5x3+2x2 ═ 19 (people times), averaged to 12 people, each 1.58 middle classes.
…
The night shift: 5x2 is required (10 people), averaging to 10 men and 1 night shift.
…
And satisfying the constraint conditions and solving an optimal solution with the best fairness.
Z represents the variance of a shift
Early shift:
middle shift:
the night shift:
the constraint condition may be preset, or may be abstractly generated according to a policy configured by a user, specifically, the scheduling requirement is determined according to the post task, the post description, the post time period and the scheduling date in the configuration information, and the constraint condition is abstracted according to the scheduling requirement. Compared with the existing scheduling method, the scheduling algorithm provided by the disclosure abstracts the operation and maintenance scenes and the scheduling requirements to generate a plurality of groups of constraint conditions, the combination of different groups of constraint conditions corresponds to different operation and maintenance scenes, the adaptability is stronger, and meanwhile, the configuration of the on-duty position and the scheduling information is supported, namely, according to the strategy configured by a user, the algorithm can adapt to different scene requirements, so that the on-duty management system is more flexible and complete.
In operation S330, the constraint condition is solved according to the updated shift scheduling algorithm to determine an optimal solution. In operation S340, an on-duty look-ahead table is determined according to the optimal solution.
According to the embodiment of the disclosure, solving the constraint condition according to a preset scheduling algorithm and recording solving times; when the solving times is greater than a preset threshold value, determining that the optimal solution does not exist under the current constraint condition; and deleting unnecessary constraint conditions according to the priority of the constraint conditions, and then solving again until an optimal solution is determined. And when determining that no optimal solution exists and the constraint condition is only necessary, informing the scheduling personnel to modify the scheduling requirement.
In one example, the optimal solutions satisfying various constraint conditions (for example only) are obtained according to the solution of the constraint equation, the number of the optimal solutions may be multiple groups, and multiple on-duty look-up tables are determined according to the multiple groups of optimal solutions. In some special cases, in order to improve the calculation efficiency of the algorithm, the algorithm may enter deep loop traversal for some data reasons during executing the shift scheduling, find data that meets expectations, if the data cannot be found, the algorithm may repeatedly find data, here, various data that may have problems are defined, and perform data verification, the depth of the defined loop traversal is default to 10 (the number may be configured in the system parameters), and if the number exceeds the preset threshold, it is determined that the data configuration does not meet the shift scheduling requirement. If the conditions are met and cannot be solved, deleting unnecessary constraint conditions in sequence from low to high according to the priority to solve, and if only the necessary conditions cannot be solved, informing a manager that the conditions cannot be met and the necessary constraint conditions need to be modified.
In operation S350, the shift look-ahead table is adjusted according to the adjustment information to generate a shift look-ahead table.
The present operation is the same as the technical solution and the technical principle of operation S240 shown in fig. 2, and is not described again.
After the shift table is generated, the shift management system performs operations S360 to S380.
In operation S360, issuing a watch list; in operation S370, shift request information is acquired; in operation S380, the shift schedule is updated according to the shift request information.
In one example, after the shift list is generated, the shift list is issued, the issued shift list is immediately effective, and the shift personnel can see the shift information related to the shift personnel in the shift calendar of the shift personnel. At this time, there may be some special scenes, for example, when the shift is near to work, an employee has something in the temporary home and needs to ask for a leave, the shift-taking application information is submitted through the shift-taking management system, and after the administrator acquires the shift-taking request information, the shift-taking list is adjusted, updated and reissued according to the shift-taking request information.
Based on the automatic duty list generation method, the disclosure also provides an automatic duty list generation device. The apparatus will be described in detail below with reference to fig. 4.
Fig. 4 schematically shows a block diagram of the structure of an automatic duty table generation apparatus according to an embodiment of the present disclosure.
As shown in fig. 4, the automatic duty list generation apparatus 400 of this embodiment includes an acquisition module 410, an update module 420, a generation module 430, and an adjustment module 440.
The obtaining module 410 is configured to obtain the configuration information of the on-duty station and the configuration information of the shift arrangement. In an embodiment, the obtaining module 410 may be configured to perform the operation S210 described above, which is not described herein again.
The updating module 420 is configured to update a preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information. In an embodiment, the updating module 420 may be configured to perform the operation S220 described above, which is not described herein again.
The generating module 430 is configured to determine the on-duty look-ahead table according to the updated shift scheduling algorithm. In an embodiment, the generating module 430 may be configured to perform the operation S230 described above, which is not described herein again.
The adjusting module 440 is configured to adjust the on-duty preview table according to the adjustment information to generate the on-duty list. In an embodiment, the adjusting module 440 may be configured to perform the operation S240 described above, which is not described herein again.
According to an embodiment of the present disclosure, any plurality of the obtaining module 410, the updating module 420, the generating module 430, and the adjusting module 440 may be combined into one module to be implemented, or any one of the modules may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the obtaining module 410, the updating module 420, the generating module 430, and the adjusting module 440 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or may be implemented by any one of three implementations of software, hardware, and firmware, or any suitable combination of any of the three. Alternatively, at least one of the obtaining module 410, the updating module 420, the generating module 430 and the adjusting module 440 may be at least partially implemented as a computer program module, which when executed may perform the respective functions.
Fig. 5 schematically shows a block diagram of an electronic device adapted to implement a method for automatic generation of a watch list according to an embodiment of the present disclosure.
As shown in fig. 5, an electronic device 500 according to an embodiment of the present disclosure includes a processor 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. The processor 501 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 501 may also include onboard memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 503, various programs and data necessary for the operation of the electronic apparatus 500 are stored. The processor 501, the ROM 502, and the RAM 503 are connected to each other by a bus 504. The processor 501 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 502 and/or the RAM 503. Note that the program may also be stored in one or more memories other than the ROM 502 and the RAM 503. The processor 501 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in one or more memories.
According to an embodiment of the present disclosure, electronic device 500 may also include an input/output (I/O) interface 505, input/output (I/O) interface 505 also being connected to bus 504. The electronic device 500 may also include one or more of the following components connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include ROM 502 and/or RAM 503 and/or one or more memories other than ROM 502 and RAM 503 described above.
Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated in the flow chart. When the computer program product runs in a computer system, the program code is used for causing the computer system to realize the automatic duty table generation method provided by the embodiment of the disclosure.
The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 501. The systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal on a network medium, downloaded and installed through the communication section 509, and/or installed from the removable medium 511. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program, when executed by the processor 501, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.
Claims (11)
1. An automatic generation method of a duty list, which is characterized by comprising the following steps:
acquiring on-duty station configuration information and scheduling configuration information;
updating a preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information;
determining an on-duty preview table according to the updated scheduling algorithm; and
and adjusting the on-duty preview list according to the adjustment information to generate an on-duty list.
2. The method as claimed in claim 1, wherein the on-duty station configuration information includes station basic information, station on-duty personnel, station time period configuration and station status, the scheduling configuration information includes scheduling name, approver, shift change, security level, scheduling station, scheduling date and scheduling status, and updating the preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information includes:
determining a scheduling requirement according to the configuration information of the on-duty post;
performing service abstraction and modeling according to the scheduling requirement to generate constraint conditions, wherein the constraint conditions comprise necessary constraint conditions and unnecessary constraint conditions; and
and updating the preset scheduling algorithm according to the constraint condition.
3. The method of claim 2, wherein the post basic information comprises a post name, a place on duty, a post leader, a department affiliated with, a post task, and a post description, and wherein determining a scheduling requirement according to the post on duty configuration information comprises:
and determining the scheduling requirement according to the post task, the post description, the post time period and the scheduling date.
4. The method of claim 3, wherein determining an on-duty look-ahead table according to the updated scheduling algorithm comprises:
solving the constraint condition according to the updated scheduling algorithm to determine an optimal solution; and
and determining an on-duty look-ahead table according to the optimal solution.
5. The method of claim 4, wherein solving the constraints according to a preset scheduling algorithm to determine an optimal solution comprises:
solving the constraint condition according to a preset scheduling algorithm and recording solving times;
when the solving times is larger than a preset threshold value, determining that the optimal solution does not exist under the current constraint condition; and
and deleting unnecessary constraint conditions according to the priority of the constraint conditions, and then solving again until an optimal solution is determined.
6. The method of claim 5, wherein solving the constraints according to a preset shift scheduling algorithm to determine an optimal solution further comprises:
and when determining that no optimal solution exists and the constraint condition only needs the constraint condition, informing the scheduling personnel to modify the scheduling requirement.
7. The method according to any one of claims 1 to 6, further comprising:
issuing the duty list;
acquiring shift request information; and
and updating the duty list according to the shift request information.
8. An automatic generation device of an executive table comprises:
the acquisition module is used for acquiring the configuration information of the on-duty post and the scheduling configuration information;
the updating module is used for updating a preset scheduling algorithm according to the on-duty station configuration information and the scheduling configuration information;
the generating module is used for determining the on-duty preview list according to the updated scheduling algorithm; and
and the adjusting module is used for adjusting the on-duty preview list according to the adjusting information to generate the on-duty list.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-7.
10. A computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the method of any one of claims 1-7.
11. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111584772.0A CN114266398A (en) | 2021-12-22 | 2021-12-22 | Automatic duty table generation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111584772.0A CN114266398A (en) | 2021-12-22 | 2021-12-22 | Automatic duty table generation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114266398A true CN114266398A (en) | 2022-04-01 |
Family
ID=80829092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111584772.0A Pending CN114266398A (en) | 2021-12-22 | 2021-12-22 | Automatic duty table generation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114266398A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115952972A (en) * | 2022-12-05 | 2023-04-11 | 广东烟草江门市有限公司 | Scheduling method and computer-readable storage medium |
| CN116384702A (en) * | 2023-04-17 | 2023-07-04 | 点米(北京)科技有限公司 | Enterprise personnel management method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111325433A (en) * | 2018-12-14 | 2020-06-23 | 顺丰科技有限公司 | Scheduling method, device, equipment and storage medium in logistics field |
| CN111667155A (en) * | 2020-05-21 | 2020-09-15 | 深圳供电局有限公司 | Work-shift scheduling management method and system |
| CN112184087A (en) * | 2020-11-06 | 2021-01-05 | 京东数字科技控股股份有限公司 | Method and apparatus for outputting information |
-
2021
- 2021-12-22 CN CN202111584772.0A patent/CN114266398A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111325433A (en) * | 2018-12-14 | 2020-06-23 | 顺丰科技有限公司 | Scheduling method, device, equipment and storage medium in logistics field |
| CN111667155A (en) * | 2020-05-21 | 2020-09-15 | 深圳供电局有限公司 | Work-shift scheduling management method and system |
| CN112184087A (en) * | 2020-11-06 | 2021-01-05 | 京东数字科技控股股份有限公司 | Method and apparatus for outputting information |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115952972A (en) * | 2022-12-05 | 2023-04-11 | 广东烟草江门市有限公司 | Scheduling method and computer-readable storage medium |
| CN116384702A (en) * | 2023-04-17 | 2023-07-04 | 点米(北京)科技有限公司 | Enterprise personnel management method and system |
| CN116384702B (en) * | 2023-04-17 | 2023-12-29 | 点米(北京)科技有限公司 | Enterprise personnel management method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8705723B2 (en) | Systems and methods for scheduling contact center agents | |
| US7660406B2 (en) | Systems and methods for integrating outsourcers | |
| CN105303306B (en) | Electric power material dispatching platform system | |
| CN106682877A (en) | Method of project management | |
| CN114266398A (en) | Automatic duty table generation method and device | |
| US8015043B2 (en) | Method and apparatus for workforce demand forecasting | |
| CN105654243B (en) | A kind of project information automated programming system based on trajectory diagram | |
| US11171879B2 (en) | System and method of sharing edge computing resources | |
| WO2022252861A1 (en) | Plane ticket rescheduling method and plane ticket rescheduling apparatus | |
| US20160171420A1 (en) | Optimizing allocation of employees for corporate training | |
| CN115857884A (en) | Business flow chart generation method and device | |
| Röper et al. | Costing of helicopter emergency services-a strategic simulation based on the example of a German rural region | |
| CN116777380A (en) | Project integration overall management method and device | |
| Cortés et al. | A simulation-based approach for fleet design in a technician dispatch problem with stochastic demand | |
| KR20210043396A (en) | System for management of educational institutions | |
| CN115293717B (en) | Method and device for updating organization architecture data | |
| US20040078254A1 (en) | Methods and systems for human resource budgeting and control | |
| Authority | Carrying out Works under Force Account | |
| US20070061461A1 (en) | Computer-implemented method, system, and program product for resource forecasting in an information technology (IT) migration | |
| Gopal | Modeling and optimization of hospital transportation system | |
| Spasic et al. | Information and Communication Technology Unit Service Management in a Non-Profit Organization Using ITIL Standards. | |
| US20250131390A1 (en) | Centralized Ledger for Airline Maintenance Control | |
| JP2019049944A (en) | Method, server and program for predicting workload required for remittance processing in future date | |
| Jiang | Integration of Interactive Voice Response Unit and Outage Management System | |
| Adzinets et al. | Field Service Management (FSM) Simulation Model |
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 |