CN113379308A - Task distribution method and device, electronic equipment and storage medium - Google Patents
Task distribution method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113379308A CN113379308A CN202110740295.6A CN202110740295A CN113379308A CN 113379308 A CN113379308 A CN 113379308A CN 202110740295 A CN202110740295 A CN 202110740295A CN 113379308 A CN113379308 A CN 113379308A
- Authority
- CN
- China
- Prior art keywords
- job task
- information
- job
- task
- priority value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000012163 sequencing technique Methods 0.000 claims abstract description 19
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 230000003993 interaction Effects 0.000 description 3
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000000725 suspension Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 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/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Telephonic Communication Services (AREA)
Abstract
The application provides a task dispatching method, a task dispatching device, electronic equipment and a storage medium, wherein the task dispatching method comprises the following steps: acquiring emergency degree information and time information of a job task; acquiring priority value information according to the urgency information and the time information; sequencing a plurality of job tasks according to the priority value information to obtain a job task queue; and dispatching the plurality of job tasks according to the job task queue. By means of obtaining and applying the urgency information and the time information of the operation tasks, dispatching logic of the operation tasks can be optimized, and the transport capacity of the unmanned vehicle is reasonably distributed.
Description
Technical Field
The application relates to the technical field of unmanned driving, in particular to a task distributing method and device, electronic equipment and a storage medium.
Background
In the process of realizing automatic horizontal transportation, the port needs unmanned vehicles to complete different types of operation tasks.
Currently, the dispatching of multiple job tasks is generally performed on a first-come-first-serve basis, i.e., the dispatching order of the job tasks is determined based on the generation time of the job tasks, so as to ensure that job tasks with an early generation time can be executed before job tasks with a later generation time. In practical applications, when dealing with an emergency task or an emergency task, if the task is still dispatched according to the first-come first-serve principle, the transport capacity of the unmanned vehicle is unreasonably distributed.
Disclosure of Invention
The embodiment of the application aims to provide a task dispatching method, a task dispatching device, electronic equipment and a storage medium, and the problem that the transport capacity of an unmanned vehicle is unreasonable to distribute can be solved.
In a first aspect, an embodiment of the present application provides a task dispatching method, including:
acquiring emergency degree information and time information of a job task;
acquiring priority value information according to the urgency information and the time information;
sequencing a plurality of job tasks according to the priority value information to obtain a job task queue;
and dispatching the plurality of job tasks according to the job task queue.
In a second aspect, an embodiment of the present application provides a task dispatching device, including:
the first acquisition module is used for acquiring the urgency information and the time information of the job task;
the second acquisition module is used for acquiring priority value information according to the urgency information and the time information;
the sequencing module is used for sequencing a plurality of job tasks according to the priority value information to obtain a job task queue;
and the dispatching module is used for dispatching the plurality of job tasks according to the job task queue.
In a third aspect, an embodiment of the present application provides an electronic device, which includes a processor, a memory, and a program or instructions stored on the memory and executable on the processor, and when executed by the processor, the program or instructions implement the steps of the task dispatching method according to the first aspect.
In a fourth aspect, the present application provides a computer readable medium, on which a computer program is stored, the computer program comprising program instructions that, when executed by a processor, implement the steps of the task serving method according to the first aspect.
The technical scheme has the following advantages or beneficial effects:
according to the task dispatching method provided by the embodiment of the application, the dispatching logic of a plurality of operation tasks can be optimized by acquiring and applying the urgency information and the time information of the operation tasks, so that the transport capacity of the unmanned vehicle is reasonably distributed.
Drawings
Fig. 1 is a schematic flowchart of a task dispatching method according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of an automated transportation system provided in an embodiment of the present application;
FIG. 3 is a schematic structural diagram of a task dispatching device according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a schematic flow chart of a task dispatching method according to an embodiment of the present disclosure. As shown in fig. 1, the task dispatching method includes the following steps:
and step 101, acquiring the urgency information and the time information of the job task.
And 102, acquiring priority value information according to the urgency information and the time information.
And 103, sequencing the plurality of job tasks according to the priority value information to obtain a job task queue.
And 104, dispatching the plurality of job tasks according to the job task queue.
The emergency degree information may be obtained by:
a task emergency table is predefined, wherein the task emergency table comprises a plurality of groups of associated data, and the associated data comprises a task type and emergency degree information corresponding to the task type;
and acquiring the task type of the target job task, and inquiring the task urgency table according to the task type of the target job task to acquire urgency information associated with the task type of the target job task.
The urgency level information is used to describe the task priority level of the job type, and for example, different task priority levels of the job type are sequentially classified by 1 to 10, and the job type with the task priority level of 1 has the highest priority level and the job type with the task priority level of 10 has the lowest priority level. In application, the task priority ranking mode and the number of the task priority ranking can be adaptively adjusted based on actual requirements, which is not limited in the embodiment of the present application.
The task types may be ship loading tasks, ship unloading tasks, yard dumping tasks, task cancellation, task suspension, and the like, and the specific categories and numbers of the task types are not limited in the embodiments of the present application.
Compared with the prior dispatching method (based on the first-come first-serve principle), the task dispatching method provided by the application can reasonably sequence a plurality of operation tasks through setting the urgency information and the time information, can ensure that the unmanned vehicle can normally execute port transportation tasks, enables the unmanned vehicle to have the capability of timely responding to sudden tasks or urgent tasks in the port transportation process, and enables the transportation capacity of the unmanned vehicle to be reasonably distributed.
Optionally, the step of obtaining priority value information according to the urgency information and the time information includes:
acquiring priority value head information according to the urgency degree information;
acquiring priority value tail information according to the time information;
and splicing the head information of the priority value and the tail information of the priority value to obtain the information of the priority value.
And the time information is the generation time of the job task.
The above-described manner can be formulated as:
f(n)＝g(n)+h(t)；
wherein f (n) is priority value information of the job task, g (n) is priority value header information of the job task, h (t) is priority value tail information corresponding to the job task, n is a task type of the job task, and t is generation time of the job task.
By the mode, the plurality of operation tasks can be reasonably sequenced; taking the first job task and the second job task as an example (the first job task and the second job task are different job tasks in the plurality of job tasks), comparing the priority value header information of the first job task with the priority value header information of the second job task (i.e. comparing the task priorities of the first job task and the second job task);
if the task priority of the first job task is higher than the task priority of the second job task, setting the execution order of the first job task to be before the execution order of the second job task;
if the task priority of the first job task is smaller than the task priority of the second job task, setting the execution sequence of the first job task to be behind the execution sequence of the second job task;
if the task priority of the first job task is the same as the task priority of the second job task, the priority value tail information of the first job task is compared with the priority value tail information of the second job task (namely the generation time of the first job task and the second job task is compared), if the generation time of the first job task is earlier than that of the second job task, the execution order of the first job task is set to be before the execution order of the second job task, and if the generation time of the first job task is later than that of the second job task, the execution order of the first job task is set to be after the execution order of the second job task.
In practical application, the priority value head information can be expressed in an integer form, the priority value tail information can be expressed in a decimal form, for example, the numbers 1 to 10 are used for expressing task priorities of different task types, the priorities of the task types are set to be in inverse proportion to the sizes of the numbers, namely the task type with the task priority of 1 has the highest priority degree, the task type with the task priority of 10 has the lowest priority degree, meanwhile, the generation time of the task is expressed in the form of unix time stamps, and before the priority value information is acquired, the unix time stamps are converted into corresponding decimal numbers;
at this time, the process of splicing the priority value head information and the priority value tail information is a summation operation process of an integer corresponding to the priority value head information and a decimal corresponding to the priority value tail information, and if a first job task and a second job task are taken as an example, the execution order of the first job task is set to be before the execution order of the second job task when the priority value information of the first job task is smaller than the priority value information of the second job task (namely the priority of the first job task is higher than that of the second job task); in the case where the priority value information of the first job task is greater than the priority value information of the second job task (i.e., the priority of the first job task is lower than the priority of the second job task), the execution order of the first job task is set to be subsequent to the execution order of the second job task.
Compared with the mode of respectively comparing the priority value head information with the priority value tail information, the mode can simplify the comparison process of the priority value information of the first job task and the priority value information of the second job task, and improve the sequencing efficiency of the plurality of job tasks.
In practical applications, the time for generating the job task may be set as the time for looking up the urgency information, that is, the time for querying the task urgency table may be the time for generating the job task.
Optionally, the step of dispatching the plurality of job tasks according to the job task queue includes:
according to the job task queue, obtaining a head job task and dispatching the head job task;
and after the head-of-line job task is dispatched, inserting a new job task into the job task queue, and dispatching the new job task to replace the head-of-line job task under the condition that the priority value information of the new job task is higher than that of the head-of-line job task.
Wherein, the first queue job task is the job task at the head of the job task queue.
After a head-of-line job task is obtained according to the job task queue and dispatched, namely in the process of executing the head-of-line job task by an unmanned vehicle, judging whether a new job task is inserted into the job task queue;
and under the condition that no new job task is inserted into the job task queue, not dispatching other job tasks until the head-of-line job task is completed, obtaining a new head-of-line job task according to the job task queue (the head-of-line job task is removed), and dispatching the new head-of-line job task to the unmanned vehicle.
For example, if the job tasks in the job task queue are sequentially a first job task, a second job task and a third job task (the priority of the first job task is higher than that of the second job task, and the priority of the second job task is higher than that of the third job task), the first job task is the head-of-queue job task, and when the first job task is sent to the unmanned vehicle and no new job task is inserted into the job task queue, the second job task exists as a new head-of-queue job task, and after the unmanned vehicle finishes executing the first job task, the new head-of-queue job task (here, the second job task) is sent to the unmanned vehicle, so as to ensure that the job tasks in the job task queue can be executed by the unmanned vehicle in order.
And under the condition that a new job task is inserted into the job task queue, but the priority of the new job task is lower than that of the first job task, other job tasks are not dispatched until the first job task is completed, and then the new first job task is obtained according to the job task queue (the first job task is removed and the new job task is inserted), and the new first job task is dispatched to the unmanned vehicle.
For example, if the job task sequence of the job task queue is a fourth job task and a fifth job task in sequence (the priority of the fourth job task is higher than that of the third job task), the fourth job task is a first-queue job task, if the sixth job task (i.e., the new job task) is inserted into the job task queue during the process of executing the fourth job task by the unmanned vehicle, but the priority of the sixth job task is lower than that of the fourth job task, the execution process of the fourth job task is not interrupted, and only after the fourth job task is executed, a new first-queue job task is obtained according to the new job task queue (i.e., the fifth job task and the sixth job task), and the new first-queue job is dispatched to the unmanned vehicle.
And under the condition that a new operation task is inserted into the operation task queue and the priority of the new operation task is higher than that of the first operation task, the first operation task is replaced by dispatching the new operation task, so that the unmanned vehicle can quickly respond to the emergency task or the emergency task in the port transportation process.
For example, assuming that the job tasks in the job task queue are ordered as a seventh job task and an eighth job task in turn (the priority of the seventh job task is higher than that of the eighth job task), where the seventh job task is the head-of-queue job task, if the ninth job task (i.e. the new job task) is inserted into the job task queue during the execution of the seventh job task by the unmanned vehicle, and the priority of the ninth job task is higher than that of the seventh job task, the execution of the seventh job task is interrupted, and the ninth job task is dispatched to the unmanned vehicle at this time, so that the unmanned vehicle stops the execution of the seventh job task and then proceeds to execute the ninth job task.
In practical applications, high priority job tasks include, but are not limited to, cancel tasks and pause tasks;
if the ninth job task is a cancel task, the seventh job task is cancelled by the unmanned vehicle, and after the ninth job task is executed, the unmanned vehicle executes an eighth job task (namely, directly skips the seventh job task);
and if the ninth job task is a pause task, the seventh job task is interrupted by the unmanned vehicle and is stopped, and the unmanned vehicle can continue to execute the previously unfinished seventh job task by dispatching a cancel task by the operator.
Optionally, the step of sequencing the plurality of job tasks according to the priority value information to obtain a job task queue includes:
and processing the priority value information according to a heap sorting algorithm, and sorting the plurality of job tasks to obtain the job task queue.
Compared with other sequencing algorithms, such as a bubble sequencing algorithm, a quick sequencing algorithm, a hill sequencing algorithm and the like, the processing efficiency of the heap sequencing algorithm is higher (the time complexity of inserting one task into the heap sequencing algorithm is O (logn), while the general time complexity of other sequencing algorithms is O (n)), so that the sequencing efficiency of the plurality of operation tasks can be improved, and the corresponding rate of the unmanned vehicle to the burst task or the emergency task is further improved.
Generally, as shown in fig. 2, an automated transportation system of a port includes a port operation server, a man-machine interaction module, a vehicle management module, and an automated transportation means;
the port operation server is specifically used for automatically transmitting operation tasks such as loading, unloading, dumping into a storage yard, canceling, suspending and the like to the vehicle management module according to a preset instruction;
the human-computer interaction module is specifically used for receiving a control instruction input by an operator and manually transmitting operation tasks such as automatic charging, suspension and the like to the vehicle management module according to the control instruction;
the vehicle management module is specifically used for receiving a plurality of operation tasks respectively transmitted by the port operation server and the man-machine interaction module, sequencing the operation tasks according to the task dispatching method to obtain an operation task queue, and then orderly dispatching the operation tasks to the automatic transport tool based on the operation task queue;
the automated transport vehicle is specifically configured to receive and execute the job tasks dispatched by the vehicle management module.
In practical applications, the automated transportation means can be an automatic truck, an automatic guided vehicle, an unmanned straddle carrier and the like.
Referring to fig. 3, fig. 3 is a task dispatching device according to an embodiment of the present application, where the task dispatching device includes:
a first obtaining module 201, configured to obtain urgency information and time information of a job task;
a second obtaining module 202, configured to obtain priority value information according to the urgency information and the time information;
the sorting module 203 is configured to sort the plurality of job tasks according to the priority value information to obtain a job task queue;
and the dispatching module 204 is used for dispatching the plurality of job tasks according to the job task queue.
Optionally, the second obtaining module 202 is configured to:
acquiring priority value head information according to the urgency degree information;
acquiring priority value tail information according to the time information;
and splicing the head information of the priority value and the tail information of the priority value to obtain the information of the priority value.
Optionally, the dispatching module 204 is configured to:
according to the job task queue, obtaining a head job task and dispatching the head job task;
and after the head-of-line job task is dispatched, inserting a new job task into the job task queue, and dispatching the new job task to replace the head-of-line job task under the condition that the priority value information of the new job task is higher than that of the head-of-line job task.
Optionally, the sorting module 203 is configured to:
and processing the priority value information according to a heap sorting algorithm, and sorting the plurality of job tasks to obtain the job task queue.
It should be noted that the task distribution device in the embodiment of the present application may be a device, and may also be a component, an integrated circuit, or a chip in an electronic device.
Referring to fig. 4, fig. 4 is a structural diagram of an electronic device according to an embodiment of the present disclosure, and as shown in fig. 4, the electronic device 300 includes: a memory 301, a processor 302, and a program or instructions stored on the memory 301 and executable on the processor 302, the program or instructions implementing the steps in the task dispatching method described above when executed by the processor 302.
Embodiments of the present application also provide a readable medium that can employ any combination of one or more computer-readable media. The readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or terminal. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a readable storage medium (such as ROM or RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present application.
While the present embodiments have been described with reference to the accompanying drawings, it is to be understood that the invention is not limited to the precise embodiments described above, which are meant to be illustrative and not restrictive, and that various changes may be made therein by those skilled in the art without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A task dispatching method is characterized by comprising the following steps:
acquiring emergency degree information and time information of a job task;
acquiring priority value information according to the urgency information and the time information;
sequencing a plurality of job tasks according to the priority value information to obtain a job task queue;
and dispatching the plurality of job tasks according to the job task queue.
2. The method according to claim 1, wherein the step of obtaining priority value information based on the urgency information and the time information comprises:
acquiring priority value head information according to the urgency degree information;
acquiring priority value tail information according to the time information;
and splicing the head information of the priority value and the tail information of the priority value to obtain the information of the priority value.
3. The method of claim 1, wherein the step of dispatching the plurality of job tasks according to the job task queue comprises:
according to the job task queue, obtaining a head job task and dispatching the head job task;
and after the head-of-line job task is dispatched, inserting a new job task into the job task queue, and dispatching the new job task to replace the head-of-line job task under the condition that the priority value information of the new job task is higher than that of the head-of-line job task.
4. The method according to claim 1, wherein the step of sorting the plurality of job tasks according to the priority value information to obtain a job task queue comprises:
and processing the priority value information according to a heap sorting algorithm, and sorting the plurality of job tasks to obtain the job task queue.
5. A task dispatching device, characterized in that the device comprises:
the first acquisition module is used for acquiring the urgency information and the time information of the job task;
the second acquisition module is used for acquiring priority value information according to the urgency information and the time information;
the sequencing module is used for sequencing a plurality of job tasks according to the priority value information to obtain a job task queue;
and the dispatching module is used for dispatching the plurality of job tasks according to the job task queue.
6. The apparatus of claim 5, wherein the second obtaining module is configured to:
acquiring priority value head information according to the urgency degree information;
acquiring priority value tail information according to the time information;
and splicing the head information of the priority value and the tail information of the priority value to obtain the information of the priority value.
7. The apparatus of claim 5, wherein the dispatch module is configured to:
according to the job task queue, obtaining a head job task and dispatching the head job task;
and after the head-of-line job task is dispatched, inserting a new job task into the job task queue, and dispatching the new job task to replace the head-of-line job task under the condition that the priority value information of the new job task is higher than that of the head-of-line job task.
8. The apparatus of claim 5, wherein the ordering module is configured to:
and processing the priority value information according to a heap sorting algorithm, and sorting the plurality of job tasks to obtain the job task queue.
9. An electronic device comprising a processor, a memory, and a program or instructions stored on the memory and executable on the processor, the program or instructions when executed by the processor implementing the steps of the method according to any one of claims 1-4.
10. A readable medium, characterized in that it has stored thereon a program or instructions which, when executed by a processor, carry out the steps of the method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110740295.6A CN113379308A (en) | 2021-06-30 | 2021-06-30 | Task distribution method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110740295.6A CN113379308A (en) | 2021-06-30 | 2021-06-30 | Task distribution method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113379308A true CN113379308A (en) | 2021-09-10 |
Family
ID=77580390
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110740295.6A Pending CN113379308A (en) | 2021-06-30 | 2021-06-30 | Task distribution method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113379308A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016197716A1 (en) * | 2016-01-18 | 2016-12-15 | 中兴通讯股份有限公司 | Task scheduling method and device |
| CN109117260A (en) * | 2018-08-30 | 2019-01-01 | 百度在线网络技术（北京）有限公司 | A kind of method for scheduling task, device, equipment and medium |
| CN112181645A (en) * | 2020-09-21 | 2021-01-05 | 中国建设银行股份有限公司 | Resource scheduling method, device, equipment and storage medium |
-
2021
- 2021-06-30 CN CN202110740295.6A patent/CN113379308A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016197716A1 (en) * | 2016-01-18 | 2016-12-15 | 中兴通讯股份有限公司 | Task scheduling method and device |
| CN109117260A (en) * | 2018-08-30 | 2019-01-01 | 百度在线网络技术（北京）有限公司 | A kind of method for scheduling task, device, equipment and medium |
| CN112181645A (en) * | 2020-09-21 | 2021-01-05 | 中国建设银行股份有限公司 | Resource scheduling method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109902975B (en) | Scheduling method, system, apparatus and computer readable storage medium | |
| CN113627775B (en) | Scheduling method, device, equipment and storage medium of robot | |
| CN112116247A (en) | Order processing and ex-warehouse method, equipment, system and storage medium | |
| CN115545586B (en) | OHT (overhead hoist transport vehicle) scheduling method, device and terminal | |
| CN108615120B (en) | Intercity vehicle queuing order dispatching method and medium | |
| CN110084974A (en) | A kind of information processing method and device of the deposit of Intelligent logistics package | |
| CN113313335A (en) | Logistics vehicle scheduling method and device and storage medium | |
| CN109683504B (en) | Warehouse-out control method and device, electronic equipment and storage medium | |
| CN109840725A (en) | Cargo picking method, device, electronic device and computer readable storage medium | |
| CN111308995B (en) | Scheduling method and device of transfer robot, medium and electronic equipment | |
| CN116165984A (en) | Logistics control method, device, equipment, medium and product | |
| CN113449895A (en) | Vehicle dispatching method and device | |
| CN112150048A (en) | Transport control method, transport control device, electronic apparatus, and storage medium | |
| CN113222205A (en) | Path planning method and device | |
| CN113393193B (en) | Warehouse-out method and device | |
| CN111144796A (en) | Method and device for generating tally information | |
| CN113379308A (en) | Task distribution method and device, electronic equipment and storage medium | |
| CN111451155B (en) | Sorting task processing method and device, warehouse control system and storage medium | |
| CN115564178A (en) | Task order combination method, device, equipment and storage medium | |
| WO2020034433A1 (en) | Dispatching processing method and system | |
| CN110276508A (en) | Method and apparatus for distributing mission bit stream | |
| CN111724092A (en) | Data processing method and device, electronic equipment and storage medium | |
| WO2022068935A9 (en) | Elevator resource scheduling method and apparatus | |
| CN115099666A (en) | Robot scheduling method and device and electronic equipment | |
| CN107944798A (en) | Intelligent goods dispatch method and system |
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 |