CN106447169A - Electronic fence scheduling optimization method - Google Patents

Electronic fence scheduling optimization method Download PDF

Info

Publication number
CN106447169A
CN106447169A CN201610790959.9A CN201610790959A CN106447169A CN 106447169 A CN106447169 A CN 106447169A CN 201610790959 A CN201610790959 A CN 201610790959A CN 106447169 A CN106447169 A CN 106447169A
Authority
CN
China
Prior art keywords
installer
task
mission area
corresponding relation
region
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
Application number
CN201610790959.9A
Other languages
Chinese (zh)
Inventor
欧阳宏亮
翁锡逵
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Zengxin Information Technology Co Ltd
Original Assignee
Guangzhou Zengxin Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangzhou Zengxin Information Technology Co Ltd filed Critical Guangzhou Zengxin Information Technology Co Ltd
Priority to CN201610790959.9A priority Critical patent/CN106447169A/en
Publication of CN106447169A publication Critical patent/CN106447169A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311Scheduling, planning or task assignment for a person or group

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses an electronic fence scheduling optimization method, which can effectively allocate tasks to installation workers, solve the problem of time consumption and improve customer experience. The electronic fence scheduling optimization method provided by the invention comprises the steps of establishing a corresponding relationship between an installation worker and a task region; when an order is generated, determining the task region; determining the installation worker corresponding to the installation region according to the corresponding relationship; and allocating a task to the installation worker corresponding to the task region. The corresponding relationship between the installation worker and the task region is established in a system, and the installation worker in charge of the region can be determined only by determining the task region of the task, so that the problem that a customer service staff cannot contact the installation worker is avoided and the problem of time consumption is effectively solved.

Description

