CN113095618B - IT operation and maintenance service personnel scheduling method - Google Patents
IT operation and maintenance service personnel scheduling method Download PDFInfo
- Publication number
- CN113095618B CN113095618B CN202110227365.8A CN202110227365A CN113095618B CN 113095618 B CN113095618 B CN 113095618B CN 202110227365 A CN202110227365 A CN 202110227365A CN 113095618 B CN113095618 B CN 113095618B
- Authority
- CN
- China
- Prior art keywords
- task
- service personnel
- maintenance service
- node
- branch
- 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
Links
- 238000012423 maintenance Methods 0.000 title claims abstract description 156
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000013138 pruning Methods 0.000 claims abstract description 66
- 238000012545 processing Methods 0.000 claims abstract description 30
- 230000008569 process Effects 0.000 claims description 26
- 238000007781 pre-processing Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 8
- 239000011159 matrix material Substances 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000003252 repetitive effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
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/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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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/20—Administration of product repair or maintenance
-
- 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
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- General Factory Administration (AREA)
Abstract
The invention discloses a method for scheduling IT operation and maintenance service personnel, which belongs to the field of scheduling of IT operation and maintenance service personnel and comprises the following steps: acquiring release time and deadline of each task, processing time of each task by each IT operation and maintenance service personnel, and initializing a B & B tree root node and an upper bound in a branch and bound algorithm; after the root node is used as the current node to execute the branching step, the feasible solution is used as the final dispatching result; the branching step comprises the following steps: if the unallocated task set of the current node is not empty, matching tasks in the unallocated task set with IT operation and maintenance service personnel one by one, serving as child nodes of the current node, deleting child nodes meeting any pruning condition, and sequentially taking the child nodes which are not deleted as new current nodes to re-execute the branching step; otherwise, the matching scheme corresponding to each node on the current branch forms a feasible solution, and the upper bound is updated to be the minimum value in the delay time corresponding to the feasible solution and the current feasible solution. The invention can effectively improve the solving precision and the solving speed.
Description
Technical Field
The invention belongs to the field of IT operation and maintenance service personnel scheduling, and particularly relates to an IT operation and maintenance service personnel scheduling method.
Background
With the further development of computer technology, the demand of the IT industry is further vigorous, the IT operation and maintenance service is an important ring in the IT industry, and how to effectively and rapidly perform the IT operation and maintenance service is also a concern of enterprises. The IT operation and maintenance can quickly react to the generated IT fault, and timely distribute the maintenance task of the IT fault to IT operation and maintenance service personnel with corresponding skills so that the corresponding IT operation and maintenance service personnel can timely maintain the IT fault.
The problems are characterized in that IT operation and maintenance service personnel have heterogeneity and tasks have different release time and deadline, wherein the release time and the deadline of the tasks refer to the time when the tasks are generated and the latest time when the tasks are not delayed to be completed, namely, if the tasks are completed after the deadline, the tasks are delayed. The method can be simply described as that a plurality of faults occur in a certain time period, a plurality of tasks are correspondingly generated, the release time and the deadline of each task are different, the task can be started only after the release time, delay is generated if the task is not completed before the deadline, then the IT service level is influenced, the skills possessed by each IT operation and maintenance service personnel are different, the tasks which can be completed are different, the time for completing each task is also different, the time for the IT service personnel to start processing the task is the start time of the task after the task is distributed to the IT service personnel, and the time for the task to be completed is the end time of the task.
The goal of IT service personnel scheduling is how to assign several operation tasks to different operation service personnel and determine the task processing order of each operation service personnel to minimize the task maximum delay. For the problems belonging to the NP-Hard problem, the accurate solution cannot be obtained in polynomial time, so that most of the problems adopt some heuristic methods to quickly obtain the approximate solution, and the accurate solution is difficult to obtain.
Disclosure of Invention
Aiming at the defects and improvement demands of the prior art, the invention provides a scheduling method for IT operation and maintenance service personnel, which aims to solve the scheduling scheme of the IT operation and maintenance service personnel by using a framework of a branch-and-bound algorithm so as to obtain an accurate solution, and cut off branches which cannot generate the optimal solution in a B & B tree by utilizing various effective pruning conditions in the solving process so as to effectively improve the solving speed, thereby solving the technical problems of long solving time and low precision of the existing scheduling scheme for the IT operation and maintenance service personnel.
In order to achieve the above object, according to one aspect of the present invention, there is provided an IT operation and maintenance service personnel scheduling method, including the steps of:
pretreatment: acquiring release time and deadline of each task and processing time of each task processed by each IT operation and maintenance service personnel, initializing a root node of a B & B tree in a branch-and-bound algorithm, and initializing a delay time as an upper bound of the branch-and-bound algorithm;
pruning: taking branches from the root node to the node to be processed as branches to be pruned, and deleting the node to be processed from the B & B tree if the branches to be pruned meet any one preset pruning condition;
branching: acquiring an unassigned task set corresponding to the current node, if the unassigned task set is not empty, performing one-to-one matching on each task in the unassigned task set and all IT operation and maintenance service personnel, taking the tasks as child nodes of the current node, performing pruning steps on the child nodes, and re-performing branching steps by taking the child nodes of which the current node is not deleted as new current nodes in sequence; if the unassigned task set is empty, forming a feasible solution by a matching scheme corresponding to each node on the current branch, and updating the upper bound into the delay time corresponding to the feasible solution when the delay time corresponding to the feasible solution is smaller than the upper bound;
scheduling: taking the root node as a current node, executing a branching step, and taking a feasible solution with the corresponding delay time equal to an upper bound as a final scheduling result after execution is finished;
wherein, each node except the root node corresponds to a matching scheme of a task and an IT operation and maintenance service personnel; the current branch is the branch from the root node to the current node; on the current branch, the tasks in each node represent the assigned tasks, and the rest tasks are unassigned tasks; the delay time corresponding to a branch is the maximum value of the delay time of each task on the branch.
The invention uses the framework of the branch-and-bound algorithm to solve the scheduling scheme of the IT operation and maintenance service personnel, can obtain an accurate solution, effectively improves the solving precision, and cuts off the branches which cannot generate the optimal solution in the B & B tree by utilizing various effective pruning conditions in the solving process, and can effectively improve the solving speed, so that the invention can effectively solve the technical problems of long solving time and low precision of the existing scheduling scheme of the IT operation and maintenance service personnel.
Further, pruning conditions include at least one of:
r1: the IT operation and maintenance service personnel numbers in the nodes to be processed and the father nodes meet a preset first relation;
r2: an IT operation and maintenance service personnel in the node to be processed cannot complete tasks in the node to be processed;
R 3 ～ 7 : the feasible solution to which the branch to be pruned belongs is governed by other branches;
r8: all IT operation and maintenance service personnel with the IT operation and maintenance service personnel numbers in the nodes to be processed meeting the first relation cannot finish tasks in the unassigned task set corresponding to the nodes to be processed;
r9: the delay corresponding to the current branch is greater than or equal to the upper bound;
wherein, the numbers of any two IT operation and maintenance service personnel are different; the first relationship is no greater than or no less than.
Among the various pruning conditions proposed by the present invention, B can be made by pruning condition R1&In the B tree, the numbers of IT operation and maintenance service personnel corresponding to the child node and the father node keep the same size relation, so that the B is effectively deleted&Repeated branches in the B tree effectively improve the solving speed; b can be cut off in time by pruning condition R2&Branches of feasible solutions cannot be generated in the B tree, so that the solving speed is effectively improved; by pruning conditions R 3～7 Can cut off B in time&Branches which cannot generate the optimal feasible solution in the B tree can effectively improve the solving speed; b can be cut off in time through pruning condition R8&Branches of feasible solutions cannot be generated in the B tree, so that the solving speed is effectively improved; b can be cut off in time through pruning condition R9&And branches of the optimal feasible solution cannot be generated in the B tree, so that the solving speed is effectively improved. In general, the method can accurately solve the scheduling scheme of the IT operation and maintenance service personnel, effectively improve the solving speed and reduce the solving time through the pruning conditions.
Further, pruning stripPiece R 3～7 Comprising at least one of the following:
R 3～6 : in the task sequence distributed to IT operation and maintenance service personnel in the node to be processed, the delay time corresponding to the branch to be pruned is reduced after the two tasks exchange the distribution sequence;
r7: the node N exists, the delay time corresponding to the branch from the root node to the node N is smaller than the delay time corresponding to the current branch, and the delay time corresponding to the branch to be pruned is reduced after one task allocated to the IT operation and maintenance service personnel q is exchanged with one task allocated to the IT operation and maintenance service personnel s for the IT operation and maintenance service personnel s in the node to be processed and the IT operation and maintenance service personnel q in the node N.
Further, pruning conditions R 3～6 Comprising at least one of the following:
r3: in the task sequence that has been assigned to the operation and maintenance service person s in the node to be processed, task k follows task l,R j ＜S j -(p sl -p sk ) And at the same time satisfy p sk ＜p sl 、R k ≤S l And D k ≤max(S l +p sl ，D l )；
R4: in the task sequence assigned to the operation and maintenance service person s in the node to be processed, the task k follows the task l, and the task k is adjacent to the task l and satisfies R simultaneously k ≤S l And max (D) k ，S l +p sk )≤max(D l ，S l +p sl )；
R5: in the task sequence assigned to the operation and maintenance service person s in the node to be processed, task k follows task l and at the same time satisfies R k ≤S k And D l ＞S k +p sk +p sl ；
R6: in the task sequence allocated to the operation and maintenance service personnel s in the node to be processed, the idle time of the task k after the task l and before the task l is enough to complete the task k;
wherein p is sk And p sl Respectively represent the time required by IT operation and maintenance service personnel s to process task l and task k, R k Represents the release time of task k, S k And S is l Respectively represent the start time of task k and task l, D k And D l The deadlines for task k and task l are represented, respectively; task represents the set of tasks between Task l and Task k, R j And S is j The release time and the start time of the presentation task j are indicated, respectively.
Further, in the preprocessing step, initializing a delay time as an upper bound of the branch-and-bound algorithm, including the steps of:
(S1) sequencing all tasks according to the sequence from the smaller to the larger of the deadlines, and taking the first sequenced task as a task to be distributed;
(S2) when the task to be distributed is released, an idle IT operation and maintenance service personnel SET is obtained, IT operation and maintenance service personnel with minimum time required for processing the task to be distributed is selected from the SET, the task to be distributed is matched with the selected IT operation and maintenance service personnel, and the next idle time of the selected IT operation and maintenance service personnel is updated;
(S3) if the task to be allocated still exists, sequentially selecting the next task as a new task to be allocated, and transferring to the step (S2); otherwise, the maximum value in the delay time after each task is allocated is used as the upper bound of the branch-and-bound algorithm.
When the upper bound of the branch-and-bound algorithm is initialized, tasks with smaller deadlines are preferentially allocated based on heuristic rules, each task is allocated to an IT operation and maintenance service personnel which is idle and has the minimum time for processing the task during allocation, so that after all tasks are allocated, the delay time is smaller, the smaller delay time is used as the upper bound of the branch-and-bound algorithm, and branches which cannot generate optimal feasible solutions in B & B trees can be effectively cut off at the initial time, and the solving speed is further improved.
Further, in the preprocessing step, if a certain IT operation and maintenance service personnel cannot process a certain task, initializing the processing time of the IT operation and maintenance service personnel for processing the task to an infinite value; the infinite value is greater than the maximum processing time for which the task is normally processed.
When a certain IT operation and maintenance service personnel cannot process a certain task, the processing time of the IT operation and maintenance service personnel for processing the task is initialized to an infinite value, so that the situation that the IT operation and maintenance service personnel cannot process the distributed task can be identified through simple size comparison in the solving process, and branches which cannot generate feasible solutions can be timely cut off.
According to another aspect of the present invention, there is provided a computer readable storage medium comprising a stored computer program; when the computer program is executed by the processor, the equipment where the computer readable storage medium is located is controlled to execute the IT operation and maintenance service personnel scheduling method provided by the invention.
In general, through the above technical solutions conceived by the present invention, the following beneficial effects can be obtained:
(1) The invention uses the framework of the branch-and-bound algorithm to solve the scheduling scheme of the IT operation and maintenance service personnel, can obtain an accurate solution, effectively improves the solving precision, and cuts off the branches which cannot generate the optimal solution in the B & B tree by utilizing various effective pruning conditions in the solving process, and can effectively improve the solving speed, so that the invention can effectively solve the technical problems of long solving time and low precision of the existing scheduling scheme of the IT operation and maintenance service personnel.
(2) When the branch-and-bound algorithm is used for solving the scheduling problem of IT operation and maintenance service personnel, the used pruning conditions can timely cut off repeated branches in the B & B tree, branches unlikely to generate feasible solutions and branches unlikely to generate optimal feasible solutions, so that the solving speed is effectively improved, and the solving time is reduced.
(3) When the upper bound of the branch-and-bound algorithm is initialized, tasks with smaller deadlines are preferentially allocated, each task is allocated to an IT operation and maintenance service personnel which is idle and has the minimum time for processing the task during allocation, so that after all tasks are allocated, the delay time is smaller, the smaller delay time is used as the upper bound of the branch-and-bound algorithm, and branches which cannot generate optimal feasible solutions in B & B trees can be effectively cut off at the initial moment, and the solving speed is further improved.
(4) When a certain IT operation and maintenance service personnel cannot process a certain task, the processing time of the IT operation and maintenance service personnel for processing the task is initialized to an infinite value, so that the situation that the IT operation and maintenance service personnel cannot process the distributed task can be identified through simple size comparison in the solving process, and branches which cannot generate feasible solutions can be timely cut off.
Drawings
FIG. 1 is a flowchart of a method for scheduling IT operation and maintenance service personnel according to an embodiment of the present invention;
fig. 2 is a schematic diagram of pruning steps according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a B & B tree structure according to an embodiment of the present invention;
fig. 4 is a schematic diagram of pruning conditions according to an embodiment of the present invention; wherein, (a) is a proof schematic diagram of a pruning condition R3, (b) is a proof schematic diagram of a pruning condition R5, (c) is a proof schematic diagram of a pruning condition R6, and (d) is a proof schematic diagram of a pruning condition R7;
FIG. 5 is a flowchart of a method for initializing an upper bound of a branch-and-bound algorithm based on heuristic rules provided by an embodiment of the present invention;
fig. 6 is a schematic diagram of a branch-and-bound procedure in an application example provided in an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention. In addition, the technical features of the embodiments of the present invention described below may be combined with each other as long as they do not collide with each other.
In the present invention, the terms "first," "second," and the like in the description and in the drawings, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order.
In order to solve the technical problems of long solving time and low precision of the existing IT operation and maintenance service personnel scheduling method, the invention provides the IT operation and maintenance service personnel scheduling method, and the whole thought of the method is as follows: the scheduling scheme of IT operation and maintenance service personnel is solved by using a framework of a branch-and-bound algorithm, so that an accurate solution can be obtained, the solving precision is effectively improved, and branches which cannot generate an optimal solution in a B & B tree are cut off by using various effective pruning conditions in the solving process, so that the solving speed can be effectively improved.
The following are examples.
Example 1:
an IT operation and maintenance service personnel scheduling method, as shown in figure 1, comprises the following steps:
pretreatment: acquiring release time and deadline of each task and processing time of each task processed by each IT operation and maintenance service personnel, initializing a root node of a B & B tree in a branch-and-bound algorithm, and initializing a delay time as an upper bound of the branch-and-bound algorithm;
pruning: taking branches from the root node to the node to be processed as branches to be pruned, and deleting the node to be processed from the B & B tree if the branches to be pruned meet any one preset pruning condition; the specific process of the pruning step is shown in figure 2;
branching: acquiring an unassigned task set corresponding to a current node, if the unassigned task set is not empty, performing one-to-one matching on each task in the unassigned task set and all IT operation and maintenance service personnel, using the tasks as child nodes of the current node, performing the pruning step on each child node, and sequentially using the child nodes of which the current node is not deleted as new current nodes to re-perform the branching step; if the unassigned task set is empty, forming a feasible solution by a matching scheme corresponding to each node on the current branch, and updating the upper bound to the delay time corresponding to the feasible solution when the delay time corresponding to the feasible solution is smaller than the upper bound;
scheduling: taking the root node as a current node, executing a branching step, and taking a feasible solution with the corresponding delay time equal to an upper bound as a final scheduling result after execution is finished;
wherein, each node except the root node corresponds to a matching scheme of a task and an IT operation and maintenance service personnel; the current branch is the branch from the root node to the current node; on the current branch, the tasks in each node represent the assigned tasks, and the rest tasks are unassigned tasks; the delay time corresponding to the branch is the maximum value of the delay time of each task on the branch; the root node has no actual meaning and only represents the beginning of a branch.
According to the method, the scheduling scheme of the IT operation and maintenance service personnel is solved by using the framework of the branch-and-bound algorithm, an accurate solution can be obtained, the solving precision is effectively improved, branches which cannot generate the optimal solution in the B & B tree are cut off by using various effective pruning conditions in the solving process, and the solving speed can be effectively improved, so that the technical problems of long solving time and low precision of the scheduling scheme of the IT operation and maintenance service personnel in the prior art can be effectively solved.
The time for each IT operation and maintenance service personnel to process each task can be correspondingly determined according to the skill required by the task, whether the IT operation and maintenance service personnel have corresponding skills and the proficiency of the corresponding skills; if the IT operation and maintenance service personnel do not have the skills required for processing a certain task, the IT operation and maintenance service personnel cannot process the task; if the IT operation and maintenance service personnel have the skills required for processing a certain task, the IT operation and maintenance service personnel can process the task, and the more skilled the skills of the IT operation and maintenance service personnel are, the less time is required for processing the task;
as an optional implementation manner, in the preprocessing step of this embodiment, if a certain IT operation and maintenance service person cannot process a certain task, the processing time of the IT operation and maintenance service person for processing the task is initialized to an infinite value; the infinite value is greater than the maximum processing time for which the task is normally processed; in practical application, the infinite value can be determined according to the practical application scene, and in this embodiment, the infinite value is denoted as MAX;
in order to effectively prune the B & B tree during the branch-and-bound process to increase the solving speed, optionally, in this embodiment, the pruning condition includes at least one of the following:
r1: the IT operation and maintenance service personnel numbers in the nodes to be processed and the father nodes meet a preset first relation; alternatively, in this embodiment, the first relationship is not greater than the pruning condition R1 and may be expressed asNode i represents the node to be processed, staff i Represents the IT operation and maintenance service personnel number, o in node i i Representing the parent node of node i,parent node o representing node i i The IT operation and maintenance service personnel number in (a); in other embodiments of the present invention, the first relationship may also be set to be not smaller than;
r2: the IT operation and maintenance service personnel in the node to be processed cannot complete the task in the node to be processed, namelyWherein staff is i Representing IT operation and maintenance service personnel numbers and tasks in node i i Representing the task number in node i;
R 3～7 : the feasible solution to which the branch to be pruned belongs is governed by other branches;
r8: all IT operation and maintenance service personnel with the IT operation and maintenance service personnel number meeting the first relation in the node to be processed cannot complete tasks in the unassigned task set corresponding to the node to be processed, namely p i′j ＝0，U i Representing an unassigned task set corresponding to node i;
r9: the delay corresponding to the current branch is greater than or equal to the upper bound, i.eM α Representing all task sets, U i Representing an unassigned set of tasks corresponding to node i, M α /U i Representing the assigned task set corresponding to node i, T j (σ i ) Represented in the partial scheduling scheme sigma i UB is the current upper bound;
wherein, the numbers of any two IT operation and maintenance service personnel are different; the first relationship is no greater than or no less than.
The B & B tree is a branch tree, each node in the B & B tree corresponds to a partial scheduling scheme of a task, k tasks are scheduled at the front end of a complete scheduling scheme in a k layer of the B & B tree, each node represents that a combination of one task and IT operation and maintenance service personnel is added into the partial scheduling scheme of a parent node, different sub-nodes are formed by selecting different combinations, namely, a branching process in a branching and delimiting algorithm, the branching number of each node in the k layer is S (M-k), wherein S is the total staff number, and M is the total task number. Taking two tasks (respectively denoted as task 1 and task 2) and two IT operation and maintenance service personnel (respectively denoted as IT operation and maintenance service personnel 1 and IT operation and maintenance service personnel 2) as examples, the generation process of the B & B tree is as follows: firstly, initializing a Root node (Root), wherein the Root node has no actual meaning and only represents the beginning of a branch; for the Root node, the unassigned task set is { task 1, task 2}, each task in the set is matched with all IT operation and maintenance service personnel one by one, 4 matching results are obtained, namely (1, 1), (1, 2), (2, 1) and (2, 2), and each matching result is used as a child node of the Root node Root, as shown in FIG. 3; wherein (m, s) represents assigning task m to IT operation and maintenance service personnel s;
for the first child node (1, 1) of the Root node Root, the corresponding assigned task set and unassigned task set are {1} and {2}, and for each task in the unassigned task set, matching IT with all IT operation and maintenance service personnel one by one to obtain 2 matching results, namely (2, 1) and (2, 2), respectively, wherein each matching result is used as one child node of the node (1, 1), as shown in FIG. 3; for the first child node (2, 1) of the node (1, 1), the corresponding unassigned task set is empty, indicating that all tasks have been assigned to end at this time;
the rest child nodes of the Root node Root are processed in the same way, so that a complete B & B tree can be generated, as shown in fig. 3.
In the B & B tree, if the size relation of the IT operation and maintenance service personnel numbers corresponding to the child node and the father node is inconsistent, repeated branches are generated; for example, in the B & B tree shown in fig. 3, branches { (1, 1), (2, 2) } and branches { (2, 2), (1, 1) } are repetitive branches, branches { (1, 2), (2, 1) } and branches { (2, 1), (1, 2) } are repetitive branches; therefore, according to the pruning condition R1, the numbers of IT operation and maintenance service personnel corresponding to child nodes and father nodes in the B & B tree can be kept in the same size relation, so that repeated branches in the B & B tree are effectively deleted, and the solving speed is effectively improved;
for the pruning condition R2, if the IT operation and maintenance service personnel corresponding to the node to be processed cannot complete the task corresponding to the node to be processed, the branch corresponding to the node to be processed cannot generate a feasible solution, so that the branch which cannot generate the feasible solution in the B & B tree can be timely pruned through the pruning condition R2, and the solving speed is effectively improved;
the feasible solution to which the branch to be pruned belongs is governed by other branches, namely that under the condition that the branch to be pruned can generate the feasible solution, other branches which can generate the feasible solution and are superior to the branch to be pruned exist, so that the feasible solution generated by the branch to be pruned is not the optimal feasible solution; thus, by pruning condition R 3～7 Can cut off B in time&Branches which cannot generate the optimal feasible solution in the B tree can effectively improve the solving speed;
branches which cannot possibly generate feasible solutions in the B & B tree can be timely cut off through the pruning condition R8, so that the solving speed is effectively improved;
branches which cannot generate the optimal feasible solution in the B & B tree can be timely cut off through the pruning condition R9, and the solving speed is effectively improved.
In general, the above pruning conditions R1, R2, R are set forth by this embodiment 3～7 R8 and R9, the method can effectively improve the solving speed and reduce the solving time while accurately solving the scheduling scheme of IT operation and maintenance service personnel.
Alternatively, pruning conditions R 3～7 Comprising at least one of the following:
R 3-6 : in the task sequence distributed to IT operation and maintenance service personnel in the node to be processed, the delay time corresponding to the branch to be pruned is reduced after the two tasks exchange the distribution sequence;
r7: the method comprises the steps that a node N exists, delay time corresponding to branches from a root node to the node N is smaller than delay time corresponding to current branches, and for IT operation and maintenance service personnel s in a node to be processed and IT operation and maintenance service personnel q in the node N, after one task allocated to the IT operation and maintenance service personnel q is exchanged with one task allocated to the IT operation and maintenance service personnel s, delay time corresponding to branches to be pruned is reduced;
further alternatively, pruning conditions R 3～6 Comprising at least one of the following:
r3: in the Task sequence assigned to the corresponding operation and maintenance service person s of the node to be processed, the Task k follows the Task l, the set Task represents the Task between the Task 1 and the Task k,R j ＜S j -(p sl -p sk ) And at the same time satisfy p sk ＜p sl 、R k ≤S l And D k ≤max(S l +p sl ，D l )；
R4: in the task sequence allocated to the operation and maintenance service personnel s corresponding to the node to be processed, the task k follows the task l, and the task k is adjacent to the task l and simultaneously satisfies R k ≤S l And max (D) k ，S l +p sk )≤max(D l ，S l +p sl )；
R5: at the position allocated to the section to be processedIn the task sequence of the operation and maintenance service personnel s corresponding to the point, the task k follows the task l and simultaneously meets R k ≤S k And D l ＞S k +p sk +p sl ；
R6: in the task sequence assigned to the corresponding operation and maintenance service person s of the node to be processed, the task k follows the task l and the idle time before the task l is enough to complete the task k, namely
Wherein p is sk And p sl Respectively represent the time required by IT operation and maintenance service personnel s to process task l and task k, R k And R is l Represent release times of task k and task l, S k And S is l Respectively represent the start time of task k and task l, D k And D l The deadlines for task k and task l are represented, respectively; task represents the set of tasks between Task l and Task k, R j And S is j Respectively representing the release time and the start time of the task j; o (o) i Representing the parent node, σ, of node i i Representing a partial scheduling scheme corresponding to a branch from a root node to node i, C s (σ i ) Represented in the partial scheduling scheme sigma i The time when each employee s completes the last task assigned;
for the pruning condition R3 above, after exchanging task l and task k, the delay of the branch to be pruned will be reduced, and the correlation proves as follows:
the Task between Task l and Task k is denoted as set Task, sinceR j ＜S j -(p sk -p sl ) The task between the task I and the task K can move forward integrally to meet the release time requirement of the task, and the delay change before and after the exchange of the task 1 and the task K is assumed to be delta T respectively l ，ΔT k
ΔT l ＝max(0，S l +p sl -D l )-max(0，F k -D l )
＝max(S l +p sl ，D l )-max(F k ，D l )
ΔT k ＝max(0，F k -D k )-max(0，S l +p sk -D k )
＝max(F k ，D k )-max(S l +p sk ，D k )
Case one: when S is l +p sl ＞D l ，D k ≤S l +p sl
Because of D l ＜F l ≤F k ，D k ＜F l ≤F k ，F k And F l The order time of task k and task l are respectively represented;
ΔT l +ΔT k ＝max(S l +p sl ，D l )-max(F k ，D l )+max(F k ，D k )-max(S l +p sk ，D k )＝max(S l +p sl ，D l )-max(S l +p sk ，D k )
＝S l +p sl -max(S l +p sk ，D k )
when S is l +p sk ＞D k At DeltaT l +ΔT k ＝S l +p sl -S l -p sk ＞0
When S is l +p sk ≤D k At DeltaT l +ΔT k ＝S l +p sl -D k ＞0
Therefore, in the case of DeltaT l +ΔT k ＞0
And a second case: when S is l +p sl ≤D l ，d k ≤D l
D k ≤D l ≤F k
ΔT l +ΔT k ＝max(S l +p sl ，D l )-max(F k ，D l )+max(F k ，D k )-max(S l +p sk ，D k )＝max(S l +p sl ，D l )-max(S l +p sk ，D k )
＝D l -max(S l +p sk ，D k )
When S is l +p sk ＞D k At DeltaT l +ΔT k ＝D l -S l -p sk ＞0
When S is l +p sk ≤D k At DeltaT l +ΔT k ＝D l -D k ＞0
D k ≤F k ≤D l
ΔT l +ΔT k ＝max(S l +p sl ，D l )-max(F k ，D l )+max(F k ，D k )-max(S l +p sk ，D k )＝F k +max(S l +p sk ，D k )＞0
F k ≤D k ≤D l
ΔT l +ΔT k ＝max(S l +p sl ，D l )-max(F k ，D l )+max(F k ，D k )-max(S l +p sk ，D k )＝D k -max(S l +p sk ，D k )＞0
In case two, deltaT l +ΔT k ＞0
Therefore, when the pruning condition is met, another scheme exists, so that the delay of the task l and the task k is reduced, and the delay of the task between the task l and the task k is correspondingly reduced, because the completion time of the task k after the exchange is smaller than that of the task l; when the branch to be pruned satisfies the above pruning condition R3, the relationship between the task i and the task k before and after the exchange is as shown in fig. 4 (a).
For the pruning condition R5 above, after exchanging task i and task k, the delay of the branch to be pruned will be reduced, and the correlation is proved as follows:
by FN k Indicating the completion time of task k after the exchange, assuming that the delay changes before and after the exchange of task l and task k are respectively DeltaT l ，ΔT k Due to R k ≤S k Task k completes in advance so ΔT k ＞0，
Because of D l ＞S k +p sk +p sl ≥F k ＞S l +p sl
ΔT l ＝max{0，S l +p sl -D l }-max{0，FN k +p sl -D l }
＝max{S l +p sl ，D l }-max{FN k +p sl ，D l }＝0
The delay between task l and task k will be reduced or unchanged, and overall, the maximum delay after movement will be less than the delay before movement, and there is one solution over the current solution; when the branch to be pruned satisfies the above pruning condition R5, the relationship between the task i and the task k before and after the exchange is as shown in fig. 4 (b).
For the pruning condition R6 above, after exchanging task i and task k, the delay of the branch to be pruned will be reduced, and the correlation is proved as follows:
in this case, the delay of the task k becomes smaller, the delay of the task l becomes unchanged, and the delay of the task after the employee task k becomes smaller, so that the situation after the task k moves dominates the original situation, and branches of the current node can be pruned; when the branch to be pruned satisfies the above pruning condition R5, the relationship between the task i and the task k before and after the exchange is as shown in fig. 4 (c).
For the above pruning condition R7, the tasks assigned to the IT operation and maintenance service personnel s and the IT operation and maintenance service personnel q are represented by k and l, respectively, then the pruning condition R7 can be represented as task k and task l satisfying R simultaneously k ≤S l 、R l ≤S k 、p sk ≤p qk 、p ql ≤p sl 、T l (σ i )≥T l (σ i ′)、T k (σ i )≥T k (σ i ′)，σ i Representing the partial scheduling scheme prior to switching, sigma i ' means the partial scheduling scheme after switching, T l (σ i ) And T k (σ i ) Respectively represent the delays of tasks k and l in the partial scheduling scheme, T l (σ i ') and T k (σ i ') respectively represent the partial scheduling schemes sigma i Delay of tasks k and l in'; when the node to be processed meets the pruning condition R7, the delay of the task k and the task l can be reduced by exchanging the tasks k and l, and the correlation proves as follows:
the delay of the task I and the task K after the exchange is reduced, the task delay before the task I is unchanged, the task delay after the task I is reduced, and the same as the employee q, so that when R7 is satisfied, a solution is superior to an original solution, the original solution is dominant, and pruning can be performed; when the branch to be pruned satisfies the above pruning condition R5, the relationship between the task i and the task k before and after the exchange is as shown in (d) of fig. 4.
In order to further increase the solving speed, as an alternative implementation manner, in the preprocessing step of the present embodiment, as shown in fig. 5, a delay time is initialized as an upper bound of the branch-and-bound algorithm, and the method includes the following steps:
(S1) sequencing all tasks according to the sequence from the smaller to the larger of the deadlines, and taking the first sequenced task as a task to be distributed;
(S2) when the task to be allocated is released, an idle IT operation and maintenance service personnel SET SET is obtained, IT operation and maintenance service personnel with minimum time required for processing the task to be allocated is selected from the SET SET, the task to be allocated is allocated to the selected IT operation and maintenance service personnel, and the next idle time of the selected IT operation and maintenance service personnel is updated;
(S3) if the task to be allocated still exists, sequentially selecting the next task as a new task to be allocated, and transferring to the step (S2); otherwise, the corresponding delay time after each task is allocated is used as the upper bound of the branch-and-bound algorithm.
In the embodiment, when initializing the upper bound of the branch-and-bound algorithm, tasks with smaller deadlines are preferentially allocated based on heuristic rules, each task is allocated to an IT operation and maintenance service personnel with the minimum time required for processing the task and idle during allocation, so that after all tasks are allocated, the delay time is smaller, the smaller delay time is used as the upper bound of the branch-and-bound algorithm, and branches which cannot generate the optimal feasible solution in the B & B tree can be effectively cut off at the initial time, thereby further improving the solving speed.
Example 2:
a computer readable storage medium comprising a stored computer program; when the computer program is executed by the processor, the device where the computer readable storage medium is located is controlled to execute the IT operation and maintenance service personnel scheduling method provided in the above embodiment 1.
The method for scheduling IT operation and maintenance service personnel provided in the above embodiment 1 will be further described below by taking a simple application scenario as an example. Under the application scene, 2 IT operation and maintenance service personnel and 5 tasks are provided, and after the preprocessing step, the release time of each task is R l = {1,0,3,2,0}, the deadline of each task is D l = {4,3,5,5,2}, the time required for each employee to process each task is represented as a matrix, and the processing time matrix may be represented asWherein if the completion time of a certain task is MAX, the employee cannot complete the task;
based on the release time, the deadline and the processing time matrix of each task, initializing an upper bound of a branch-and-bound algorithm, wherein the specific process is as follows:
the task sequence after the task is sequenced according to the deadline is 5,2,1,3,4, IT operation and maintenance service personnel are sequentially arranged for each task, IT operation and maintenance service personnel 2 are arranged for the task 5 according to the provided rule, IT operation and maintenance service personnel 2 are arranged for the task 2, IT operation and maintenance service personnel 1 are arranged for the task 1, IT operation and maintenance service personnel 2 are arranged for the task 3, IT operation and maintenance service personnel 2 are arranged for the task 4, and finally the maximum obtainable delay is 1, so that the maximum obtainable delay is used as the upper bound initial value of a branch and bound algorithm;
after initializing a root node root of the B & B tree, executing a branching step on the root node root, and performing one-to-one matching on 5 tasks and 2 IT operation and maintenance service personnel to obtain 10 child nodes of the root node root, namely (t 2, s 1), (t 5, s 1), (t 1, s 1), (t 3, s 1), (t 4, s 1), (t 2, s 2), (t 5, s 2), (t 1, s 2), (t 3, s 2), (t 4, s 2), wherein the node (tn, sm) represents that the task n is allocated to the employee m as shown in fig. 6; performing pruning steps on 10 child nodes of the root node root, wherein staff 1 cannot complete task 2 and task 4, staff 2 cannot complete task 1, so nodes (t 2, s 1), (t 4, s 1), (t 1, s 2) satisfy pruning condition R2, and in addition (t 2, s 2), (t 3, s 2), (t 4, s 2), (t 5, s 2) satisfy pruning condition R8, (t 3, s 1) satisfy pruning condition R9, and after deleting these nodes accordingly, the root node root only has 2 child nodes, (t 5, s 1) and (t 1, s 1), as shown in fig. 6;
executing a branching step on the node (t 5, s 1), wherein the corresponding unassigned task set is {1,2,3,4}, performing one-to-one matching on 4 tasks in the branching step and 2 operation and maintenance service personnel to obtain 8 child nodes of the node (t 5, s 1), (t 2, s 2), (t 1, s 1), (t 1, s 2), (t 4, s 1), (t 4, s 2), (t 3, s 1), (t 3, s 2), and deleting all other nodes except the node (t 1, s 1) after executing the pruning step on each child node;
and the like, the branches and pruning are continuously carried out, the specific conditions of the branches and the pruning are shown in fig. 6, the maximum delay time of each task is 0 through updating the upper bound of a branch-and-bound algorithm, corresponding feasible solutions are (t 5, s 1), (t 1, s 1), (t 2, s 2), (t 4, s 2) and (t 3, s 2), and the task allocation scheme represented by the feasible solutions is the scheduling result of IT operation and maintenance service personnel in the application scene. In combination with the final delay time, the delay time is improved on the basis of the initial upper bound, and the problem is an accurate solution.
It will be readily appreciated by those skilled in the art that the foregoing description is merely a preferred embodiment of the invention and is not intended to limit the invention, but any modifications, equivalents, improvements or alternatives falling within the spirit and principles of the invention are intended to be included within the scope of the invention.
Claims (6)
1. The IT operation and maintenance service personnel scheduling method is characterized by comprising the following steps of:
pretreatment: acquiring release time and deadline of each task and processing time of each task processed by each IT operation and maintenance service personnel, initializing a root node of a B & B tree in a branch-and-bound algorithm, and initializing a delay time as an upper bound of the branch-and-bound algorithm;
pruning: taking the branch from the root node to the node to be processed as a branch to be pruned, and deleting the node to be processed from the B & B tree if the branch to be pruned meets any one preset pruning condition;
branching: acquiring an unassigned task set corresponding to a current node, if the unassigned task set is not empty, performing one-to-one matching on each task in the unassigned task set and all IT operation and maintenance service personnel, using the tasks as child nodes of the current node, performing the pruning step on each child node, and sequentially using the child nodes of which the current node is not deleted as new current nodes to re-perform the branching step; if the unassigned task set is empty, forming a feasible solution by a matching scheme corresponding to each node on the current branch, and updating the upper bound to the delay time corresponding to the feasible solution when the delay time corresponding to the feasible solution is smaller than the upper bound;
scheduling: taking the root node as a current node, executing the branching step, and taking a feasible solution with the corresponding delay time equal to the upper bound as a final scheduling result after the execution is finished;
wherein, each node except the root node corresponds to a matching scheme of a task and an IT operation and maintenance service personnel; the current branch is the branch from the root node to the current node; on the current branch, the tasks in each node represent the assigned tasks, and the rest tasks are unassigned tasks; the delay time corresponding to the branch is the maximum value of the delay time of each task on the branch; the pruning conditions include at least one of the following:
r1: the IT operation and maintenance service personnel numbers in the nodes to be processed and the father nodes meet a preset first relation;
r2: an IT operation and maintenance service personnel in the node to be processed cannot complete tasks in the node to be processed;
R 3～7 : the feasible solution of the branch to be pruned is governed by other branches;
r8: all IT operation and maintenance service personnel with the IT operation and maintenance service personnel numbers in the nodes to be processed meeting the first relation cannot complete tasks in an unassigned task set corresponding to the nodes to be processed;
r9: the delay corresponding to the current branch is greater than or equal to the upper bound;
wherein, the numbers of any two IT operation and maintenance service personnel are different; the first relationship is no greater than or no less than.
2. The IT operation and maintenance service personnel scheduling method according to claim 1, wherein the pruning condition R 3～7 Comprising at least one of the following:
R 3～6 : in the task sequence distributed to the IT operation and maintenance service personnel in the node to be processed, the delay time corresponding to the branch to be pruned is reduced after the two tasks exchange the distribution sequence;
r7: and when the delay time corresponding to the branch from the root node to the node N is smaller than the delay time corresponding to the current branch, and for the IT operation and maintenance service personnel s in the node to be processed and the IT operation and maintenance service personnel q in the node N, after one task allocated to the IT operation and maintenance service personnel q is exchanged with one task allocated to the IT operation and maintenance service personnel s, the delay time corresponding to the branch to be pruned is reduced.
3. The IT operation and maintenance service personnel scheduling method according to claim 2, wherein the pruning condition R 3～6 Comprising at least one of the following:
r3: operation and maintenance in the nodes allocated to the processingIn the task sequence of service person s, task k follows task l,R j <S j -(p sl -p sk ) And at the same time satisfy p sk <p sl 、R k ≤S l And D k ≤max(S l +p sl ,D l )；
R4: in the task sequence assigned to the operation and maintenance service personnel s in the node to be processed, the task k follows the task l, and the task k is adjacent to the task l and simultaneously satisfies R k ≤S l And max (D) k ，S l +p sk )≤max(D l ，S l +p sl )；
R5: in the task sequence assigned to the service person s in the node to be processed, task k follows task l and at the same time satisfies R k ≤S k And D l >S k +p sk +p sl ；
R6: in the task sequence allocated to the operation and maintenance service personnel s in the node to be processed, the task k follows the task l, and the idle time before the task l is enough to complete the task k;
wherein p is sk And p sl Respectively represent the time required by IT operation and maintenance service personnel s to process task l and task k, R k Represents the release time of task k, S k And S is l Respectively represent the start time of task k and task l, D k And D l The deadlines for task k and task l are represented, respectively; task represents the set of tasks between Task l and Task k, R j And S is j The release time and the start time of the presentation task j are indicated, respectively.
4. The IT operation and maintenance attendant scheduling method of any one of claims 1-3, wherein in said preprocessing step, a delay time is initialized as an upper bound of a branch-and-bound algorithm, comprising the steps of:
(S1) sequencing all tasks according to the sequence from the smaller to the larger of the deadlines, and taking the first sequenced task as a task to be distributed;
(S2) when the task to be distributed is released, an idle IT operation and maintenance service personnel SET is obtained, IT operation and maintenance service personnel with minimum time required for processing the task to be distributed is selected from the SET, the task to be distributed is matched with the selected IT operation and maintenance service personnel, and the next idle time of the selected IT operation and maintenance service personnel is updated;
(S3) if the task to be allocated still exists, sequentially selecting the next task as a new task to be allocated, and transferring to the step (S2); otherwise, the maximum value in the delay time of each task is used as the upper bound of the branch-and-bound algorithm.
5. The IT operation and maintenance service personnel scheduling method according to any one of claims 1 to 3, wherein in the preprocessing step, if a certain IT operation and maintenance service personnel cannot process a certain task, the processing time of the IT operation and maintenance service personnel for processing the task is initialized to an infinite value; the infinite value is greater than the maximum processing time for which the task is normally processed.
6. A computer readable storage medium comprising a stored computer program; when the computer program is executed by a processor, the computer readable storage medium is controlled to execute the IT operation and maintenance service personnel scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110227365.8A CN113095618B (en) | 2021-03-01 | 2021-03-01 | IT operation and maintenance service personnel scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110227365.8A CN113095618B (en) | 2021-03-01 | 2021-03-01 | IT operation and maintenance service personnel scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113095618A CN113095618A (en) | 2021-07-09 |
| CN113095618B true CN113095618B (en) | 2024-04-02 |
Family
ID=76667673
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110227365.8A Active CN113095618B (en) | 2021-03-01 | 2021-03-01 | IT operation and maintenance service personnel scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113095618B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113780745B (en) * | 2021-08-16 | 2024-05-14 | 华中科技大学 | IT personnel scheduling method and system driven by door-to-door service demand |
| CN114358506B (en) * | 2021-12-09 | 2022-09-30 | 广东精工智能系统有限公司 | Task allocation method and system for intelligent transformation service platform |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107317872A (en) * | 2017-07-20 | 2017-11-03 | 河海大学 | The dispatching method of polymorphic type task in a kind of space mass-rent |
| CN107491863A (en) * | 2017-07-28 | 2017-12-19 | 东北大学 | A kind of branch and bound method that initial lower bound beta pruning is used based on straight-line code mode |
| CN107730085A (en) * | 2017-09-19 | 2018-02-23 | 电子科技大学 | A kind of multi-functional radar network mission planning method based on branch and bound method |
| CN110413238A (en) * | 2019-07-12 | 2019-11-05 | 东南大学 | A kind of 3D printing method for scheduling task based on optimization backtracking algorithm |
-
2021
- 2021-03-01 CN CN202110227365.8A patent/CN113095618B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107317872A (en) * | 2017-07-20 | 2017-11-03 | 河海大学 | The dispatching method of polymorphic type task in a kind of space mass-rent |
| CN107491863A (en) * | 2017-07-28 | 2017-12-19 | 东北大学 | A kind of branch and bound method that initial lower bound beta pruning is used based on straight-line code mode |
| CN107730085A (en) * | 2017-09-19 | 2018-02-23 | 电子科技大学 | A kind of multi-functional radar network mission planning method based on branch and bound method |
| CN110413238A (en) * | 2019-07-12 | 2019-11-05 | 东南大学 | A kind of 3D printing method for scheduling task based on optimization backtracking algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 多技能资源时间窗约束下可中断项目调度的分支定界算法;刘振元;系统工程理论与实践;第39卷(第1期);183-199 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113095618A (en) | 2021-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113095618B (en) | IT operation and maintenance service personnel scheduling method | |
| CN113034015B (en) | Airport check-in personnel scheduling method based on constraint relaxation solving | |
| CN104866374B (en) | Discrete event parallel artificial and method for synchronizing time based on multitask | |
| CN109409763B (en) | Dynamic test task scheduling method and scheduling platform based on greedy grouping strategy | |
| CN110276481B (en) | Distributed hybrid pipeline scheduling optimization method | |
| CN104731657B (en) | A kind of resource regulating method and system | |
| CN110221907B (en) | Real-time task scheduling method based on EDF algorithm and fuzzy set | |
| CN103679388B (en) | Production scheduling method and production scheduling system | |
| CN109857532A (en) | DAG method for scheduling task based on the search of Monte Carlo tree | |
| CN115564242A (en) | Ship power equipment-oriented scheduling method and system for preemptible task maintenance personnel | |
| Santos et al. | A weighted constraint optimization approach to the nurse scheduling problem | |
| Li et al. | An artificial bee colony algorithm for the distributed hybrid flowshop scheduling problem | |
| CN111242446A (en) | Workshop scheduling method based on GA-TS hybrid algorithm | |
| CN111061565A (en) | Two-stage pipeline task scheduling method and system in Spark environment | |
| CN108830486A (en) | A kind of maintenance method for scheduling task, device and equipment for power communication | |
| CN113919688B (en) | Logistics park approach vehicle dynamic scheduling method considering late arrival | |
| CN109167713A (en) | A kind of mixed scheduling method of CAN bus control network | |
| Zhang et al. | Promise surgery start times and implementation strategies | |
| CN113946440A (en) | Resource scheduling method in green cloud environment | |
| Kuznetsov et al. | Optimization algorithms in scheduling problems of the rail transport | |
| CN113010319A (en) | Dynamic workflow scheduling optimization method based on hybrid heuristic rule and genetic algorithm | |
| CN114021895A (en) | Method and system for scheduling IT operation and maintenance personnel with minimized total cost based on neighborhood structure | |
| CN117130757A (en) | Automatic scheduling and distributing method for resource engine based on live three-dimensional task | |
| Eder et al. | A probabilistic approach to reduce the number of deadline violations and the tardiness of workflows | |
| TW200412518A (en) | Front end dispatching method and system for long batch processing equipment in semiconductor manufacturing |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |