CN111967766B - Serial task dispatching method and device based on performance index - Google Patents
Serial task dispatching method and device based on performance index Download PDFInfo
- Publication number
- CN111967766B CN111967766B CN202010829625.4A CN202010829625A CN111967766B CN 111967766 B CN111967766 B CN 111967766B CN 202010829625 A CN202010829625 A CN 202010829625A CN 111967766 B CN111967766 B CN 111967766B
- Authority
- CN
- China
- Prior art keywords
- task
- tasks
- personnel
- performance index
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000004519 manufacturing process Methods 0.000 claims abstract description 27
- 238000013461 design Methods 0.000 claims abstract description 12
- 238000012163 sequencing technique Methods 0.000 claims abstract description 9
- 239000003086 colorant Substances 0.000 claims description 9
- 238000012937 correction Methods 0.000 claims description 3
- 238000007405 data analysis Methods 0.000 abstract description 3
- 238000004364 calculation method Methods 0.000 description 7
- 238000007726 management method Methods 0.000 description 7
- 230000001419 dependent effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000003786 synthesis reaction Methods 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 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
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000002243 precursor Substances 0.000 description 1
- 238000012545 processing Methods 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/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 serial task dispatching method based on performance indexes. 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 structural relationship of a task chain; setting standard working hours of tasks; establishing a performance index coefficient model of the individual task difficulty level; establishing a task dispatch queue with priority condition sequencing; task dispatching is carried out according to the performance index coefficient model and the task dispatching queue, and dispatched results are obtained; and visualizing the assigned result. The invention obtains the task dispatching result of 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 task dispatching method based on performance indexes and priority conditions.
Background
The informatization construction of enterprise production management is realized through IT planning such as data architecture, flow architecture, application architecture, platform architecture and the like, and the assignment and management of production tasks inevitably occur in the flow architecture.
Task assignment in the field of elevator assembly manufacturing, task assignment is completed in a management platform by manual operation, intervention and the like. When the production enterprise traffic is of a certain scale, the task type is complex, the individual productivity evaluation of production personnel cannot be effectively and accurately carried out, the productivity of the individual personnel is estimated according to the experience of the dispatcher, a large amount of time and personnel are idle in the task dispatching process, the task dispatching cannot be effectively displayed and timely adjusted, the production efficiency generated by scientific and accurate calculation cannot be achieved, and the production activity is carried out under lower efficiency.
Disclosure of Invention
Aiming at the technical deficiency, the invention aims to provide a multi-task and multi-person global minimum average man-hour task dispatching algorithm based on the task priority condition of individual task performance indexes. The algorithm can optimize the overall management capacity of enterprise production.
A big data analysis and automatic learning technology is applied to construct a performance index coefficient self-adaptive learning model which is accurate to individuals, each task and each production action, and the model is used as an entity of a data architecture, can effectively calculate real productivity, and is different from the traditional unified calculation index coefficient, so that the problem that individual skill differences of personnel cannot be reflected and real production capacity cannot be achieved is solved.
The flow architecture realizes closed loop between flow control and data operation 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 achieving the purpose is as follows: a serial task dispatching method based on performance indexes dispatches and displays elevator design and production tasks by constructing a performance index 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 structural relationship of a task chain;
3) Setting task standard man-hours, wherein the task standard man-hours are expressed 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, establishing a performance index coefficient model of individual task difficulty level, which is expressed as S (n, l, t) kpi, wherein n represents personnel, l represents difficulty level, and t represents task type;
5) Establishing a task dispatch queue with priority condition sequencing;
6) Task dispatching is carried out according to the task standard man-hour, performance index coefficient model and task dispatching queue, and dispatched results are obtained;
7) And visualizing the assigned result.
The establishing a task dispatch queue includes:
establishing a task queue T (i, y) according to the set priority condition, wherein i represents a current task chain, and y represents a certain task contained in the task chain;
a personnel dispatch queue, denoted S (n 0 ,…,n k ) N represents personnel, and 0 to k represent personnel numbers;
a staff task load queue, denoted Sd (T n0 ,…,T nk ) N represents personnel, 0-k represent personnel numbers, k represents total personnel number, and T represents jth personnel n j The last task end time of the last round of task assignment;
an idle time slice list is built up, denoted Sf (n j ,m j )，0≤j≤k，m j Indicating all the free time slices for the jth person.
The task assignment includes:
traversing task queues, and traversing an idle time slice list of all people in the personnel dispatch queue for each task;
when the condition is Sf (n j ,m j ) Time slice length of (2)>TM (z, y) S (n, l, t) kpi, when the task is established, assigning the task to all idle time slices meeting the condition, wherein the starting time of the idle time slice is the earliest, i.e. inserting the task into the 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 ,…,T nk ) When all people complete the current task, a data set { D (n) } is constructed, wherein D (n) =sd (T) n0 ,…,T nk ) +TM (z, y) S (n, l, t) kpi, find the minimum value D (X) in the collection, 0.ltoreq.X.ltoreq.n k Obtaining the earliest person S (X) with task completion time, and inserting the task into the person load T nx And then, the method is carried out.
The serial structural relation of the task chain is as follows: a task chain is decomposed into a plurality of tasks with sequential dependency relationships, and two tasks with sequential adjacent dependency relationships can be started only after the former task is completed.
The task chain serial structure is realized through a double-linked list, nodes in the double-linked list represent tasks, and sequential dependence of the tasks is realized through node pointers.
The step 7) is specifically as follows:
the graphical dispatch results are displayed in two display modes, namely display mode 1 and display mode 2:
the tasks which are allocated in the display mode 1 and have serial dependence use the same color mark, and the starting position of the task time area displays the task number, the task type and the task starting time; comparing the previous task, respectively increasing the color R, G, B value of the current task by a set value to represent the current task so as to distinguish different tasks, wherein the idle time slices are represented by colors different from the task colors;
three different three colors are used in the display mode 2 to represent three task states of load, completion in advance and task over-period: the load refers to the task that the personnel have completed or are in progress before the present dispatch; the early completion means that the dispatch completion time of the task is earlier than the planned start time; task overrun refers to the task being assigned to completion time later than the planned completion time.
After task assignment, performance index coefficient automatic learning feedback correction is carried out, specifically:
when the number of times of traversing the task reaches a threshold value j, the average value is used when the task is completedWhen the performance index coefficient model is smaller than the task standard man-hour TM (z, y) of the performance index coefficient model S (n, l, t) kpi, the performance index coefficient model is modified intoFor the next round of task assignment.
A performance indicator based serial task orchestration device comprising memory having stored thereon a program that when invoked by a processor performs the steps of a performance indicator based serial task orchestration method according to claim 1.
The invention has the following beneficial effects and advantages:
1. the invention solves the problem of the efficiency of manual task dispatching productivity in enterprise informatization production management, and obtains the minimum average man-hour task dispatching result under the priority condition through automatic learning and big data analysis.
2. According to the invention, the informationized production task is automatically allocated, manual allocation is replaced, manpower is saved, the initialization setting of huge and complex personal performance index coefficients is not needed in the closed loop feedback design, data feedback correction is used, calculation is accurate, the expertise index coefficients good for personnel are improved, the optimal solution is further obtained, and the production efficiency is improved.
3. According to the invention, the performance index coefficient model of the individual task difficulty level is established, so that the individual production proficiency of 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 personnel task load condition, the task is distributed, and the load time data is corrected, so that the personnel productivity is reflected in the dispatching process in real time, the corrected performance index coefficient truly reflects the personnel productivity change condition, and further the personnel is effectively dispatched, and the production efficiency is maximized.
5. The invention can visually understand the task dispatching situation and the overtime and advanced completion state of the task by visually displaying the dispatching result, and provides decision data for enterprise production.
Drawings
FIG. 1 is a memory block diagram of a serial task synthesis doubly linked list structure of the present invention;
FIG. 2 is a task assignment result diagram of the present invention in a graphical assignment result display mode 1;
FIG. 3 is a task assignment state diagram of the present invention for a graphical assignment result display mode 2;
fig. 4 is a flow chart of the method of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
A flowchart description of the algorithm is shown in fig. 4. The invention comprises the following steps:
A. the working time and holiday management are set, and the dispatching process dispatches in the set working time.
B. And establishing a task serial structural relationship.
C. The task standard man-hour setting is denoted as TM (z, y), z represents a certain task chain, and y represents a certain task included in the task chain.
D. And establishing a performance index coefficient model of the individual task difficulty level, wherein the performance index coefficient model is expressed as S (n, l, t) kpi, n represents personnel, l represents the difficulty level, and t represents the task type.
E. The serial tasks compose a doubly linked list structure.
F. And (3) a task queue ordering process, namely outputting a multi-task ordering queue according to a priority condition sequence, wherein the multi-task ordering queue is expressed as T (i, y), i represents a current task chain, and y represents a certain task contained in the task chain.
G. Dispatch personnel queue construction, denoted S (n 0 ,…,n k ) N represents a person, and 0 to k represent person numbers.
H. A staff task load, denoted Sd (T n0 ,…,T nk ) T represents the last task end time of the last task assignment of the person, n represents the person, 0-k represents the person number, and k represents the total number of the person.
I. An idle time slice list, shown as Sf (n j ,m j )0≤j≤k，m j Indicating all the free time slices for the jth person.
J. The idle time slice task insertion is carried out, the task sequencing queues are sequentially traversed according to the serial task synthesis double-linked list structure and the task sequencing queues output by the task queue sequencing processing, and each task is traversed by personnelAn idle time slice list of all people in the dispatch queue is assigned when the condition Sf (n j ,m j ) Length of time of (2)>TM (z, y) S (n, l, t) kpi, when established, the task is assigned to the person with the earliest completion date and time in the idle time slice, and the task is inserted into this idle time slice interval. And when the load time is not met, the end of the personnel load time is entered for calculation.
K. Obtaining a local optimal solution according to the performance index coefficient S (n, l, T) kpi of the individual task difficulty level and the personnel task load condition Sd (T) n0 ,…,T nk ) When all people complete the current task, the data set { D (n) } is constructed, wherein D (n) =sd (T) n0 ,…,T nk ) +TM (z, y) S (n, l, t) kpi, find the minimum value D (X) in the collection, 0.ltoreq.X.ltoreq.n k Obtaining the earliest person S (X) with task completion time, and inserting the task into the person load T nx And then, the method is carried out.
And L, displaying the graphical dispatch result.
M, automatically learning, feeding back and correcting performance index coefficients, recording the task completion time of personnel after the task is completed, and automatically adjusting the performance index coefficients of the personnel according to the average value of the task time after the threshold number of times is reached, and performing a closed-loop dispatching process.
The execution dependency relationship exists among a plurality of tasks, the execution sequence and the dependency relationship are described by using a doubly linked list structure, and a doubly linked list structure of any language description such as a father pointer and a backward pointer or a father reference object and a backward reference object is set.
And grading one task, establishing a plurality of performance index coefficients in one-to-one correspondence with the graded multi-stage, classifying and grading one task, and establishing the data of each person by taking the coefficients, factors and the like of the performance index coefficients or other attributes as calculation conditions.
And according to the serial dependency relationship of the task, the idle time slices generated after the task is dispatched are firstly inquired by the current task before the task is dispatched, the idle time slices, wherein the number of the idle time slices which are smaller than the idle time slice length after the standard time length in the standard working hour setting of the task and the performance index coefficient of the space time slice personnel to the current task are multiplied, are found out, and 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 person with the earliest task time for completing the current difficulty level based on the personnel task load time value, wherein the local optimal solution solving is to solve the minimum average working hour under the current priority condition through the accumulation of the local optimal solution set when the earliest use of the task is completed by searching the sequence of the task queues ordered by the priority condition.
And sequentially grouping the task queues ordered by the priority condition, and controlling the number of the tasks in the group in a limited manner so as to calculate full permutation and combination under the condition of limited calculation resources, traversing the full permutation of the limited number, and further optimizing the local minimum value when the minimum average time after permutation is obtained.
The method comprises the steps of graphically displaying a task dispatching result, wherein each person uses a rectangular area with a length of 4800 pixels, each person uses a pixel with a length of 100 pixels to represent 15 minutes for each task dispatching condition within 20 days from the current date, 96 pixels represent 24 hours, work time uses blue pixels to represent work time, assigned task loads are represented by light blue pixels with a length of 80 in the work time, blue fonts above the start position of the work time are marked with dates, the graphical dispatching result is displayed in two display modes, namely, a display mode 1 and a display mode 2, tasks which are assigned in the display mode 1 and are serially dependent are marked with the same color, task numbers and task types are displayed below the start position of the task time area, task start time information is separated by using an 'character', the sorting order of the priority conditions which are assigned for the time is marked by 0 start increasing order number, task colors R, G, B values are marked by 5 as step number increasing colors, different tasks are marked in a blue manner, three-color blue marks are used for idle time slices, and three-color blue, green, red marks and three-color latent loads are marked in the display mode 2, and three task states are completed in advance.
The invention is applied to the field of elevators and is used for realizing elevator production and design task allocation, and specific embodiments are as follows:
step 0: the task dispatch time scale, working time and holiday management setting are established, the task dispatch should be carried out in effective working time, such as 8 hours in the morning to 17 hours in the evening of Monday to friday, and the constructed working time range is called dispatch time scale.
Step 1: the task serial structure relationship is established, one task chain can be decomposed into a plurality of tasks with sequential dependency relationships, the dependency relationships exist between two tasks which are adjacent in sequence, the former task can be started after being completed, and the structure relationship is called the task serial structure relationship, for example: the elevator parameter programming task comprises three tasks, namely parameter programming, parameter checking and checking, wherein the execution sequence is that the parameter checking can be started after the parameter programming is finished, and the checking and checking can be started after the parameter checking is finished.
FIG. 1, which is divided into upper, middle and lower parts, wherein the upper part is a structure of a single task relation, the 'precursor' refers to a pointer pointing to a previous task node with a sequential relation, the 'postdrive' refers to a pointer pointing to a next task node with a sequential relation, and the 'task' refers to a task itself.
The middle part illustrates a double linked list structure formed by a plurality of tasks with serial relations through the front drive pointer and the rear drive pointer, the lower part describes the task serial structure relation by actual service, and the task serial structure relation is formed by three tasks of design, check and approval through the pointer pointing.
Step 2: when a task standard man-hour is set, a task chain is denoted by TM (z, y) z, and a task included in the task chain is denoted by y.
Step 3: establishing performance index coefficients of individual task difficulty levels, which are expressed as S (n, l, y) kpi, (n is the difficulty level of all people, y task type): the elevator parameter design task is divided into three categories, namely parameters, checking and boxing tasks, wherein the parameters comprise specific type parameter programming and parameter checking, the checking and checking comprise specific type checking and checking, checking and approval, and the boxing task types comprise design, checking and approval; difficulty level description: the classification is classified into class A, class B, class C, standard and other class 5. The number of the complete performance index systems of each personnel is 40 (i.e. y), and the performance index systems are shown as combined with actual business
The total number of coefficients is (n x l x y) and is a set value.
Step 4: task assignment is started.
Step 5: firstly, a plurality of tasks are established into a task queue sequencing queue according to a priority condition, the priority condition is that the tasks are sequenced according to the estimated completion date of the tasks, the multi-task sequencing queue is output according to the priority condition sequence, the T (i, y) i is represented as a current task chain, and y is represented as a certain task contained in the task chain.
Step 6: establishing a dispatch personnel queue, denoted as S (n 0 ,…,n k ) N represents a person, and 0 to k represent person numbers.
Step 7: the personnel task load of the dispatch personnel is established and is expressed as Sd (T n0 ,…,T nk ) T represents the last task end time of the last task assignment of the person, n represents the person, 0-k represents the person number, and k represents the total number of the person.
Step 8: an idle time slice list of the dispatch personnel is established, sf (n j ,m j )0≤j≤k，m j Indicating all the idle time slices of the jth person, the idle time slices refer to time intervals between tasks to which the person is assigned, for example, task 1 start time AM08:00 end time AM09:00, task 2 start time AM10:00 end time AM11:00, and time periods AM9:00 to AM10:00 are referred to as idle time slices.
Step 9: sequentially traversing the task queue ordering queues T (i, y), for (i= 0;i < task length, i++), traversing steps: step 9 to step 14.
Step 10: tasks T (i, y), y are dependent of serial relationship, describing that y is a serial dependent task of y++, the task y++ can be started after the task y is completed, and the task starting time of the task is embodied as T (i, 1) is later than the task ending time of T (i, 0), and the previous task T (i, y+1) of the task T (i, y+1) is T (i, y) in combination with the figure 1 of the invention.
Step 11: traversal starts i=0.
Step 12: traversing the serial tasks of T (i, y), for (y= 0;y < serial task length; y++), traversing starting y=0.
Step 13: traversing the dispatch personnel list to find personnel idle time slice list under the task T (i, y), and calculating and finding that the meeting condition is expressed as Sf (n j ,m j )<And (3) when the idle time slices of T (i, y) S (n, i, y) kpi are in accordance with the condition, inserting the T (i, y) into the time slice with the earliest starting time, traversing the index i++, repeating the step 12, and calculating the next step without the time in accordance with the condition.
Step 14: traversing the present dispatch personnel list under the task T (i, y), and calculating the dispatch completion time of each person to complete the task T (i, y) by multiplying the personnel load time by the standard man-hour of the task T (i, y) multiplied by the performance index coefficient of the personnel to the task T (i, y), wherein the dispatch completion time of the task T (i, y) is expressed as D (n) =sd (T) n0 ,…,T nk ) +TM (z, y) S (n, l, t) kpi, traversing the calculation to obtain a task completion time set { D (0) … D (n) }, finding the earliest task completion time, expressed as 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 assigning the task load Sd (T) of the person S (x) when T (i, y-1) and T (i, y) are assigned to the same person nx ) When the task completion time, T (i, y-1) and T (i, y) are assigned to different persons, modified as D (x), because of the serial task dependency described in step 10, the start time of T (i, y) must be equal to or greater than the end time of T (i, y-1), a situation may arise in which the task end time of task T (i, y-1) is greater than the load Sd (T) of the person assigned by task T (i, y) nx ) Thus, the idle time slices described in step 8 are generated, which is presented to the list Sf (n x ,m x ) The additional start value is the personnel task load Sd (T nx ) The end value is the time segment of the start time of the task T (i, y), the staff load Sd (T nx ) Modified to be 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, traversing index i++, executing step 17 when traversing index i equals to the length of task queue ordering queue T (i, y), and repeating step 12 when traversing index i is less than the length of task queue ordering queue T (i, y).
And 17, when the traversal index i is equal to the length of the task queue sequencing queue T (i, y), finishing the traversal process, wherein all traversed tasks have an optimal dispatching result D (x), and the optimal results D (x) of all the tasks are accumulated to obtain the minimum average working hours under the serial dependency condition and the priority condition.
And 18, graphically assigning results, as shown in fig. 2 and 3, wherein 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 dependence are marked by the same color, task numbers and task types are displayed below the beginning of a task time area, task starting time information is separated by using an 'character', the priority condition sequence number of the current assignment of the mark above the beginning of the task time area is increased by 0, the task color R, G, B value is represented by a R, G, B value which is 5 compared with the previous task, so that different tasks are distinguished, an idle time slice is marked by blue, three colors of underblue, green and red are used for marking loads, and three task states of exceeding period are finished in advance in the display mode 2. Before the task is dispatched, a predicted starting time and a finishing time are given as a planning time, the load refers to the task finished or in progress by the personnel before the dispatch, the dispatching finishing time of the task is earlier than the planning time, the dispatching finishing time of the task exceeding time refers to the task is later than the planning time,
step 19, automatically learning and correcting the performance index coefficient S (n, l, y) kpi, recording the time spent by personnel task after the task T (i, y) is completed, and recording the average value of the time spent by the latest threshold number of task after the threshold number j is reachedAutomatically adjusting the performance of personnel on this taskAfter the index coefficient, the average value is smaller than the performance index coefficient S (n, l, t) kpi and the task standard man-hour TM (z, y), the performance index coefficient is modified into ++> (j is the threshold number), closed loop dispatch procedure.
Claims (5)
1. A serial task dispatching method based on performance indexes is characterized in that the elevator design and production tasks are dispatched by constructing a performance index 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 structural relationship of a task chain;
3) Setting task standard man-hours, wherein the task standard man-hours are expressed 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 individual task difficulty level, wherein the performance index coefficient model is expressed as S (n, l, t) kpi, n represents personnel, l represents the difficulty level, and t represents the task type;
5) Establishing a task dispatch queue with priority condition sequencing;
6) Task dispatching is carried out according to the performance index coefficient model and the task dispatching queue, and dispatched results are obtained;
7) Visualizing the assigned result;
the task dispatch queue for establishing the priority condition ordering comprises:
establishing a task queue T (i, y) according to the set priority condition, wherein i represents a current task chain, and y represents a certain task contained in the task chain;
a personnel dispatch queue, denoted S (n 0 ，...，n k ) N represents personnel, and 0 to k represent personnel numbers;
a staff task load queue, denoted Sd (T n0 ，...，T nk ) N represents personnel, 0-k represent personnel numbers, k represents total personnel number, and T represents jth personnel n j The last task end time of the last round of task assignment;
an idle time slice list is built up, denoted Sf (n j ，m j )，0≤j≤k，m j All idle slots representing jth personnel;
the task assignment includes:
traversing task queues, and traversing an idle time slice list of all people in the personnel dispatch queue for each task;
when the condition is Sf (n j ，m j ) When the time slice length of (TM) (z, y) S (n, l, t) kpi is satisfied, the task is allocated to all idle time slices meeting the condition, and the person with the earliest idle time slice starting time, namely the task is inserted into the 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 ，...，T nk ) When all people complete the current task, a data set { D (n) } is constructed, wherein D (n) =sd (T) n0 ，...，T nk ) +TM (z, y) S (n, l, t) kpi, find the minimum value D (X) in the collection, 0.ltoreq.x.ltoreq.n k Obtaining the earliest person S (X) with task completion time, and inserting the task into the person load T nx Afterwards;
after task assignment, performance index coefficient automatic learning feedback correction is carried out, specifically:
when the number of times of traversing the task reaches a threshold value j, the average value is used when the task is completedWhen the performance index coefficient model is smaller than the task standard man-hour TM (z, y) of the performance index coefficient model S (n, l, t) kpi, the performance index coefficient model is modified intoFor the next round of task assignment.
2. The performance indicator-based serial task assigning method according to claim 1, wherein the task chain serial structural relationship is: a task chain is decomposed into a plurality of tasks with sequential dependency relationships, and two tasks with sequential adjacent dependency relationships can be started only after the former task is completed.
3. The performance indicator-based serial task assigning method according to claim 1 or 2, wherein the task chain serial structure is implemented by a doubly linked list, nodes in the doubly linked list represent tasks, and order dependence of the tasks is implemented by node pointers.
4. The performance indicator-based serial task assigning method according to claim 1, wherein the step 7) specifically includes:
the graphical dispatch results are displayed in two display modes, namely display mode 1 and display mode 2:
the tasks which are allocated in the display mode 1 and have serial dependence use the same color mark, and the starting position of the task time area displays the task number, the task type and the task starting time; comparing the previous task, respectively increasing the color R, G, B value of the current task by a set value to represent the current task so as to distinguish different tasks, wherein the idle time slices are represented by colors different from the task colors;
three different three colors are used in the display mode 2 to represent three task states of load, completion in advance and task over-period:
the load refers to the task that the personnel have completed or are in progress before the present dispatch; the early completion means that the dispatch completion time of the task is earlier than the planned start time; task overrun refers to the task being assigned to completion time later than the planned completion time.
5. A performance indicator based serial task orchestration device comprising memory having stored thereon a program that when invoked by a processor performs the steps of a performance indicator based serial task orchestration method according to 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 CN111967766A (en) | 2020-11-20 |
| CN111967766B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN114819763B (en) * | 2022-06-27 | 2022-09-02 | 北京神州光大科技有限公司 | Order dispatching control method and system for IT service work order |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009102728A1 (en) * | 2008-02-11 | 2009-08-20 | Clearshift Corporation | Online work management system |
-
2020
- 2020-08-18 CN CN202010829625.4A patent/CN111967766B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
|---|
| 基于价值优化的相控阵雷达任务调度算法;杨善超;田康生;刘仁争;郑玉军;;《电子与信息学报》(第2期);184-190 * |
| 基于大数据的供电所工作任务优化配置研究与应用;李卫;杨凛;杨祖贤;;《贵州电力技术》(第2期);49-52 * |
| 基于深度强化学习的大数据平台作业调度算法与仿真实现;王金;《中国优秀硕士学位论文全文数据库 (信息科技辑)》(第1期);I137-20 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111967766A (en) | 2020-11-20 |
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 | |
| US10754688B2 (en) | Systems and methods of a production environment tool | |
| US7487106B2 (en) | System and method for managing mobile workers | |
| US8099312B2 (en) | Project management system and method | |
| US20110302090A1 (en) | Determining a Critical Path in Statistical Project Management | |
| US20070288283A1 (en) | Method for project management | |
| EP1359529A1 (en) | Computer-implemented product development planning method | |
| US20150242782A1 (en) | Interactive Planning Method And Tool | |
| CN111311090B (en) | Intelligent scheduling method and device based on big data calculation and analysis | |
| CN114037311A (en) | Information system engineering supervision project risk assessment method | |
| CN112465353A (en) | Intelligent scheduling method for maintenance task of wind power plant in hilly area | |
| CN115423450A (en) | Processing method and device for scheduling data and computer equipment | |
| CN113570118A (en) | Workshop scheduling and analyzing method based on scheduling rule | |
| CN111353625A (en) | Method, device, equipment and storage medium for predicting dot part quantity | |
| CN113568747A (en) | Cloud robot resource scheduling method and system based on task classification and time sequence prediction | |
| JP2021144756A (en) | Project plan formulation system | |
| Liu | The optimization of worker's quantity based on cross-utilization in two departments | |
| CN114997532B (en) | Civil telephone delivery scheduling method under uncertain environment, terminal and storage medium | |
| CN115829214A (en) | Scheduling method and scheduling system | |
| 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 | |
| US20240013113A1 (en) | Method and system for automatic establishment of optimal schedule for construction project | |
| EP1738307A1 (en) | A system and method for constructing a schedule that better achieves one or more business goals | |
| Protalinsky et al. | Control of the organizational System Configuration in the Context of Digital Transformation |
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 |