A kind of fence method for optimizing scheduling
Technical field
The present invention relates to logistlcs technology field, more particularly to a kind of fence method for optimizing scheduling.
Background technology
Logistics is transportation of the goods from supplier to consumer.Current large cargo on-sites install service and significantly facilitates Consumer life, improves customer experience.However, after customer service at present is connected to order, needing to contact installer, typically passing through Phone, the mode of note or wechat and installer contact.If the installer of current relationship does not have free time or contact not On, it is necessary to contact an other installer again, so when having installer idle, then installation task is distributed to this Installer.Due to contact installer time-consuming due to, causing to on-site install the time delays, so as to constantly there is consumer to throw Tell.
Content of the invention
A kind of fence method for optimizing scheduling is embodiments provided, can effectively assign tasks to erector People, solves to take problem, improves customer experience.
A kind of fence method for optimizing scheduling that the present invention is provided, including:
Set up the corresponding relation of installer and mission area;
When order is produced, task region is determined;
The corresponding installer of mission area is determined according to corresponding relation;
Assign the task to the corresponding installer of mission area.
Optionally,
Step includes before setting up installer and the corresponding relation of mission area:
The positional information of installer's key point is obtained,;
According to positional information, key point is shown on electronic chart;
According to crucial point-rendering polygon;
The region that polygon delimited is defined as mission area.
Optionally,
Step includes according to crucial point-rendering polygon:
All key points are sequentially connected with straightway and generate polygon.
Optionally,
Step includes according to crucial point-rendering polygon:
With each key point as the center of circle, circle is drawn as radius with predetermined length;
The point of contact for being sequentially connected with two neighboring circle generates polygon.
Optionally,
Step also includes before setting up installer and the corresponding relation of mission area:
The electronic chart of installer's transmission is received, electronic chart includes installer by GEO instrument in electronic chart The upper polygon that pulls draws a circle to approve the scope being responsible for;
The region that polygon delimited is defined as mission area.
Optionally,
After step determines the corresponding installer of mission area according to corresponding relation;Step assigns the task to mission area Also include before the corresponding installer in domain:
Judge whether the corresponding installer of mission area is unique;
If so, the corresponding installer of mission area is then assigned the task to;
If it is not, being then ranked up according to the service feature of each installer, list is obtained;
Assign the task to primary installer in list.
Optionally,
After step determines the corresponding installer of mission area according to corresponding relation;Step assigns the task to mission area Also include before the corresponding installer in domain:
Tasks carrying solicited message is sent to installer;
Receive the task confirmation of installer;
Judge whether task confirmation is unique;
If so, the corresponding installer of mission area is then assigned the task to;
If it is not, being then ranked up according to the service feature of each installer, list is obtained;
Assign the task to primary installer in list.
Optionally,
Also include after tasks carrying solicited message being sent to installer:
When the task confirmation of the first installer is not received, tasks carrying request is sent to mission area adjacent The second installer;
Connect the mission area of the second installer and newly-increased task point with phantom line segments on electronic chart;
After newly-increased task terminates, the phantom line segments are eliminated.
Optionally,
Service feature includes:The order capacity threshold of installer, KPI, warehouse space and the distance at a distance of task.
Optionally,
Step also includes after determining the corresponding installer of mission area according to corresponding relation:
Assign the task to the 3rd installer outside the corresponding installer of mission area;
Connect the mission area of the 3rd installer and newly-increased task point with phantom line segments on electronic chart, form interim appointing Business region;
After newly-increased task terminates, the 3rd workman judges whether to incorporate temporary duty region for mission area into;
If so, then dotted line is changed to solid line;
If it is not, then dotted line is deleted.
As can be seen from the above technical solutions, the embodiment of the present invention has advantages below:
In the embodiment of the present invention, system initially sets up the corresponding relation of installer and mission area;When order is produced, Determine task region;The corresponding installer of mission area is determined according to corresponding relation;Assign the task to mission area Corresponding installer.The corresponding relation between installer and mission area is established due to system, it is only necessary to determine again and appoint Business place mission area, it becomes possible to determine the installer for being responsible for the region, do not get in touch with installation so as to avoid contact staff The problem of workman, and then efficiently solve time-consuming problem.
Description of the drawings
Fig. 1 is the fence method for optimizing scheduling first embodiment flow chart in the present invention;
Fig. 2 is the fence method for optimizing scheduling second embodiment flow chart in the present invention;
Fig. 3 is the fence method for optimizing scheduling 3rd embodiment flow chart in the present invention;
Fig. 4 is the fence method for optimizing scheduling fourth embodiment flow chart in the present invention;
Fig. 5 is the 5th embodiment flow chart of fence method for optimizing scheduling in the present invention;
Fig. 6 is the fence method for optimizing scheduling sixth embodiment flow chart in the present invention;
Fig. 7 is the 7th embodiment flow chart of fence method for optimizing scheduling in the present invention.
Specific embodiment
A kind of fence method for optimizing scheduling is embodiments provided, can effectively assign tasks to erector People, solves to take problem, improves customer experience.
Fig. 1 is referred to, a kind of fence method for optimizing scheduling that the present invention is provided, including:
101st, the corresponding relation of installer and mission area is set up;
In the present embodiment, system initially sets up the corresponding relation of installer and mission area.
It should be noted that mission area can be determined by installer side, it is also possible to specified by system.Installer and How system determines that mission area will be described in detail in subsequent embodiment.Here is not especially limited.
102nd, when order is produced, determine task region;
In the present embodiment, when order is produced, system is it needs to be determined that the region at task place.
It should be noted that the order that system is received includes where require when installer arrives is installed. The position is marked on electronic chart by system, and incorporates the mission area which position belongs to and set in advance into.Purpose be for Installer determined by mission area.
103rd, the corresponding installer of mission area is determined according to corresponding relation;
104th, mission area corresponding installer is assigned the task to.
In the present embodiment, system can determine erector according to the corresponding relation between installer and mission area People, then task is tasked the installer, installer be connected to task after by execute task according to order contents.
In the present embodiment, system initially sets up the corresponding relation of installer and mission area;When order is produced, determine Task region;The corresponding installer of mission area is determined according to corresponding relation;
Assign the task to the corresponding installer of mission area.Due to system establish installer and mission area it Between corresponding relation, it is only necessary to determine task place mission area again, it becomes possible to determine be responsible for the region installer, so as to The problem that contact staff does not get in touch with installer is avoided, and then efficiently solves time-consuming problem.
Above a kind of fence method for optimizing scheduling first embodiment in the present invention is illustrated, refers to below Fig. 2, in the present invention, a kind of fence method for optimizing scheduling second embodiment includes:
201st, the positional information of installer key point is obtained;
In the present embodiment, system obtains the positional information of installer's key point.
It should be noted that system obtains the positional information of key point.These key points are used for delimiting the fortune of installer Dynamic scope.Can be that system receives the key point of installer's transmission, or system is extracted in History Order.These close Key point includes the boundary point of mission area or conventional warehouse.
202nd, according to positional information, key point is shown on electronic chart;
203rd, according to crucial point-rendering polygon;
In the present embodiment, system passes through to show these key points on electronic chart, then is painted by these key points Polygon processed.As polygonal flexibility ratio is higher, other regular shapes during concrete application, can be used.
204th, the region for delimiting polygon is defined as mission area;
In the present embodiment, the region that the polygon delimited is defined as mission area by system.
205th, the corresponding relation of installer and mission area is set up;
In the present embodiment, system sets up the corresponding relation of installer and mission area.
It should be noted that system can be by mission area with installer's respective column in matching list, it is also possible in electricity Show the name of corresponding installer in mission area on sub- map.
206th, when order is produced, determine task region;
In the present embodiment, when order is produced, system is it needs to be determined that the region at task place.
It should be noted that the order that system is received includes where require when installer arrives is installed. The position is marked on electronic chart by system, and incorporates the mission area which position belongs to and set in advance into.Purpose be for Installer determined by mission area.
207th, the corresponding installer of mission area is determined according to corresponding relation;
208th, mission area corresponding installer is assigned the task to.
In the present embodiment, system can determine erector according to the corresponding relation between installer and mission area People, then task is tasked the installer, installer be connected to task after by execute task according to order contents.
In the present embodiment, system obtains the positional information of installer's key point first;Further according to positional information by key Point shows on electronic chart;Then according to crucial point-rendering polygon, and the region that polygon delimited is defined as mission area Domain;Then set up the corresponding relation of installer and mission area;When order is produced, task region is determined;According to right The corresponding installer of determination mission area should be related to;Assign the task to the corresponding installer of mission area.Due to system Establish the corresponding relation between installer and mission area, it is only necessary to determine task place mission area again, it becomes possible to really Surely be responsible for the installer in the region, the problem of installer, and then effectively solving is not got in touch with so as to avoid contact staff Time-consuming problem.In addition, the method that system determines mission area by obtaining key point can easily determine installation The corresponding relation of workman and mission area, so as to be easier the task Order splitting for being suitable for position to corresponding installer.
It should be noted that being included according to crucial point-rendering polygon:
When key point is for the boundary point of mission area, all key points are sequentially connected with straightway and generate polygon.
When key point is for the active point of installer, the warehouse of such as often dealing.With each pass warehouse as the center of circle, with Predetermined length draws circle for radius;The point of contact for being sequentially connected with two neighboring circle again generates polygon.
Above the fence method for optimizing scheduling second embodiment in the present invention is illustrated, refers to figure below 3, in the present invention, fence method for optimizing scheduling 3rd embodiment includes:
301st, the electronic chart of installer transmission is received, and electronic chart includes installer by GEO instrument in electronics The scope is responsible for by polygon delineation is pulled on map;
302nd, the region for delimiting polygon is defined as mission area;
In the present embodiment, APP instrument is used by installer, is selected with polygon frame on electronic chart and oneself be responsible for Scope, installer can move the polygon by pulling polygon.The dynamic point on polygon can also be passed through to polygon The side of shape is stretched and the operation such as is shunk.System need not gather key point, so that determining that the operation of mission area is cleverer Living, more simple.
303rd, the corresponding relation of installer and mission area is set up;
In the present embodiment, system sets up the corresponding relation of installer and mission area.
It should be noted that system can be by mission area with installer's respective column in matching list, it is also possible in electricity Show the name of corresponding installer in mission area on sub- map.
304th, when order is produced, determine task region;
In the present embodiment, when order is produced, system is it needs to be determined that the region at task place.
It should be noted that the order that system is received includes where require when installer arrives is installed. The position is marked on electronic chart by system, and incorporates the mission area which position belongs to and set in advance into.Purpose be for Installer determined by mission area.
305th, the corresponding installer of mission area is determined according to corresponding relation;
306th, mission area corresponding installer is assigned the task to.
In the present embodiment, system can determine erector according to the corresponding relation between installer and mission area People, then task is tasked the installer, installer be connected to task after by execute task according to order contents.
In the present embodiment, system receives the electronic chart of installer's transmission first, and electronic chart includes that installer is led to Crossing GEO instrument, the scope is responsible for by polygon delineation is pulled on electronic chart;Then, the region that polygon delimited is defined as Mission area;Followed by the corresponding relation for setting up installer and mission area;When order is produced, task location is determined Domain;The corresponding installer of mission area is determined according to corresponding relation;Assign the task to the corresponding installer of mission area. The corresponding relation between installer and mission area is established due to system, it is only necessary to determine task place mission area again, The installer in the responsible region is just can determine, the problem of installer is not got in touch with so as to avoid contact staff, and then Efficiently solve time-consuming problem.In addition, compared with second embodiment, system need not gather key point, so that determining The operation of mission area is more flexible, more simple.
Above the fence method for optimizing scheduling 3rd embodiment in the present invention is described, below to the present invention In fence method for optimizing scheduling fourth embodiment illustrate:
Fence method for optimizing scheduling fourth embodiment in the present invention is different from previous embodiment to be:
After step determines the corresponding installer of mission area according to corresponding relation;Step assigns the task to mission area Also include before the corresponding installer in domain:
Judge whether the corresponding installer of mission area is unique;
If so, the corresponding installer of mission area is then assigned the task to;
If it is not, being then ranked up according to the service feature of each installer, list is obtained;
Assign the task to primary installer in list.
Refer to Fig. 4 below, with the example in a practical application, the present embodiment is illustrated:
401st, the corresponding relation of installer and mission area is set up;
402nd, when order is produced, determine task region;
403rd, the corresponding installer of mission area is determined according to corresponding relation;
Step 401 is identical to 103 with step 101 to 403, does not repeat.
404th, judge whether the corresponding installer of mission area is unique;If then execution step 405, if it is not, then executing Step 406;
405th, mission area corresponding installer is assigned the task to;
406th, it is ranked up according to the service feature of each installer, obtains list;
407th, in list primary installer is assigned the task to.
In the present embodiment, system is to prevent same mission area from corresponding to multiple installers, so in step root After determining the corresponding installer of mission area according to corresponding relation;Step assigns the task to the corresponding erector of mission area Judgement step is increased before people.Judge whether the corresponding installer of mission area is unique;If installer is unique, then Assign the task to the corresponding installer of the mission area;If installer is not unique, need to select one optimal Installer.Therefore, system is to being responsible for being ranked up with several installers in region.The foundation of sequence can include:Install The order capacity threshold of workman, KPI (Key Performance Indicator, KPI Key Performance Indicator), warehouse space and apart The distance of task.Optimal installer is obtained by sequence, finally, system assigns the task to the installer.
In the present embodiment, system initially sets up the corresponding relation of installer and mission area;When order is produced, determine Task region;The corresponding installer of mission area is determined according to corresponding relation;Judge the corresponding installation of mission area again Whether workman is unique;If then assigning the task to the corresponding installer of mission area;Otherwise according to each installer's Service feature is ranked up, and obtains list;Assign the task to primary installer in list to assign the task to The corresponding installer of mission area.The corresponding relation between installer and mission area is established due to system, it is only necessary to Determine task place mission area again, it becomes possible to determine the installer for being responsible for the region, so as to avoid contact staff's contact Less than the problem of installer, and then efficiently solve time-consuming problem.In addition, system is to responsible several installations with region Workman is ranked up, and obtains optimal installer by sequence, and finally, system assigns the task to the installer.From And efficiently solve the problems, such as task conflict.
Above the fence method for optimizing scheduling fourth embodiment in the present invention is illustrated, below to the present invention In the 5th embodiment of fence method for optimizing scheduling illustrate:
The 5th embodiment of fence method for optimizing scheduling in the present invention is different from fourth embodiment to be:
After step determines the corresponding installer of mission area according to corresponding relation;Step assigns the task to mission area Also include before the corresponding installer in domain:
Tasks carrying solicited message is sent to installer;
Receive the task confirmation of installer;
Judge whether task confirmation is unique;
If so, the corresponding installer of mission area is then assigned the task to;
If it is not, being then ranked up according to the service feature of each installer, list is obtained;
Assign the task to primary installer in list.
Refer to Fig. 5 below, with the example in a practical application, the present embodiment is illustrated:
501st, the corresponding relation of installer and mission area is set up;
502nd, when order is produced, determine task region;
503rd, the corresponding installer of mission area is determined according to corresponding relation;
Step 501 is identical to 403 with step 401 to 503, does not repeat.
504th, to installer, tasks carrying solicited message is sent;
In the present embodiment, system sends tasks carrying request to installer, asks when installer receives tasks carrying When asking, reply task confirmation can be selected, represent and currently have the ability to take over business.If having no ability to take over business, can not return Multiple any information.
505th, the task confirmation of installer is received;
506th, judge whether task confirmation is unique;If so, then execution step 507, if it is not, then execute 508;
507th, mission area corresponding installer is assigned the task to;
508th, it is ranked up according to the service feature of each installer, obtains list;
509th, in list primary installer is assigned the task to.
In the present embodiment, system is to prevent same mission area from corresponding to multiple installers, so in step root After determining the corresponding installer of mission area according to corresponding relation;Step assigns the task to the corresponding erector of mission area Judgement step is increased before people.Judge whether the corresponding installer of mission area is unique;If installer is unique, then Assign the task to the corresponding installer of the mission area;If installer is not unique, need to select one optimal Installer.Therefore, system is to being responsible for being ranked up with several installers in region.The foundation of sequence can include:Install The order capacity threshold of workman, KPI (Key Performance Indicator, KPI Key Performance Indicator), warehouse space and apart The distance of task.Optimal installer is obtained by sequence, finally, system assigns the task to the installer.
In the present embodiment, system initially sets up the corresponding relation of installer and mission area;When order is produced, determine Task region;The corresponding installer of mission area is determined according to corresponding relation;To installer, tasks carrying is sent again Solicited message;Receive the task confirmation of installer;Next, it is determined that whether task confirmation is unique;If will then appoint The corresponding installer of mission area is distributed in business;Otherwise it is ranked up according to the service feature of each installer, is arranged Famous-brand clock;Assign the task to primary installer in list and assign the task to the corresponding installer of mission area. The corresponding relation between installer and mission area is established due to system, it is only necessary to determine task place mission area again, The installer in the responsible region is just can determine, the problem of installer is not got in touch with so as to avoid contact staff, and then Efficiently solve time-consuming problem.In addition, system is ranked up with several installers in region to responsible, by sorting To optimal installer, finally, system assigns the task to the installer.So as to efficiently solve asking for task conflict Topic.
Above the 5th embodiment of fence method for optimizing scheduling in the present invention is described, below to the present invention In fence method for optimizing scheduling sixth embodiment illustrate:
Fence method for optimizing scheduling sixth embodiment in the present invention is different from the 5th embodiment to be:
Also include after tasks carrying solicited message being sent to installer:
When the task confirmation of the first installer is not received, tasks carrying request is sent to mission area adjacent The second installer;
Connect the mission area of the second installer and newly-increased task point with phantom line segments on electronic chart;
After newly-increased task terminates, the phantom line segments are eliminated.
Refer to Fig. 6 below, with the example in a practical application, the present embodiment is illustrated:
601st, the corresponding relation of installer and mission area is set up;
602nd, when order is produced, determine task region;
603rd, the corresponding installer of mission area is determined according to corresponding relation;
604th, to installer, tasks carrying solicited message is sent;
Step 601 is identical to 504 with step 501 to 604, does not repeat.
605th, when the task confirmation of the first installer is not received, tasks carrying request is sent to mission area The second adjacent installer;
In the present embodiment, when the task confirmation of the first installer is not received, the installation in the region is described Workman is current to be had no ability to order, or communication contact is obstructed all busy, and in order to reduce the waiting time, system is by task Execute request and be sent to the second adjacent installer of mission area;Here the not responsible mission area of the second installer. Only temporarily the task is distributed the installer.
It should be noted that mentioned in text first, second, and third is merely representative of the difference of individuality, not represent tool One object of body, does not indicate that ordering relation yet.
606th, the mission area of the second installer and newly-increased task point are connected with phantom line segments on electronic chart;
In the present embodiment, system connects the mission area of the second installer on electronic chart and increases newly with phantom line segments Task point.
It should be noted that now, original installer is not carried out more by system with the corresponding relation of mission area Newly, newly-increased point dotted line is connected by system in order to prevent from judging the corresponding relation mistake of mission area and installer by accident.
607th, after newly-increased task terminates, the phantom line segments are eliminated.
In the present embodiment, after newly-increased task terminates, system eliminates phantom line segments.Installer is not updated with mission area The corresponding relation in domain.
In the present embodiment, system initially sets up the corresponding relation of installer and mission area;When order is produced, determine Task region;The corresponding installer of mission area is determined according to corresponding relation;To installer, tasks carrying is sent again Solicited message;When the task confirmation of the first installer is not received, tasks carrying request is sent to mission area by system The second adjacent installer of domain;Then system on electronic chart with phantom line segments connect the second installer mission area with Newly-increased task point;After newly-increased task terminates, system eliminates the phantom line segments.As system establishes installer and mission area Corresponding relation between domain, it is only necessary to determine task place mission area again, it becomes possible to determine the installer for being responsible for the region, The problem of installer is not got in touch with so as to avoid contact staff, and then efficiently solves time-consuming problem.In addition, when going out When cannot now contact the corresponding installer of mission area, tasks carrying request is sent to adjacent second of mission area by system Installer;I.e. when installer in region is current busy, order is had no ability to, or communication contact is obstructed, is The minimizing waiting time, system assigns the task to the second adjacent installer of mission area.And with void on electronic chart Line segment connects the mission area of the second installer and newly-increased task point.System is not by original installer and mission area Corresponding relation be updated, system in order to prevent from judging the corresponding relation mistake of mission area and installer by accident, by newly-increased point Connected with dotted line.After newly-increased task terminates, the phantom line segments are eliminated.
Above fence method for optimizing scheduling sixth embodiment in the present invention is illustrated, below in the present invention The 7th embodiment of fence method for optimizing scheduling is described:
In the present invention the 7th embodiment of fence method for optimizing scheduling be different from aforementioned any embodiment be:
Step also includes after determining the corresponding installer of mission area according to corresponding relation:
Assign the task to the 3rd installer outside the corresponding installer of mission area;
Connect the mission area of the 3rd installer and newly-increased task point with phantom line segments on electronic chart, form interim appointing Business region;
After newly-increased task terminates, the 3rd workman judges whether to incorporate temporary duty region for mission area into;
If so, then dotted line is changed to solid line;
If it is not, then dotted line is deleted.
Refer to Fig. 7 below, with the example in a practical application, the present embodiment is illustrated:
701st, the corresponding relation of installer and mission area is set up;
702nd, when order is produced, determine task region;
703rd, the corresponding installer of mission area is determined according to corresponding relation;
Step 701 is identical to step 103 with step 101 to step 703, does not repeat.
704th, threeth installer mission area corresponding installer outside is assigned the task to;
In the present embodiment, system can assign the task to the 3rd installation outside the corresponding installer of mission area Workman;
It should be noted that system can assign the task to any installer.
It should be noted that mentioned in text first, second, and third is merely representative of the difference of individuality, not represent tool One object of body, does not indicate that ordering relation yet.
705th, the mission area of the 3rd installer and newly-increased task point are connected with phantom line segments on electronic chart, formation is faced When mission area;
In the present embodiment, system connects the mission area of the 3rd installer on electronic chart and increases newly with phantom line segments Task point, forms temporary duty region;
It should be noted that now, original installer is not carried out more by system with the corresponding relation of mission area Newly, newly-increased point dotted line is connected by system in order to prevent from judging the corresponding relation mistake of mission area and installer by accident.
706th, after newly-increased task terminates, the 3rd workman judges whether to incorporate temporary duty region for mission area into;If Then dotted line is changed to solid line by execution step 707, if it is not, then dotted line is deleted by execution step 708.
In the present embodiment, system initially sets up the corresponding relation of installer and mission area;When order is produced, determine Task region;The corresponding installer of mission area is determined according to corresponding relation;Assign the task to mission area correspondence Installer outside the 3rd installer;On electronic chart with phantom line segments connect the 3rd installer mission area with Newly-increased task point, forms temporary duty region;After newly-increased task terminates, the 3rd workman judges whether to incorporate temporary duty region into For mission area;If then dotted line is changed to solid line, if it is not, then dotted line is deleted.As system establishes installer and Ren Corresponding relation between business region, it is only necessary to determine task place mission area again, it becomes possible to determine the installation for being responsible for the region Workman, does not get in touch with the problem of installer, and then efficiently solves time-consuming problem so as to avoid contact staff.Except this it Outward, system can flexibly assign the task to any one installer, and on electronic chart, with void on electronic chart Line segment connects the mission area of the 3rd installer and newly-increased task point, forms temporary duty region, after newly-increased task terminates, the Three workmans judge whether to incorporate temporary duty region for mission area into;The installer incorporates temporary duty for mission area into Then dotted line is changed to solid line, otherwise dotted line is deleted.
In the present embodiment, system initially sets up the corresponding relation of installer and mission area;When order is produced, determine Task region;The corresponding installer of mission area is determined according to corresponding relation;
Assign the task to the corresponding installer of mission area.Due to system establish installer and mission area it Between corresponding relation, it is only necessary to determine task place mission area again, it becomes possible to determine be responsible for the region installer, so as to The problem that contact staff does not get in touch with installer is avoided, and then efficiently solves time-consuming problem.
Those skilled in the art can be understood that, for convenience and simplicity of description, the system of foregoing description, Device and the specific work process of unit, may be referred to the corresponding process in preceding method embodiment, will not be described here.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method are permissible Realize by another way.For example, device embodiment described above is only schematic, for example, the unit Divide, only a kind of division of logic function, can have other dividing mode, such as multiple units or component when actually realizing Can in conjunction with or be desirably integrated into another system, or some features can be ignored, or not process.Another, shown or The coupling each other for discussing or direct-coupling or communication connection can be the indirect couplings of device or unit by some interfaces Close or communicate to connect, can be electrical, mechanical or other forms.
The unit that illustrates as separating component can be or may not be physically separate, aobvious as unit The part for showing can be or may not be physical location, you can be located at a place, or can also be distributed to multiple On NE.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme 's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it is also possible to It is that unit is individually physically present, it is also possible to which two or more units are integrated in a unit.Above-mentioned integrated list Unit both can be realized in the form of hardware, it would however also be possible to employ the form of SFU software functional unit is realized.
If the integrated unit is realized and as independent production marketing or use using in the form of SFU software functional unit When, can be stored in a computer read/write memory medium.Based on such understanding, technical scheme is substantially The part in other words prior art being contributed or all or part of the technical scheme can be in the form of software products Embody, the computer software product is stored in a storage medium, use so that a computer including some instructions Equipment (can be personal computer, server, or network equipment etc.) executes the complete of each embodiment methods described of the present invention Portion or part steps.And aforesaid storage medium includes:USB flash disk, portable hard drive, read only memory (ROM, Read-Only Memory), random access memory (RAM, RandomAccess Memory), magnetic disc or CD etc. are various can store journey The medium of sequence code.
The above, above example only in order to technical scheme to be described, rather than a limitation;Although with reference to front State embodiment to be described in detail the present invention, it will be understood by those within the art that:Which still can be to front State the technical scheme described in each embodiment to modify, or equivalent is carried out to which part technical characteristic;And these Modification or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.

