CN111967766A - Performance indicator-based serial task assignment method - Google Patents
Performance indicator-based serial task assignment method Download PDFInfo
- Publication number
- CN111967766A CN111967766A CN202010829625.4A CN202010829625A CN111967766A CN 111967766 A CN111967766 A CN 111967766A CN 202010829625 A CN202010829625 A CN 202010829625A CN 111967766 A CN111967766 A CN 111967766A
- Authority
- CN
- China
- Prior art keywords
- task
- tasks
- personnel
- assignment
- time
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000004519 manufacturing process Methods 0.000 claims abstract description 29
- 238000013461 design Methods 0.000 claims abstract description 12
- 238000012163 sequencing technique Methods 0.000 claims abstract description 3
- 239000003086 colorant Substances 0.000 claims description 4
- 238000012937 correction Methods 0.000 claims description 4
- 238000007405 data analysis Methods 0.000 abstract description 3
- 230000001915 proofreading effect Effects 0.000 description 11
- 238000004364 calculation method Methods 0.000 description 7
- 238000007726 management method Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 230000002457 bidirectional effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 238000012856 packing Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 230000002194 synthesizing effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
- G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- General Factory Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the field of enterprise production management software, in particular to a performance index-based serial task assignment method. The invention assigns elevator design and production tasks by constructing a performance index coefficient model, and comprises the following steps: establishing tasks for production and design, wherein a plurality of tasks form a task chain, and a plurality of task chains form a task chain set; establishing a serial structure relationship of task chains; setting standard task working hours; establishing a performance index coefficient model of the difficulty level of the individual task; establishing a task dispatching queue with priority condition sequencing; task allocation is carried out according to the performance index coefficient model and the task allocation queue, and an allocated result is obtained; and visualizing the result after the assignment. The invention obtains the task assignment result with the minimum average working hour under the priority condition through automatic learning and big data analysis.
Description
Technical Field
The invention relates to the field of enterprise production management software, in particular to a performance index-based task assignment method with priority conditions.
Background
The information construction of enterprise production management is realized through IT planning construction such as a data architecture, a flow architecture, an application architecture, a platform architecture and the like, and production task assignment and management inevitably occur in the flow architecture.
Task assignment in the elevator assembly and manufacturing field, the task assignment is completed in a management platform through manual operation, intervention and the like. The task assignment is carried out manually, when the business volume of a production enterprise is in a certain scale and the task type is complicated, the evaluation on the individual productivity of production personnel cannot be carried out effectively and accurately, the productivity of the individual personnel is estimated according to the experience of the assignment personnel, a large amount of time idle and personnel idle are generated in the task assignment process, the assignment of the task cannot be displayed effectively and adjusted timely, the production efficiency generated by scientific and accurate calculation cannot be achieved, and the production activity is carried out at lower efficiency.
Disclosure of Invention
In view of the technical deficiencies, the invention aims to provide a multi-task and multi-person global minimum average man-hour task assignment algorithm based on individual task performance indicators and task priority conditions. The algorithm can optimize the production overall management capacity of the enterprise.
The big data analysis and automatic learning technology is applied to construct a performance index coefficient self-adaptive learning model accurate to individuals, each task and each production action, the model is used as an entity of a data architecture, the model can effectively calculate real productivity, is different from a traditional 'unified calculation index coefficient', and solves the problems that personnel individual skill difference cannot be reflected, and real production capacity cannot be obtained.
The flow architecture realizes closed loop between flow control and data response through a plurality of methods such as data architecture, local optimal solution, closed loop feedback and the like, realizes automatic learning and realizes productivity optimization.
The technical scheme adopted by the invention for realizing the purpose is as follows: a serial task assignment method based on performance indicators assigns and displays elevator design and production tasks by constructing a performance indicator coefficient model on a server, and comprises the following steps:
1) establishing tasks for elevator design and production, wherein a plurality of tasks form a task chain, and a plurality of task chains form a task chain set;
2) establishing a serial structure relationship of task chains;
3) setting task standard working hours, wherein the task standard working hours are represented as TM (z, y), z represents a certain task chain, and y represents a certain task contained in the task chain;
4) according to the tasks of elevator design and production, a performance index coefficient model of individual task difficulty level is established and expressed as S (n, l, t) kpi, wherein n represents personnel, l represents difficulty level, and t represents task type;
5) establishing a task dispatching queue with priority condition sequencing;
6) task allocation is carried out according to the task standard working hours, the performance index coefficient model and the task allocation queue, and an allocated result is obtained;
7) and visualizing the result after the assignment.
The establishing a task dispatch queue comprises:
establishing a task queue T (i, y) according to a set priority condition, wherein i represents a current task chain, and y represents a certain task contained in the task chain;
a personnel assignment queue, denoted S (n)0，...，nk) N represents a person, and 0 to k represent a person number;
establishing a personnel task load queue, denoted as Sd (T)n0，...，Tnk) N represents a person, 0 to k represent a person number, k represents the total number of persons, and T represents the jth person njThe last task ending time of the last round of task assignment;
building a list of free slots, denoted Sf (n)j，mj)，0≤j≤k，mjAll free time slots representing the jth person.
The task dispatching comprises:
traversing the task queue, and traversing the idle time slice lists of all the personnel in the personnel allocation queue for each task;
when the condition is Sf (n)j，mj) When the time slice length is greater than TM (z, y) S (n, l, t) kpi, the task is distributed to all the idle time slices meeting the condition, the start time of the idle time slice is the earliest person, namely the task is insertedEnter this idle time slice;
otherwise, according to the performance index coefficient model S (n, l, T) kpi of the individual task difficulty level and the personnel task load condition Sd (T)n0，...，Tnk) Obtaining the time spent by all the personnel completing the current task, and constructing a data set { D (n) }, wherein D (n) ═ Sd (T)n0，...，Tnk) + TM (z, y) S (n, l, t) kpi, finding the minimum value D (X) in the set, X is more than or equal to 0 and less than or equal to nkObtaining the earliest personnel S (X) in the task completion time, and inserting the task into the load T of the personnelnxAnd (6) finally.
The serial structure relationship of the task chain is as follows: one task chain is decomposed into a plurality of tasks with sequential dependency relationship, and two tasks which are adjacent in sequence have dependency relationship, namely the former task can be started only after the former task is completed.
The task chain serial structure is realized through a bidirectional linked list, nodes in the bidirectional linked list represent tasks, and the sequence dependence of the tasks is realized through node pointers.
The step 7) is specifically as follows:
the graphical assignment result is displayed in two display modes, namely a display mode 1 and a display mode 2:
tasks assigned in the display mode 1 and having serial dependence use the same color mark, and the start of a task time area displays a task number, a task type and task start time; comparing with the previous task, respectively increasing the current task color R, G, B value by a set value to represent so as to distinguish different tasks, and representing the idle time slice by using a color different from the task color;
in the display mode 2, three different colors are used for representing three task states of load, early completion and task timeout: the load refers to the task completed or ongoing by the personnel before the current assignment; the early completion refers to the dispatch completion time of the task being earlier than the scheduled start time; a task overrun refers to a task's dispatch completion time being later than the scheduled completion time.
After task assignment, performing automatic learning feedback correction on a performance index coefficient, specifically:
when the number of times of traversing the task reaches a threshold value j, the task is completedTime average value
When the performance index coefficient model is smaller than S (n, l, t) kpi task standard working hours TM (z, y), the performance index coefficient model is modified to be
For the next round of task assignment.
A performance indicator-based serial task dispatching device comprising a memory having stored thereon a program that, when invoked by a processor, performs the steps of a performance indicator-based serial task dispatching method of claim 1.
The invention has the following beneficial effects and advantages:
1. the invention solves the productivity problem of manual task assignment in enterprise informatization production management, and obtains the task assignment result with minimum average man-hour under the priority condition through automatic learning and big data analysis.
2. The invention carries out automatic assignment processing on the informationized production task, replaces manual assignment, saves labor, does not need to carry out huge and complicated personal performance index coefficient initialization setting in closed-loop feedback design, carries out data feedback correction and accurate calculation in use, improves professional skill index coefficient of personnel, further obtains optimal solution and improves production efficiency.
3. According to the invention, the performance index coefficient model of the individual task difficulty level is established, so that the production proficiency of the individual personnel can be accurately reflected, and the production efficiency is improved.
4. According to the invention, the earliest personnel for completing the task is searched according to the performance index coefficient model and the task load condition of the personnel, the task is distributed, the load time data is corrected, the production capacity of the personnel is reflected to the assignment process in real time, the performance index coefficient is corrected to truly reflect the personal productivity change condition, and further the task is effectively assigned to the personnel, so that the production efficiency maximization is achieved.
5. According to the invention, the assignment result is displayed visually, so that the assignment condition of the task and the overdue and early completion state of the task can be intuitively known, and decision data is provided for enterprise production.
Drawings
FIG. 1 is a storage structure diagram of a serial task synthesis doubly linked list structure of the present invention;
FIG. 2 is a diagram of task assignment results in graphical assignment result display mode 1 according to the present invention;
FIG. 3 is a task dispatch state diagram of graphical dispatch result display mode 2 of the present invention;
FIG. 4 is a flow chart of a method of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Fig. 4 shows a flow description of the algorithm. The invention comprises the following steps:
A. and setting the working time and the holiday management, and performing assignment in the set working time in the assignment process.
B. And establishing a task serial structure relation.
C. The task standard man-hours are designated as TM (z, y), where z denotes a certain task chain and y denotes a certain task included in the task chain.
D. And establishing a performance index coefficient model of the difficulty level of the individual task, and expressing the model as S (n, l, t) kpi, wherein n represents personnel, l represents the difficulty level, and t represents the task type.
E. The serial tasks are combined into a doubly linked list structure.
F. And task queue sorting processing, namely outputting the multi-task sorting queue according to the priority condition sequence, wherein the sequence is represented by T (i, y), i represents a current task chain, and y represents a certain task contained in the task chain.
G. Dispatch people queue build, denoted S (n)0，...，nk) N represents a person, and 0 to k represent a person number.
H. Human task load, denoted Sd (T)n0，...，Tnk) T represents the last task ending time of the previous round of task assignment of the personnel, n represents personnel, 0-k represent personnel serial numbers, and k represents the total number of the personnel.
I. List of free slots, shown as Sf (n)j，mj)0≤j≤k，mjAll free time slots representing the jth person.
J. Inserting idle time slice tasks, synthesizing a two-way linked list structure according to the serial tasks and a task sorting queue output by the task queue sorting process, sequentially traversing the task sorting queue, traversing idle time slice lists of all personnel in a personnel allocation queue for each task, and obtaining the idle time slice list of Sf (n) when the condition is satisfiedj，mj) When the time length > TM (z, y) × S (n, l, t) & kpi is satisfied, the task is allocated to the person with the earliest completion date in the idle time slice, and the task is inserted into the idle time slice interval. And when the condition is not satisfied, entering the end of the personnel load time to calculate.
K. Obtaining a local optimal solution according to a performance index coefficient S (n, l, T) kpi of the personal individual task difficulty level and the personnel task load condition Sd (T)n0，...，Tnk) Calculating the time for all the personnel to complete the current task, and constructing a data set { D (n) }, wherein D (n) ═ Sd (T)n0，...，Tnk) + TM (z, y) S (n, l, t) kpi, finding the minimum value D (X) in the set, X is more than or equal to 0 and less than or equal to nkObtaining the earliest personnel S (X) in the task completion time, and inserting the task into the load T of the personnelnxAnd (6) finally.
And L, displaying a graphical distribution result.
And M, automatically learning and feeding back and correcting the performance index coefficient, recording the completion time of the task of a person after the task is completed, automatically adjusting the performance index coefficient of the person for the task according to the average value of the task time after the threshold number of times is reached, and performing a closed-loop assignment process.
The execution dependency relationship exists among the multiple tasks, the execution sequence and the dependency relationship are described by using a double linked list structure, and the double linked list structure described by any language such as a parent pointer and a backward pointer or a parent reference object and a backward reference object is set.
The method comprises the steps of carrying out grade division on one task, establishing one-to-one correspondence of a plurality of performance index coefficients on the divided multiple grades, and establishing data of each person by taking the performance index coefficients or coefficients of other attributes, factors and the like as calculation conditions through carrying out classification division on one task.
And inquiring idle time slices of all personnel before dispatching the current task according to the task serial dependency relationship, and finding out the idle time slices of which the total number is less than the length of the idle time slices after the standard time length in the task standard man-hour setting which accords with the current task is multiplied by the performance index coefficient of the space time slice personnel to the current task, wherein after the current task is inserted into the idle time slices, the time slice with the earliest task completion time is inserted into the current task, and a new idle time slice is generated.
And solving the personnel with the earliest time for completing the task at the current difficulty level on the basis of the numerical value of the task load time of the personnel, wherein the local optimal solution is obtained by accumulating the local optimal solution set when the earliest use of the task is completed by searching the sequence of the task queue ordered by the priority condition.
And sequentially grouping the task queues sorted according to the priority condition, and controlling the number of the tasks in the queue in a limited manner so as to calculate a full-permutation combination under the condition of limited calculation resources, traversing the full permutation of the limited number, and further optimizing a local minimum value when the minimum average time after the permutation is obtained.
The task assignment result is displayed graphically, each person uses a rectangular area with 100 pixels high and 4800 pixels long to indicate that the task assignment situation represents 15 minutes per pixel within 20 days from the current date, 96 pixels represent 24 hours, the working time is indicated by blue pixels, the assigned task load in the working time is indicated by light blue pixels with 80 high, the date is marked by blue fonts above the starting position of the working time, the graphical assignment result displays two display modes, display mode 1 and display mode 2, the tasks assigned in the display mode 1 and having serial dependence use the same color mark, the task number and the task type are displayed below the starting position of the task time area, the task starting time information is separated by an "|" character, the priority condition ordering sequence of the current assignment is marked above the starting position of the task time area and is increased from 0, the task color R, G, B value is marked by 5 as the color of incremental production in steps to distinguish different tasks, the idle time slice is marked by blue, and three task states of three colors of latent blue, green and red are used for marking load, advance completion and task overtime in the display mode 2.
The invention is applied to the field of elevators and used for realizing the allocation of elevator production and design tasks, and the specific embodiment is as follows:
step 0: establishing a task assignment time scale, working time and holiday management setting, wherein task assignment should be carried out within effective working time, such as working day monday to friday from 8 am to 17 pm, and the constructed working time range is called as assignment time scale.
Step 1: a task serial structure relationship is established, one task chain can be decomposed into a plurality of tasks with a sequential dependency relationship, two tasks which are adjacent in sequence have a dependency relationship, and the latter task can start after the former task is completed, and the structure relationship is called as a task serial structure relationship, for example: the elevator parameter compilation task comprises three tasks of parameter compilation, parameter proofreading and verification proofreading, wherein the execution sequence is that the parameter proofreading can be started after the parameter compilation is finished, and the verification and verification can be started after the parameter proofreading is finished.
Fig. 1 is divided into three parts, namely, an upper part, a middle part and a lower part, wherein the upper part illustrates a structure of a single task relation, a "predecessor" is a pointer pointing to a previous task node with a sequential relation, a "successor" is a pointer pointing to a next task node with a sequential relation, and a "task" is a task itself.
The middle part illustrates a bidirectional linked list structure formed by a plurality of tasks with serial relations pointing backwards through front-driving and rear-driving pointers, the lower part describes the serial structure relation of the tasks through actual services, and the serial structure relation of the tasks is formed by three tasks of design, proofreading and approval through the pointing of the pointers.
Step 2: the task standard man-hours are set, denoted as TM (z, y) z indicating a certain task chain, and y indicating a certain task included in the task chain.
And step 3: establishing a performance index coefficient of the difficulty level of the individual task, which is expressed as S (n, l, y) kpi, (n is all personnel, l difficulty level, y task type) task type specification: the elevator parameter design tasks are divided into three categories, namely parameters, proofreading and packing tasks, wherein the parameters comprise specific type parameter compilation and parameter proofreading, the proofreading comprises specific type proofreading, proofreading and checking and approval, and the packing task types comprise design, proofreading and approval; specification of difficulty rating: the category of the medicine is classified into category A, category B, category C, standard and other category 5. In summary, the number of the complete performance indicators for each person is 40(l x y), and is shown as combining with the actual business
The total number of coefficients is (n x l x y), which is a set value.
And 4, step 4: task dispatch is started.
And 5: firstly, a plurality of tasks are established, a task queue sorting queue is established according to a priority condition, the priority condition is that the tasks are sorted according to estimated completion dates of the tasks, the multi-task sorting queue is output according to the priority condition sequence, T (i, y) i represents a current task chain, and y represents a certain task contained in the task chain.
Step 6: an assigned personnel queue of this assignment is established and is denoted as S (n)0,…,nk) N represents a person, and 0 to k represent a person number.
And 7: establishing the task load of the personnel assigned this time, which is expressed as Sd (T)n0,…,Tnk) T represents the last task ending time of the previous round of task assignment of the personnel, n represents personnel, 0-k represent personnel serial numbers, and k represents the total number of the personnel.
And 8: establishing an idle time slice list of the dispatching personnel at this time, Sf (n)j,mj)0≤j≤k，mjAll the free slots representing the jth person, which are time intervals between tasks to which the person is assigned, such as task 1 start time AM08:00 end time AM09:00, task 2 start time AM10:00 end time AM11:00, time periods AM9:00 to AM10:00 are called free slots.
And step 9: sequentially traversing a task queue sorting queue T (i, y), for (i is 0; i < task length, i + +), and traversing: step 9 to step 14.
Step 10: the task T (i, y) is a dependency of a serial relationship, y is described as a serial dependent task of y + +, the task y + + can start only after the task y is completed, specifically, the task start time of T (i, 1) is later than the task end time of T (i, 0), and in combination with fig. 1 in the present invention, T (i, y) is a previous task T (i, y +1) of T (i, y +1) which is a subsequent task of T (i, y).
Step 11: the traversal start i is 0.
Step 12: and traversing the serial task of T (i, y), for (y is 0; y is less than the serial task length; y + +), and traversing the start y is 0.
Step 13: traversing the dispatching personnel list to search the personnel free time slice list under the task T (i, y), calculating and searching out the condition of being satisfied, and expressing the condition as Sf (n)j，mj) And (3) idle time slices of < T (i, y) × S (n, i, y) & kpi, when a condition-meeting result exists, inserting T (i, y) into the time slice with the earliest starting time, traversing the index i + +, repeating the step 12, and entering the next step for calculation if the condition-meeting time does not exist.
Step 14: traversing the dispatching personnel list under the task T (i, y), and calculating the dispatching completion time of each person for completing the task T (i, y) by adding the standard working hours of the task T (i, y) to the personnel load time and multiplying the performance index coefficient of the personnel for the task T (i, y), wherein the dispatching completion time of the task T (i, y) is mathematically expressed as D (n) Sd (T)n0，...，Tnk) + TM (z, y) S (n, l, T) kpi, obtaining a task completion time set { D (0.. D (n)) }aftertraversing calculation is completed, finding the person with the earliest task completion time, namely D (x) (0 < x < n), obtaining the person S (x) with the earliest task completion time according to x, assigning the task T (i, y) to the person S (x), and when T (i, y-1) and T (i, y) are assigned to the same person, assigning the task load Sd (T) of the person S (x)nx) Modified to D (x) task completion time, T (i, y-1) and T (i, y) assigned to different personnel, T (i, y) because of the serial task dependency described in step 10The start time must be equal to or greater than the end time of T (i, y-1), and there may be a case where the task end time of the task T (i, y-1) is greater than the load Sd (T) of the dispatcher of the task T (i, y)nx) The free time slice as described in step 8 is thus generated, in which case a list Sf (n) of free time slices to the person is generatedx，mx) Adding an initial value to the human task load Sd (T)nx) The ending value is a time segment of the starting time of the task T (i, y), and the personnel load Sd (T)nx) Modified to the end time of D (x).
Step 15: y + +, repeating step 12 when y is less than the serial task length, and performing step 16 when y is greater than the serial task length.
Step 16: and (5) traversing the index i + +, executing the step 17 when the traversing index i is equal to the length of the task queue sorting queue T (i, y), and repeating the step 12 when the traversing index i is smaller than the length of the task queue sorting queue T (i, y).
And step 17: and when the traversal index i is equal to the length of the task queue sorting queue T (i, y), the traversal process is finished, all the traversed tasks have an optimal assignment result D (x), and the optimal results D (x) of all the tasks are accumulated to obtain the minimum average working hour under the serial dependence condition and the priority condition.
Step 18: graphically assigning results, as shown in the attached figures 2 and 3, the graphically assigning results are displayed in two display modes, namely a display mode 1 and a display mode 2, tasks assigned in the display mode 1 and having serial dependency are marked by the same color, a task number and a task type are displayed below the starting position of a task time region, task starting time information is separated by using an 'I' character, the priority condition sorting sequence marked above the starting position of the task time region is marked by a sequence number which is increased from 0 starting to the beginning, the value of task color R, G, B is compared with the value of the previous task and is represented by R, G, B value of 5 so as to distinguish different tasks, idle time slices are marked by blue, and three task states of three colors, namely, blue, green, red and load marking, advanced completion and task overtime are used in the display mode 2. The task is assigned with a predicted starting time and finishing time before dispatching, which is called planning time, the load refers to the task completed or ongoing by the personnel before the dispatching, the dispatching finishing time of the task completed in advance is earlier than the planning time, the task exceeding period refers to the dispatching finishing time of the task later than the planning time,
step 19: the performance index coefficient S (n, l, y) kpi automatically learns feedback correction, records the average value of the time when the personnel complete the tasks after the task T (i, y) is completed and completes the tasks according to the latest threshold number of times after the threshold number j is reached
Automatically adjusting the performance index coefficient of the task of the personnel, and after the average value is less than the performance index coefficient S (n, l, t) kpi and the standard working hours TM (z, y) of the task, modifying the performance index coefficient into the performance index coefficient
(j is a threshold number of times), a closed-loop dispatch process.
Claims (8)
1. A serial task assignment method based on performance indicators is characterized in that elevator design and production tasks are assigned by constructing a performance indicator coefficient model, and the method comprises the following steps:
1) establishing tasks for elevator design and production, wherein a plurality of tasks form a task chain, and a plurality of task chains form a task chain set;
2) establishing a serial structure relationship of task chains;
3) setting task standard working hours, wherein the task standard working hours are represented as TM (z, y), z represents a certain task chain, and y represents a certain task contained in the task chain;
4) establishing a performance index coefficient model of the difficulty level of the individual task, wherein the performance index coefficient model is represented as S (n, l, t) kpi, wherein n represents personnel, l represents the difficulty level, and t represents the task type;
5) establishing a task dispatching queue with priority condition sequencing;
6) task allocation is carried out according to the performance index coefficient model and the task allocation queue, and an allocated result is obtained;
7) and visualizing the result after the assignment.
2. The performance indicator-based serial task dispatch method of claim 1, wherein said establishing a task dispatch queue comprises:
establishing a task queue T (i, y) according to a set priority condition, wherein i represents a current task chain, and y represents a certain task contained in the task chain;
a personnel assignment queue, denoted S (n)0,…,nk) N represents a person, and 0 to k represent a person number;
establishing a personnel task load queue, denoted as Sd (T)n0,…,Tnk) N represents a person, 0 to k represent a person number, k represents the total number of persons, and T represents the jth person njThe last task ending time of the last round of task assignment;
building a list of free slots, denoted Sf (n)j,mj)，0≤j≤k，mjAll free time slots representing the jth person.
3. The performance indicator-based serial task assignment method according to claim 1 or 2, wherein the task assignment comprises:
traversing the task queue, and traversing the idle time slice lists of all the personnel in the personnel allocation queue for each task;
when the condition is Sf (n)j,mj) Time slice length of>When TM (z, y) S (n, l, t) kpi is established, tasks are distributed to all idle time slices meeting the conditions, and the personnel with the earliest starting time of the idle time slices insert the tasks into the idle time slices;
otherwise, according to the performance index coefficient model S (n, l, T) kpi of the individual task difficulty level and the personnel task load condition Sd (T)n0,…,Tnk) Obtaining the time spent by all the personnel completing the current task, and constructing a data set { D (n) }, wherein D (n) ═ Sd (T)n0,…,Tnk)+TM(z,y)*S(n,l,t).kpi，Finding the minimum value D (X) in the set, wherein X is more than or equal to 0 and less than or equal to nkObtaining the earliest personnel S (X) in the task completion time, and inserting the task into the load T of the personnelnxAnd (6) finally.
4. The method of claim 1, wherein the task chain serial structure relationship is: one task chain is decomposed into a plurality of tasks with sequential dependency relationship, and two tasks which are adjacent in sequence have dependency relationship, namely the former task can be started only after the former task is completed.
5. The method as claimed in claim 1 or 4, wherein the task chain serial structure is implemented by a doubly linked list, nodes in the doubly linked list represent tasks, and the order dependency of the tasks is implemented by node pointers.
6. The method for serially dispatching tasks based on performance indicators as claimed in claim 1, wherein the step 7) is specifically as follows:
the graphical assignment result is displayed in two display modes, namely a display mode 1 and a display mode 2:
tasks assigned in the display mode 1 and having serial dependence use the same color mark, and the start of a task time area displays a task number, a task type and task start time; comparing with the previous task, respectively increasing the current task color R, G, B value by a set value to represent so as to distinguish different tasks, and representing the idle time slice by using a color different from the task color;
in the display mode 2, three different colors are used for representing three task states of load, early completion and task timeout: the load refers to the task completed or ongoing by the personnel before the current assignment; the early completion refers to the dispatch completion time of the task being earlier than the scheduled start time; a task overrun refers to a task's dispatch completion time being later than the scheduled completion time.
7. The serial task assignment method based on performance indicators as claimed in claim 1 or 2, wherein the performance indicator coefficient automatic learning feedback correction is performed after task assignment, specifically:
when the number of times of traversing the task reaches a threshold value j, the average value is used when the task is completed
When the performance index coefficient model is smaller than S (n, l, t) kpi task standard working hours TM (z, y), the performance index coefficient model is modified to be
For the next round of task assignment.
8. A performance indicator-based serial task dispatch device comprising a memory having a program stored thereon, the program when invoked by a processor performing the steps of a performance indicator-based serial task dispatch method of claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010829625.4A CN111967766B (en) | 2020-08-18 | 2020-08-18 | Serial task dispatching method and device based on performance index |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010829625.4A CN111967766B (en) | 2020-08-18 | 2020-08-18 | Serial task dispatching method and device based on performance index |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111967766A true CN111967766A (en) | 2020-11-20 |
| CN111967766B CN111967766B (en) | 2023-10-24 |
Family
ID=73387744
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010829625.4A Active CN111967766B (en) | 2020-08-18 | 2020-08-18 | Serial task dispatching method and device based on performance index |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111967766B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113467909A (en) * | 2021-06-29 | 2021-10-01 | 北京房江湖科技有限公司 | Time consuming method and apparatus for compressing concurrent requests |
| CN114205742A (en) * | 2021-12-15 | 2022-03-18 | 南京凯盛国际工程有限公司 | Automatic pushing method for tasks and alarms of cement production equipment based on personnel positioning |
| CN114819763A (en) * | 2022-06-27 | 2022-07-29 | 北京神州光大科技有限公司 | Order dispatching control method and system for IT service work order |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090204471A1 (en) * | 2008-02-11 | 2009-08-13 | Clearshift Corporation | Trust Level Based Task Assignment in an Online Work Management System |
| CN103064745A (en) * | 2013-01-09 | 2013-04-24 | 苏州亿倍信息技术有限公司 | Method and system for distributing and processing tasks |
| CN105243080A (en) * | 2015-08-31 | 2016-01-13 | 湖北工业大学 | ESB (Enterprise Service Bus) framework based resource perception adaptive system |
| CN106844051A (en) * | 2017-01-19 | 2017-06-13 | 河海大学 | The loading commissions migration algorithm of optimised power consumption in a kind of edge calculations environment |
| EP3483805A1 (en) * | 2017-11-08 | 2019-05-15 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a task assignment system |
-
2020
- 2020-08-18 CN CN202010829625.4A patent/CN111967766B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090204471A1 (en) * | 2008-02-11 | 2009-08-13 | Clearshift Corporation | Trust Level Based Task Assignment in an Online Work Management System |
| CN103064745A (en) * | 2013-01-09 | 2013-04-24 | 苏州亿倍信息技术有限公司 | Method and system for distributing and processing tasks |
| CN105243080A (en) * | 2015-08-31 | 2016-01-13 | 湖北工业大学 | ESB (Enterprise Service Bus) framework based resource perception adaptive system |
| CN106844051A (en) * | 2017-01-19 | 2017-06-13 | 河海大学 | The loading commissions migration algorithm of optimised power consumption in a kind of edge calculations environment |
| EP3483805A1 (en) * | 2017-11-08 | 2019-05-15 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a task assignment system |
| CN110023969A (en) * | 2017-11-08 | 2019-07-16 | 欧洲阿菲尼帝科技有限责任公司 | For the technology of benchmark to be carried out to pairing strategy in task distribution system |
Non-Patent Citations (3)
| Title |
|---|
| 李卫;杨凛;杨祖贤;: "基于大数据的供电所工作任务优化配置研究与应用", 《贵州电力技术》, no. 2, pages 49 - 52 * |
| 杨善超;田康生;刘仁争;郑玉军;: "基于价值优化的相控阵雷达任务调度算法", 《电子与信息学报》, no. 2, pages 184 - 190 * |
| 王金: "基于深度强化学习的大数据平台作业调度算法与仿真实现", 《中国优秀硕士学位论文全文数据库 (信息科技辑)》, no. 1, pages 137 - 20 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113467909A (en) * | 2021-06-29 | 2021-10-01 | 北京房江湖科技有限公司 | Time consuming method and apparatus for compressing concurrent requests |
| CN113467909B (en) * | 2021-06-29 | 2022-03-15 | 贝壳找房(北京)科技有限公司 | Time consuming method and apparatus for compressing concurrent requests |
| CN114205742A (en) * | 2021-12-15 | 2022-03-18 | 南京凯盛国际工程有限公司 | Automatic pushing method for tasks and alarms of cement production equipment based on personnel positioning |
| CN114819763A (en) * | 2022-06-27 | 2022-07-29 | 北京神州光大科技有限公司 | Order dispatching control method and system for IT service work order |
| CN114819763B (en) * | 2022-06-27 | 2022-09-02 | 北京神州光大科技有限公司 | Order dispatching control method and system for IT service work order |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111967766B (en) | 2023-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111967766B (en) | Serial task dispatching method and device based on performance index | |
| US8856018B2 (en) | Methods and systems for optimizing production forecasts using statistically prioritized discrete modeling methodology | |
| US10713603B2 (en) | System and method of work assignment management | |
| US8015042B2 (en) | Methods for long-range contact center staff planning utilizing discrete event simulation | |
| US6233493B1 (en) | Computer-implemented product development planning method | |
| US8160911B2 (en) | Project management applications utilizing summary tasks for top-down project planning | |
| US20140278649A1 (en) | Modeling a gap between workload and number of employees to be scheduled by creating and using new workload levels | |
| CN110751358A (en) | Scheduling method for airport ground service personnel, electronic equipment and storage medium | |
| CN113034015B (en) | Airport check-in personnel scheduling method based on constraint relaxation solving | |
| Beliën et al. | Improving workforce scheduling of aircraft line maintenance at Sabena Technics | |
| US20150242782A1 (en) | Interactive Planning Method And Tool | |
| US10496962B1 (en) | Dynamic digital calendar day kanban board | |
| CN110889626A (en) | Intelligent shift planning method, device, equipment and storage medium | |
| CN113793203A (en) | Order processing method and device | |
| CN115423450A (en) | Processing method and device for scheduling data and computer equipment | |
| JP2021144756A (en) | Project plan formulation system | |
| CN113568747A (en) | Cloud robot resource scheduling method and system based on task classification and time sequence prediction | |
| JP2006202082A (en) | Production line management system, production line management program, recording medium, and method for managing production line | |
| CN113435615B (en) | Intelligent reservation system for scanning image subject research project and using method | |
| CN115829214A (en) | Scheduling method and scheduling system | |
| CN112749942A (en) | Scheduling method, device, equipment and storage medium | |
| Powers et al. | Using IMPRINT to model operator staffing and workload considerations in a 24/7 full-service mission operations center | |
| US20240153175A1 (en) | Pre-processing device for image representing manufacturing system state and method using same | |
| Korneev et al. | An Algorithm for the Distribution of Performers by Work, Taking Into Account the Priority of Tasks and the Specifics of the Necessary Skills | |
| CA2571785A1 (en) | Systems and methods for performing long-term simulation |
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 |