CN102236825A - Method for scheduling tasks of conveyer of airport freight logistics system - Google Patents
Method for scheduling tasks of conveyer of airport freight logistics system Download PDFInfo
- Publication number
- CN102236825A CN102236825A CN2010101554961A CN201010155496A CN102236825A CN 102236825 A CN102236825 A CN 102236825A CN 2010101554961 A CN2010101554961 A CN 2010101554961A CN 201010155496 A CN201010155496 A CN 201010155496A CN 102236825 A CN102236825 A CN 102236825A
- Authority
- CN
- China
- Prior art keywords
- task
- conveyor
- priority
- current
- common path
- 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
Landscapes
- Control Of Conveyors (AREA)
Abstract
The invention discloses a method for scheduling tasks of a conveyer of an airport freight logistics system. The method comprises the following steps: (1) sorting the tasks of the conveyer according to the priorities of the tasks of the conveyer; (2) decomposing the tasks of a whole conveyer line into a single step task of each conveyer; (3) defining the single-step state of the tasks according to steps which are executed on the conveyer for single-step tasks; and (4) determining the common path passed by the tasks which are fed in and discharged simultaneously, comparing the time for passing the common path for the tasks with low priority with the time for reaching the common path for the tasks with high priority, and determining whether the tasks with low priority can pass the common path preferentially. According to the invention, through analyzing and processing the tasks of the conveyer dynamically, the tasks with low priority and the tasks with high priority can be processed in parallel as much as possible, the container conveying efficiency of the conveyer of the airport freight logistics system is improved, and the cargo processing capability of the airport freight logistics system is expanded.
Description
Technical field
The present invention relates to task scheduling, particularly, relate to the dispatching method that the conveyor multi-task parallel of a kind of airport freight logistics system is handled in real time.
Background technology
Airport freight logistics system is the main system that airfreight ground goods is handled, and the goods transport portion of airport freight logistics system comprises plane conveying equipment (conveyor) and mobile conveying equipment (lift transfer car(buggy) and lane stacker).Freight logistics system transport portion operational mode in large-scale airport generally is divided into manually, unit automatically, full-automatic, under fully automatic mode, the conveying of machine for collecting load be by computer supervisory control system according to carrying task scheduling, the conveying task is finished in the operation of commander PLC control conveying equipment.At present, freight logistics system transport portion great majority in domestic large-scale airport all operate under the unit automatic mode, and the fully automatic operation system that adopts computer monitoring is seldom arranged.The general discrepancy that need satisfied handle a plurality of collection dress plate casees simultaneously of large-scale airport freight logistics system assembly area conveyor design is carried, the conveyor task scheduling is the problem of a more complicated, and the conveyor task scheduling directly has influence on the ability that logistics system is handled goods.
Method for airport freight logistics system conveyor task scheduling seldom has document description, two kinds of methods of main existence in the prior art, a kind of is the sequential scheduling method, it is in strict accordance with priority orders, each task is carried out in serial scheduling, and every task executes, and carries out next bar task again, but since this dispatching method consuming time oversize, efficient is too low, generally can not use in actual applications; Another kind is according to priority parallel dispatching method, it is according to priority, to there not being the just reverse task of path conflict, parallel scheduling is handled, when the low instruction of priority arrives the path that the high reverse task of priority passes through, wait for that the high reverse task of priority carries out earlier, this method handle multiple-task parallel, arrange under the many situations of more complicated, just reverse task, the task of low priority is handled slowly, has the not high problem of time-consuming length, efficient.
Summary of the invention
The objective of the invention is at the above-mentioned defective that exists in the prior art, a kind of conveyor utilization factor that can improve airport freight logistics system when multi-task parallel is provided, saves time, improve the conveyor method for scheduling task of airport freight logistics system handles goods ability.
The technical scheme that realizes above-mentioned purpose is as follows:
The conveyor method for scheduling task of a kind of airport freight logistics system, this method comprises the steps:
(1) according to the priority of conveyor task, with the task ranking of conveyor;
(2) task of whole piece pipeline is decomposed into the single step task of each conveyor;
(3) step of on conveyor, carrying out according to single step task, the single step state of definition task;
(4) for the task of coming in and going out and carrying out simultaneously, the common path of the process that sets the tasks, by low priority task was compared by the time of common path and the time of high-priority task arrival common path, judge whether the task of low priority can preferentially pass through common path.
Further, the priority of described conveyor task determines that method is: at first with task by urgency level ordering, for the identical task of urgency level, press genesis sequence again and sort, final obtain the formation that the conveyor task sorts by priority.
Further, for the task of coming in and going out and carrying out simultaneously, the common path of the process that sets the tasks, if the time of low priority task by common path reaches time of common path less than high-priority task, then low priority task can preferentially be passed through common path.
Further, this dispatching method specifically comprises the steps:
Step 1 is taken out the conveyor task, and whole tasks of conveyor are pressed priority ordering, obtains the formation M that the conveyor task sorts by priority, and takes out a task M in order
iCarrying out next step scheduling handles;
Step 2 determines whether the conveyor task of taking out needs scheduling to handle;
The single step state of conveyor task represents with S, be defined as be untreated, occupy-place, etc. instruction to be sent, instruction send, single step finishes, and represents with 0,1,2,3,4 that respectively judgement task single step state instruction S to be sent such as is if state is arranged in the task single step
j=2 single step represents that this task scheduling processing finishes, and this task is current not to need scheduling to handle, and returns step 1, takes off a task M
I+1Dispatch processing; If not having state in the task single step instruction S to be sent such as is
j=2 single step, taking-up state are occupy-place S
jT is used in=1 single step and next single step respectively
kExpression and T
K+1Expression is carried out next step scheduling and is handled;
Step 3 is judged the conveyor state;
The conveyor state represents with D, is defined as automatically, stops automatically, non-automatic, uses 0,1,2 expressions respectively.The single step T of conveyor task
kThe conveyor state D of process
mConveyor current task M is judged in expression
iCurrent single step T
kThe conveyor state D of process
mWith next single step T
K+1The conveyor state D of process
M+1Whether be full-automatic, if D
m=0 and D
M+1=0, carry out next step scheduling and handle; If D
m≠ 0 or D
M+1≠ 0, return step 1, take off a task M
I+1Dispatch processing;
Step 4 is judged the conveyor occupy-place;
The conveyor occupy-place is meant that the task single step state through conveyor is S
j=1, judge conveyor current task M
iNext single step T
K+1Whether the conveyor of process, carries out next step scheduling and handles if there is not occupy-place by other task occupy-places; If occupy-place is arranged, return step 1, take off a task M
I+1Dispatch processing;
Step 5 has judged whether reverse task;
Judge next single step T
K+1Whether the conveyor of process has and current scheduling task M
iThroughput direction is opposite, and high not the executing the task of this task priority of priority ratio, and low carrying out of the task of this task priority of priority ratio, if do not have, and current task M
iCan carry out, revise current single step T
kState such as is at command status S to be sent
k=2, revise next step single step T
K+1State is occupy-place S
K+1=1, enter the transmission instruction module; If have, enter next step scheduling and handle.
Step 6 is calculated common path, stand-by period and the time of passing through, and this step comprises following small step:
(1) takes out through next conveyor and current scheduling task M
iDirection is opposite, and high all of priority ratio current task are not finished the work and low carrying out of the task of priority ratio current task, and sorts by priority, and this a part of task definition is current task M
iReverse task, represent with Q;
(2) with current task M
iStand-by period t
MwZero clearing, i.e. t
Mw=0;
(3) get a reverse task Q
n, calculate current task M
iWith reverse task Q
nThe common path of process is represented with P, and P is the set that comprises several conveyors;
(4) take out reverse task Q
nThe single step state is occupy-place S
x=1 single step the conveyor W of process;
(a) if conveyor W is contained in common path set P, current task M
iCan't carry out, calculate current task M
iWait for reverse task Q
nTime t by common path
QpIf the stand-by period t of this calculating
QpStand-by period t greater than the current task preservation
Mw, with the stand-by period t of this calculating
QpUpgrade the stand-by period t that current task is preserved
Mw, i.e. t
Mw=t
QpOtherwise do not upgrade;
(b) if conveyor W is not contained in common path set P, and reverse task Q
nPriority ratio current task M
iThe priority height, obtain reverse task Q
nArrive the time t of common path
QrJudge current task M
iTime t by common path
MpWhether less than reverse task Q
nArrive the time t of common path
QrIf, t
Mp〉=t
Qr, then upgrade current task M
iStand-by period t
MwBe reverse task Q
nArrive the time t of common path
QrAdd reverse task Q
nTime t by common path
QpBe t
Mw=t
Qr+ t
QpIf t
Mp＜t
QrThen do not upgrade t
Mw
(c) if conveyor W is not contained in common path set P, and reverse task Q
nPriority ratio current task M
iPriority low, judgment processing not;
(5) take off a reverse task Q
N+1, repeating (3), (4) step judges whether to need to upgrade current task M
iStand-by period t
Mw
(6) after all reverse duty cycle is handled, if current task M
iStand-by period t
MwBe 0, current task M then
iCan carry out current single step T
k, revise current task M
iCurrent single step T
kState instruction S to be sent such as be
k=2, revise current task M
iNext step single step T
K+1State be occupy-place S
K+1=1, enter instructions to be sent such as sending instruction module;
Step 7 is taken off a task M
I+1, repeating step 2 to step 6 is dispatched processing;
Step 8, wait to dispatch all tasks among the task M of processing all dispatch handle after, return step 1, reinitialize the task queue of conveyor, carry out the next round scheduling and handle.
Below be explaining to part notion related in the above-mentioned dispatching method:
1, task single step state: according to the scheduling needs, conveyor task single step state be divided into be untreated, occupy-place, etc. instruction to be sent, instruction send, single step finishes, and uses 0,1,2,3,4 expressions respectively.
2, the multi-task common path: the multi-task is not also finished the public conveyor that part is passed through.In conveyor task implementation, along with constantly finishing of single step task, the multi-task common path is constantly changing, and in every one step of execution of task, all needs to rejudge.
3, task enters the stand-by period of common path: if when the task of low priority arrives common path, high-priority task is not also by common path, and low priority task waits for that high-priority task enters the stand-by period of common path by the time task of being of common path.
4, task is by the time of common path: task is from entering common path to the time of leaving common path.
Beneficial effect of the present invention is as follows:
1, by common path, the task stand-by period that proposes just reverse task, the notion such as time of passing through common path, effectively raise the conveyor Processing tasks ability when the discrepancy task exists simultaneously on the wall scroll pipeline, avoided the path conflict and the deadlock of the task of coming in and going out.
2, by dynamically the conveyor task being carried out analyzing and processing, the task of making low priority as far as possible with the high-priority task parallel processing, improved the efficient of the conveyor delivery machine for collecting load of airport freight logistics system, enlarged the ability of airport freight logistics system handles goods, especially for arranging more complicated, under the many situation of just reverse conveying task, its beneficial effect is more obvious, and the transfer efficiency of induction system is improved a lot.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Description of drawings
Accompanying drawing is used to provide further understanding of the present invention, and constitutes the part of instructions, is used from explanation the present invention with embodiments of the invention one, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the floor map of airport freight logistics system collection loading thing pipeline.
Embodiment
Embodiment 1
With one of certain airport freight logistics system collection loading thing pipeline is example, and the conveyor method for scheduling task of a kind of airport of the present invention freight logistics system is described.As shown in Figure 1, the planimetric map that has wherein shown certain airport freight logistics system collection loading thing pipeline.
Expression transport platform numberings such as numbering " 3300 " shown in the figure, front two is represented the train value at conveyor place, the row value at two bit representation conveyor places, back.
Simply clear in order to explain, suppose that current pipeline has 4 tasks, the current start position that all is in, their transport path is respectively:
Task 1: shelf → 3111 → 3110 → 3109 → 3108 → 3107 → 3207 → 3307 → 3407
Task 2:3300 → 3301 → 3302 → 3303 → 3304 → 3305 → 3306 → 3307 → 3308 → 3309 → 3310 → 3311 → shelf
Task 3: shelf → 3111 → 3110 → 3109 → 3108 → 3107 → 3207 → 3307 → 3306 → 3305 → 3205
Task 4:3405 → 3305 → 3306 → 3307 → 3308 → 3309 → 3311 → shelf
Article 4, the priority relationship of task is " task 1＞task 2＞task 3＞task 4 ".
Suppose that the conveying task all is a unit 1 through the time of each transport platform, the state of conveyor is full-automatic all the time in the task course of conveying.The time that following comparative sequence is dispatched, according to priority walk abreast dispatching method and dispatching method of the present invention are finished these 4 tasks costs, as shown in the table:
The process that 4 tasks are handled in 3 kinds of dispatching method scheduling is described below.
1, sequential scheduling method: in strict accordance with priority orders, 4 tasks are carried out in serial scheduling, after every task is complete, carry out next bar task again.The time of this method Processing tasks cost is the longest, reaches 38 unit interval.In actual applications, because this dispatching method is consuming time oversize, efficient is too low, generally can not use.
2, according to priority parallel dispatching method: according to priority, to there not being the just reverse task of path conflict, parallel scheduling is handled, and when the low instruction of priority arrives the path that the high reverse task of priority passes through, waits for that the high reverse task of priority carries out earlier.
(1) task 1 priority is the highest, does not need to wait for other tasks in the implementation, and the time of task 1 cost is 8 unit interval.
(2) task 2 is in the path during " 3300--3306 " this section, the reverse task higher not than its priority, and this section path can continual continuous execution, needs 6 unit interval.When task 2 arrived 3306 transport platform, task 1 arrived 3207 transport platform, the common path of task 1 and task 2 during 3307 transport platform, and task 2 needs wait task 1 earlier through 3307 transport platform.Task 2 need be waited for 2 unit interval in 3306 transport platform, and task 1 could be passed through 3307 transport platform.Task 2 needs 5 unit interval through path " 3307--shelf ".Therefore, 2 times that need of finishing the work are (6+2+5)=13 unit interval.
(3) after task 3 needs wait task 1 to leave 3111 transport platform, could carry out from shelf, need to wait for 2 unit interval to 3111 transport platform.During " shelf--3207 " this section, can continually not carry out, and needs 6 unit interval by the reverse task higher than its priority in the path for task 3.When task 3 arrived 3207 transport platform, task 2 was in 3306 transport platform, and task 3 needs common path 3307 transport platform of wait task 2 by them, needs to wait for 2 unit interval.Task 3 is during through this section of path " 3307--3205 ", and the reverse task higher than its priority do not need 4 unit interval.Therefore, 3 times that need of finishing the work are (2+6+2+4)=14 unit interval.
(4) task 4 needs time (2+6+2+4)=14 unit interval of wait task 3 by their common path 3305 transport platform.After task 4 begins to carry, do not have the reverse task higher again, need 8 unit interval than its priority.Therefore, 4 times that need of finishing the work are (2+6+2+4+8)=22 unit interval.
The T.T. of using said method to finish 4 tasks is 22 unit interval.
3, conveyor method for scheduling task of the present invention: the scheduling of task 1, task 2, task 3 is handled identical with the scheduling result of " according to priority parallel dispatching method ".For task 4,, carry out following steps and handle according to dispatching method of the present invention:
(1) the current step is 3405, and next step is 3305, has 1 through next step high unenforced reverse instruction of ratio task 4 priority of 3305, is task 3.
(2) common path of task 3 and task 4 is " 3305--3307 ", and task 3 arrives the time t of common path
QrBe 8 unit interval (wherein 2 unit interval are the time that 3111 transport platform are left in task 3 wait tasks 1, and 6 unit interval are the time of task 3 from shelf to 3207).Task 4 is by the time t of common path
MpIt is 4 unit interval.Because t
Mp＜t
Qr, task 4 can be carried out.
When (3) task 4 arrived 3306 transport platform, the high unenforced reverse task of ratio task 4 priority of next step 3307 transport platform of process had 2, is task 1 and task 3.
(4) task arrives 3110 transport platform 1 this moment, and task 1 arrives the time t of common path
QrBe 4 unit interval, task 4 is by the time t of common path
MpBe that 2 unit interval are because t
Mp＜t
Qr, task 4 can be carried out.
(5) task 3 is at this moment also at shelf, and task 3 arrives the time t of common paths
QrBe 6 unit interval, task 4 is by the time t of common path
MpBe that 2 unit interval are because t
Mp＜t
Qr, task 4 can be carried out.
Therefore, task 4 does not need to wait in the process of carrying, and needs 8 unit interval, and in this 8 unit interval, other 3 tasks are carried out and are not affected, and have reached the maximization of system's parallel processing task.
According to dispatching method of the present invention, the T.T. that handling these 4 tasks needs is 14 unit interval, has reduced by 8 unit interval than the method for dispatching that according to priority walks abreast.
Above example is an example with certain airport freight logistics system strip transmission line, has chosen 4 conveying tasks dispatching method of the present invention is illustrated, and its content is not to limit range of application of the present invention.In actual applications, dispatching method of the present invention is fit to the task scheduling processing of various pipelines, and for arranging more complicated, under the many situation of just reverse conveying task, its advantage applies gets more obvious, and the transfer efficiency of induction system is improved a lot.
Claims (4)
1. the conveyor method for scheduling task of an airport freight logistics system is characterized in that, this method comprises the steps:
(1) according to the priority of conveyor task, with the task ranking of conveyor;
(2) task of whole piece pipeline is decomposed into the single step task of each conveyor;
(3) step of on conveyor, carrying out according to single step task, the single step state of definition task;
(4) for the task of coming in and going out and carrying out simultaneously, the common path of the process that sets the tasks, by low priority task was compared by the time of common path and the time of high-priority task arrival common path, judge whether the task of low priority can preferentially pass through common path.
2. the conveyor method for scheduling task of a kind of airport according to claim 1 freight logistics system, it is characterized in that, the priority of described conveyor task determines that method is: at first task is sorted by urgency level, for the identical task of urgency level, press the genesis sequence ordering again, finally obtain the formation that the conveyor task sorts by priority.
3. the conveyor method for scheduling task of a kind of airport according to claim 1 and 2 freight logistics system, it is characterized in that, for the task of coming in and going out and carrying out simultaneously, the common path of the process that sets the tasks, if the time of low priority task by common path reaches time of common path less than high-priority task, then low priority task can preferentially be passed through common path.
4. the conveyor method for scheduling task of a kind of airport according to claim 3 freight logistics system is characterized in that, specifically comprises the steps:
Step 1 is taken out the conveyor task, and whole tasks of conveyor are pressed priority ordering, obtains the formation M that the conveyor task sorts by priority, and takes out a task M in order
iCarrying out next step scheduling handles;
Step 2 determines whether the conveyor task of taking out needs scheduling to handle;
The single step state of conveyor task represents with S, be defined as be untreated, occupy-place, etc. instruction to be sent, instruction send, single step finishes, and represents with 0,1,2,3,4 that respectively judgement task single step state instruction S to be sent such as is if state is arranged in the task single step
j=2 single step represents that this task scheduling processing finishes, and this task is current not to need scheduling to handle, and returns step 1, takes off a task M
I+1Dispatch processing; If not having state in the task single step instruction S to be sent such as is
j=2 single step, taking-up state are occupy-place S
jT is used in=1 single step and next single step respectively
kExpression and T
K+1Expression is carried out next step scheduling and is handled;
Step 3 is judged the conveyor state;
The conveyor state represents with D, is defined as automatically, stops automatically, non-automatic, uses 0,1,2 expressions respectively.The single step T of conveyor task
kThe conveyor state D of process
mConveyor current task M is judged in expression
iCurrent single step T
kThe conveyor state D of process
mWith next single step T
K+1The conveyor state D of process
M+1Whether be full-automatic, if D
m=0 and D
M+1=0, carry out next step scheduling and handle; If D
m≠ 0 or D
M+1≠ 0, return step 1, take off a task M
I+1Dispatch processing;
Step 4 is judged the conveyor occupy-place;
The conveyor occupy-place is meant that the task single step state through conveyor is S
j=1, judge conveyor current task M
iNext single step T
K+1Whether the conveyor of process, carries out next step scheduling and handles if there is not occupy-place by other task occupy-places; If occupy-place is arranged, return step 1, take off a task M
I+1Dispatch processing;
Step 5 has judged whether reverse task;
Judge next single step T
K+1Whether the conveyor of process has and current scheduling task M
iThroughput direction is opposite, and high not the executing the task of this task priority of priority ratio, and low carrying out of the task of this task priority of priority ratio, if do not have, and current task M
iCan carry out, revise current single step T
kState such as is at command status S to be sent
k=2, revise next step single step T
K+1State is occupy-place S
K+1=1, wait instruction to be sent; If have, enter next step scheduling and handle.
Step 6 is calculated common path, stand-by period and the time of passing through, and this step comprises following small step:
(1) takes out through next conveyor and current scheduling task M
iDirection is opposite, and high all of priority ratio current task are not finished the work and low carrying out of the task of priority ratio current task, and sorts by priority, and this a part of task definition is current task M
iReverse task, represent with Q;
(2) with current task M
iStand-by period t
MwZero clearing, i.e. t
Mw=0;
(3) get a reverse task Q
n, calculate current task M
iWith reverse task Q
nThe common path of process is represented with P, and P is the set that comprises several conveyors;
(4) take out reverse task Q
nThe single step state is occupy-place S
x=1 single step the conveyor W of process;
(a) if conveyor W is contained in common path set P, current task M
iCan't carry out, calculate current task M
iWait for reverse task Q
nTime t by common path
QpIf the stand-by period t of this calculating
QpStand-by period t greater than the current task preservation
Mw, with the stand-by period t of this calculating
QpUpgrade the stand-by period t that current task is preserved
Mw, i.e. t
Mw=t
QpOtherwise do not upgrade;
(b) if conveyor W is not contained in common path set P, and reverse task Q
nPriority ratio current task M
iThe priority height, obtain reverse task Q
nArrive the time t of common path
QrJudge current task M
iTime t by common path
MpWhether less than reverse task Q
nArrive the time t of common path
QrIf, t
Mp〉=t
Qr, then upgrade current task M
iStand-by period t
MwBe reverse task Q
nArrive the time t of common path
QrAdd reverse task Q
nTime t by common path
QpBe t
Mw=t
Qr+ t
QpIf t
Mp＜t
QrThen do not upgrade t
Mw
(c) if conveyor W is not contained in common path set P, and reverse task Q
nPriority ratio current task M
iPriority low, judgment processing not;
(5) take off a reverse task Q
N+1, repeating (3), (4) step judges whether to need to upgrade current task M
iStand-by period t
Mw
(6) after all reverse duty cycle is handled, if current task M
iStand-by period t
MwBe 0, current task M then
iCan carry out current single step T
k, revise current task M
iCurrent single step T
kState instruction S to be sent such as be
k=2, revise current task M
iNext step single step T
K+1State be occupy-place S
K+1=1, wait instruction to be sent;
Step 7 is taken off a task M
I+1, repeating step 2 to step 6 is dispatched processing;
Step 8, wait to dispatch all tasks among the task M of processing all dispatch handle after, return step 1, reinitialize the task queue of conveyor, carry out the next round scheduling and handle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010155496.1A CN102236825B (en) | 2010-04-26 | 2010-04-26 | Method for scheduling tasks of conveyer of airport freight logistics system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010155496.1A CN102236825B (en) | 2010-04-26 | 2010-04-26 | Method for scheduling tasks of conveyer of airport freight logistics system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102236825A true CN102236825A (en) | 2011-11-09 |
| CN102236825B CN102236825B (en) | 2014-03-26 |
Family
ID=44887459
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010155496.1A Expired - Fee Related CN102236825B (en) | 2010-04-26 | 2010-04-26 | Method for scheduling tasks of conveyer of airport freight logistics system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102236825B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106991547A (en) * | 2016-01-20 | 2017-07-28 | 上海热璞网络科技有限公司 | A kind of express delivery router-level topology system and computational methods |
| CN107065547A (en) * | 2017-04-07 | 2017-08-18 | 西北工业大学 | A kind of autonomous rendezvous strategy of noncooperative target based on kernel method |
| CN111285132A (en) * | 2020-03-18 | 2020-06-16 | 华润电力技术研究院有限公司 | Thermal power equipment and control method and system for material piling and taking of circular coal yard of thermal power equipment |
| CN112016782A (en) * | 2020-05-09 | 2020-12-01 | 天津市市政工程设计研究院 | Method and system for calculating airport freight traffic demand in real time |
| CN117094629A (en) * | 2023-09-18 | 2023-11-21 | 兰州交通大学 | Dangerous goods full-load distribution path optimization and vehicle dispatching method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1286264A2 (en) * | 2001-08-09 | 2003-02-26 | Matsushita Electric Industrial Co., Ltd. | Device for task scheduling with priority levels |
| CN101290668A (en) * | 2008-06-16 | 2008-10-22 | 中国移动通信集团湖北有限公司 | Time sharing operation dynamic dispatching method and device |
-
2010
- 2010-04-26 CN CN201010155496.1A patent/CN102236825B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1286264A2 (en) * | 2001-08-09 | 2003-02-26 | Matsushita Electric Industrial Co., Ltd. | Device for task scheduling with priority levels |
| CN101290668A (en) * | 2008-06-16 | 2008-10-22 | 中国移动通信集团湖北有限公司 | Time sharing operation dynamic dispatching method and device |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106991547A (en) * | 2016-01-20 | 2017-07-28 | 上海热璞网络科技有限公司 | A kind of express delivery router-level topology system and computational methods |
| CN106991547B (en) * | 2016-01-20 | 2020-05-15 | 上海热璞网络科技有限公司 | Express route calculation system and method |
| CN107065547A (en) * | 2017-04-07 | 2017-08-18 | 西北工业大学 | A kind of autonomous rendezvous strategy of noncooperative target based on kernel method |
| CN111285132A (en) * | 2020-03-18 | 2020-06-16 | 华润电力技术研究院有限公司 | Thermal power equipment and control method and system for material piling and taking of circular coal yard of thermal power equipment |
| CN112016782A (en) * | 2020-05-09 | 2020-12-01 | 天津市市政工程设计研究院 | Method and system for calculating airport freight traffic demand in real time |
| CN112016782B (en) * | 2020-05-09 | 2023-11-21 | 天津市政工程设计研究总院有限公司 | Airport freight transportation traffic demand real-time calculation method and system |
| CN117094629A (en) * | 2023-09-18 | 2023-11-21 | 兰州交通大学 | Dangerous goods full-load distribution path optimization and vehicle dispatching method |
| CN117094629B (en) * | 2023-09-18 | 2024-05-10 | 兰州交通大学 | Dangerous goods full-load distribution path optimization and vehicle dispatching method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102236825B (en) | 2014-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102440421B1 (en) | Order processing method and device, server, and storage medium | |
| CN101604416A (en) | A kind of transportation dispatching method and dispatching system thereof of joining the center based on the third-party logistics collection | |
| CN102236825B (en) | Method for scheduling tasks of conveyer of airport freight logistics system | |
| CN107544513B (en) | Anti-deadlock scheduling method and device for multi-capacity automatic guided vehicle | |
| CN103955818A (en) | Task scheduling method of multilayer shuttle vehicle automatic warehousing system | |
| KR20150058332A (en) | Shipping work planning system, shipping work planning method, and shipping work method | |
| RU2743124C2 (en) | Method for setting the sequence of cargo movement in the automated distribution system | |
| CN108241946B (en) | Automatic sorting system and method and automatic conveying unit | |
| CN107899958B (en) | Multi-platform article progressive sorting system and method | |
| CN109823757A (en) | A kind of plate warehouse-out method, system and storage medium | |
| CN114154922A (en) | Tobacco storage scheduling system | |
| Xu et al. | Assignment of parcels to loading stations in robotic sorting systems | |
| CN110782088B (en) | UWB-based vehicle scheduling optimization system and method thereof | |
| CN111123870A (en) | System control method and device and electronic equipment | |
| CN112906996A (en) | Storage picking optimization method, storage picking system and storage operation system | |
| CN113262982B (en) | Goods sorting method, system, device, electronic equipment and storage medium | |
| CN113033971B (en) | Server, and waybill scheduling method, medium and device of delivery robot | |
| CN111891611B (en) | Intelligent warehousing distribution system, method and device and readable storage medium | |
| US11319162B2 (en) | Method for the management, in flow mode, a buffer storage and load sequencing system, and corresponding management unit | |
| CN108453046A (en) | A kind of intellectual access goods system and intellectual access pallet piling up method | |
| Kong et al. | A physical emulation model of cellular warehousing for e-commerce logistics | |
| CN102241330B (en) | ETV (elevating transfer vehicle) task scheduling method of airport cargo logistics system | |
| CN103399561B (en) | Automatic job distribution transport method and system | |
| CN114260188A (en) | Multi-station multi-equipment intelligent transportation and carrying regulation and control method | |
| US11339005B2 (en) | Method for the management, in sorting mode, of a buffer storage and load sequencing system, and corresponding management unit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140326 Termination date: 20150426 |
|
| EXPY | Termination of patent right or utility model |