Claims (10)

1. a kind of fence method for optimizing scheduling, it is characterised in that include:
Set up the corresponding relation of installer and mission area;
When order is produced, task region is determined;
The corresponding installer of mission area is determined according to the corresponding relation;
The task is distributed to the corresponding installer of the mission area.
2. fence method for optimizing scheduling according to claim 1, it is characterised in that
Include before setting up installer and the corresponding relation of mission area described in step:
Obtain the positional information of installer's key point;
According to the positional information, the key point is shown on electronic chart;
According to the key point-rendering polygon;
The region that the polygon delimited is defined as mission area.
3. fence method for optimizing scheduling according to claim 2, it is characterised in that
Step includes according to the key point-rendering polygon:
All key points are sequentially connected with straightway and generate polygon.
4. fence method for optimizing scheduling according to claim 2, it is characterised in that
Step includes according to the key point-rendering polygon:
With each key point as the center of circle, circle is drawn as radius with predetermined length;
The point of contact for being sequentially connected with two neighboring circle generates polygon.
5. fence method for optimizing scheduling according to claim 2, it is characterised in that
Also include before setting up installer and the corresponding relation of mission area described in step:
The electronic chart of installer's transmission is received, the electronic chart includes installer by GEO instrument in electronic chart The upper polygon that pulls draws a circle to approve the scope being responsible for;
The region that the polygon delimited is defined as mission area.
6. fence method for optimizing scheduling according to claim 1, it is characterised in that
After step determines the corresponding installer of mission area according to the corresponding relation;The task is distributed to institute by step Also include before stating the corresponding installer of mission area:
Judge whether the corresponding installer of mission area is unique;
If so, then the task is distributed to the corresponding installer of the mission area;
If it is not, being then ranked up according to the service feature of each installer, list is obtained;
The task is distributed to primary installer in list.
7. fence method for optimizing scheduling according to claim 1, it is characterised in that
After step determines the corresponding installer of mission area according to the corresponding relation;The task is distributed to institute by step Also include before stating the corresponding installer of mission area:
Tasks carrying solicited message is sent to the installer;
Receive the task confirmation of the installer;
Judge whether the task confirmation is unique;
If so, then the task is distributed to the corresponding installer of the mission area;
If it is not, being then ranked up according to the service feature of each installer, list is obtained;
The task is distributed to primary installer in list.
8. fence method for optimizing scheduling according to claim 7, it is characterised in that
Also include after tasks carrying solicited message being sent to the installer:
When the task confirmation of the first installer is not received, tasks carrying request is sent to mission area adjacent The second installer;
Connect the mission area of the second installer and newly-increased task point with phantom line segments on electronic chart;
After newly-increased task terminates, the phantom line segments are eliminated.
9. the fence method for optimizing scheduling according to any one of claim 6 to 8, it is characterised in that
The service feature includes:The order capacity threshold of installer, KPI, warehouse space and the distance at a distance of task.
10. fence method for optimizing scheduling according to claim 1, it is characterised in that
Step also includes after determining the corresponding installer of mission area according to the corresponding relation:
The task is distributed to the 3rd installer outside the corresponding installer of the mission area;
Connect the mission area of the 3rd installer and newly-increased task point with phantom line segments on electronic chart, form temporary duty area Domain;
After the newly-increased task terminates, the 3rd workman judges whether to incorporate temporary duty region for mission area into;
If so, then dotted line is changed to solid line;
If it is not, then dotted line is deleted.
CN201610790959.9A 2016-08-31 2016-08-31 Electronic fence scheduling optimization method Pending CN106447169A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610790959.9A CN106447169A (en) 2016-08-31 2016-08-31 Electronic fence scheduling optimization method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610790959.9A CN106447169A (en) 2016-08-31 2016-08-31 Electronic fence scheduling optimization method

Publications (1)

Publication Number Publication Date
CN106447169A true CN106447169A (en) 2017-02-22

Family

ID=58163758

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610790959.9A Pending CN106447169A (en) 2016-08-31 2016-08-31 Electronic fence scheduling optimization method

Country Status (1)

Country Link
CN (1) CN106447169A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109064003A (en) * 2018-07-26 2018-12-21 南京博赛顿电器销售有限公司 Intelligently assign the method for work order according to route planning
CN109102136A (en) * 2017-06-21 2018-12-28 平安科技(深圳)有限公司 Case distribution method, server and computer readable storage medium
WO2019037368A1 (en) * 2017-08-22 2019-02-28 北京小度信息科技有限公司 Delivery task processing method and apparatus, electronic device, and computer storage medium
CN110401718A (en) * 2019-07-29 2019-11-01 腾讯科技(深圳)有限公司 Method for allocating tasks, device, server and storage medium based on space crowdsourcing

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101488204A (en) * 2009-02-25 2009-07-22 中国网络通信集团公司 Task optimization scheduling system
CN101510280A (en) * 2009-02-25 2009-08-19 中国网络通信集团公司 Platform for optimizing and scheduling task
CN105160453A (en) * 2015-07-16 2015-12-16 北京中亦安图科技股份有限公司 Task allocating method, device, and system based on location service

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101488204A (en) * 2009-02-25 2009-07-22 中国网络通信集团公司 Task optimization scheduling system
CN101510280A (en) * 2009-02-25 2009-08-19 中国网络通信集团公司 Platform for optimizing and scheduling task
CN105160453A (en) * 2015-07-16 2015-12-16 北京中亦安图科技股份有限公司 Task allocating method, device, and system based on location service

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109102136A (en) * 2017-06-21 2018-12-28 平安科技(深圳)有限公司 Case distribution method, server and computer readable storage medium
WO2019037368A1 (en) * 2017-08-22 2019-02-28 北京小度信息科技有限公司 Delivery task processing method and apparatus, electronic device, and computer storage medium
CN109064003A (en) * 2018-07-26 2018-12-21 南京博赛顿电器销售有限公司 Intelligently assign the method for work order according to route planning
CN110401718A (en) * 2019-07-29 2019-11-01 腾讯科技(深圳)有限公司 Method for allocating tasks, device, server and storage medium based on space crowdsourcing

Similar Documents

Publication Publication Date Title
CN106447169A (en) Electronic fence scheduling optimization method
CN113377520B (en) Resource scheduling method, device, equipment and storage medium
CN109753356A (en) A kind of container resource regulating method, device and computer readable storage medium
CN105197699A (en) Elevator control method and elevator control system
EP3835906A1 (en) Method and device for scheduling automated guided vehicle
WO2021197477A1 (en) Device scheduling method and apparatus for high-bay warehouse
CN114124945A (en) System and method for vehicle formation driving
CN104077638A (en) Portal jib crane dispatching method
CN109489671A (en) A kind of paths planning method of AGV robot, device and system
CN109858655A (en) Reserve the method and system of test
CN109669787A (en) Data transmission method and device, storage medium, electronic equipment
Zeng et al. Disruption management model and its algorithms for berth allocation problem in container terminals
CN111191845A (en) Power communication network work monotony scheduling method based on DBSCAN algorithm and KMP mode matching method
CN105338074A (en) Contract net task distribution method, obtaining method, intelligent proxy and MAS
CN113032093B (en) Distributed computing method, device and platform
CN117933490A (en) Airport scene dragging scheduling optimization method, electronic equipment and storage medium
CN115829451A (en) Logistics path planning method and device, computer equipment and storage medium
CN110837950B (en) Dynamic scheduling method of RGV (traffic volume group) trolley
EP2860675A1 (en) Method and system for managing operation of multi-line public transportation
CN111475905A (en) Method and device for establishing road vehicle function safety development process
CN112621738A (en) Robot control method, electronic device, and computer-readable storage medium
Lalla-Ruiz et al. Migrating birds optimization for the seaside problems at maritime container terminals
Dayama et al. History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence
CN113032092B (en) Distributed computing method, device and platform
US11630445B2 (en) Information processing method, information processing apparatus and non-transitory storage medium

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20170222

RJ01 Rejection of invention patent application after publication