CN109409746A - A kind of production scheduling method and device - Google Patents

A kind of production scheduling method and device Download PDF

Info

Publication number
CN109409746A
CN109409746A CN201811266948.6A CN201811266948A CN109409746A CN 109409746 A CN109409746 A CN 109409746A CN 201811266948 A CN201811266948 A CN 201811266948A CN 109409746 A CN109409746 A CN 109409746A
Authority
CN
China
Prior art keywords
production
resources
scheduling
procedure
time cost
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
CN201811266948.6A
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.)
Beihang University
Original Assignee
Beihang University
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 Beihang University filed Critical Beihang University
Priority to CN201811266948.6A priority Critical patent/CN109409746A/en
Publication of CN109409746A publication Critical patent/CN109409746A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063Operations research or analysis
    • G06Q10/0631Resource planning, allocation or scheduling for a business operation
    • G06Q10/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling

Abstract

This application provides a kind of production scheduling methods, wherein this method comprises: obtaining the corresponding resources of production collection of each production procedure in production task;It includes that at least one for the corresponding production procedure of resources of production collection provides the resources of production that production services that wherein each resources of production, which are concentrated,;According to the resources of production collection of the sequence of each production procedure in the production task and acquisition, establish production scheduling model, wherein include the directed walk sequentially formed between adjacent resources of production according to production procedure in the production scheduling model, includes the time cost of every directed walk in the production scheduling model;Based on the time cost of each directed walk of production scheduling model, one resources of production of selection are concentrated from each resources of production, to generate the production path for including at least one directed walk.The embodiment of the present application is that production task filters out the most fast resources of production of each production procedure of completion by using aforesaid way, to improve production efficiency.

Description

A kind of production scheduling method and device
Technical field
This application involves industrial production technology fields, in particular to a kind of production scheduling method and device.
Background technique
In modern industry, production link is more, and cooperation relation is complicated, and continuous production is strong, and situation variation is fast, a certain part It breaks down or a certain measure is not realized on schedule, often involve the operation of entire production system.Existing Workshop Production tune Degree system using scheduling of production as foundation, monitor in real time manufacturing schedule, research and analyse influence production various factors, and according to Different situations take Corresponding Countermeasures, operate normally production system.
But the integrated dispatch ability of existing Workshop Production scheduling system is poor, and production efficiency has to be hoisted.
Summary of the invention
In view of this, the embodiment of the present application is designed to provide a kind of production scheduling method and apparatus, it is production task In each production procedure select optimal resources of production, to improve production efficiency.
In a first aspect, the embodiment of the present application provides a kind of production scheduling method, including:
Obtain the corresponding resources of production collection of each production procedure in production task;Wherein each resources of production concentration includes There is at least one to provide the resources of production of production service for the corresponding production procedure of resources of production collection;
According to the resources of production collection of the sequence of each production procedure in the production task and acquisition, establishes production and adjust Model is spent, wherein comprising oriented according to sequentially forming for production procedure between adjacent resources of production in the production scheduling model Path includes the time cost of every directed walk in the production scheduling model;
Based on the time cost of each directed walk of production scheduling model, selection is concentrated from each resources of production One resources of production, to generate the production path for including at least one directed walk.
With reference to first aspect, the embodiment of the present application provides the first possible embodiment of first aspect, wherein base In the time cost of each directed walk of production scheduling model, is concentrated from each resources of production and select a production money Source, to generate the production path for including at least one directed walk, comprising:
Based on the time cost of each directed walk in current production scheduling model, determine from execute current production procedure to The smallest production path of total time cost required for the last one production procedure of the production task is executed, and will be determining The resources of production that current production procedure is executed in the smallest production path of total time cost are selected as the production path ultimately generated In a resources of production;
After having executed current production procedure, using next production procedure as current production procedure, the production is updated The time cost of each directed walk in scheduling model, and the determination is returned from current production procedure is executed to the execution life It is described until having executed required for the last one production procedure of production task the step of total time cost the smallest production path Production task the last one production procedure.
The first embodiment with reference to first aspect, the embodiment of the present application provide first aspect second are possible Embodiment, wherein the time cost for updating each directed walk in the production scheduling model, comprising:
It is respectively corresponded based on production procedure current in the production task and the production procedure after current production procedure Each resources of production for concentrating of resources of production under current production environment updated production service ability, update production tune Spend the time cost of each directed walk in model.
The possible embodiment of second with reference to first aspect, the embodiment of the present application provide the third of first aspect Possible embodiment, wherein determine that any one is directed toward next stage production money from upper level resources of production according to following steps The time cost of the directed walk in source:
Corresponding production procedure is completed to next stage resources of production starting pair according to from the upper level resources of production The waiting time for the production procedure answered transports processed product to next stage production money from the upper level resources of production The logistics time in source, the next stage resources of production are completed the service time of corresponding production procedure, determine the Oriented Path from Its Maximal Subtrees The time cost of diameter.
With reference to first aspect, the embodiment of the present application provides the 4th kind of possible embodiment of first aspect, wherein root The time cost is determined according to following steps:
During executing each production task, one of the function time is calculated based on preset a variety of time costs Cost calculates function, determines the time cost;
The method also includes:
According to the task action result for executing a variety of production tasks respectively and every kind of production task institute in the process of implementation The time cost used calculates function, and it is optimal to filter out corresponding task action result in a variety of time costs calculating function Time cost calculates function as the time cost used when executing subsequent production task and calculates function.
Second aspect, the embodiment of the present application also provide a kind of production scheduling device, comprising:
Module is obtained, for obtaining the corresponding resources of production collection of each production procedure in production task, wherein each life Produce that include at least one in resource set provide the resources of production that production services for the corresponding production procedure of resources of production collection;
First processing module, for according to the sequence of each production procedure in the production task and the production of acquisition Resource set establishes production scheduling model, wherein comprising flowing between adjacent resources of production according to production in the production scheduling model The directed walk of journey sequentially formed includes the time cost of every directed walk in the production scheduling model;
Second processing module, for the time cost based on each directed walk of production scheduling model, from each institute It states resources of production and concentrates one resources of production of selection, to generate the production path for including at least one directed walk.
In conjunction with second aspect, the embodiment of the present application provides the first possible embodiment of second aspect, wherein institute Second processing module is stated to be specifically used for:
Based on the time cost of each directed walk in current production scheduling model, determine from execute current production procedure to The smallest production path of total time cost required for the last one production procedure of the production task is executed, and will be determining The resources of production that current production procedure is executed in the smallest production path of total time cost are selected as the production path ultimately generated In a resources of production;
After having executed current production procedure, using next production procedure as current production procedure, the production is updated The time cost of each directed walk in scheduling model, and the determination is returned from current production procedure is executed to the execution life It is described until having executed required for the last one production procedure of production task the step of total time cost the smallest production path Production task the last one production procedure.
In conjunction with the first embodiment of second aspect, the embodiment of the present application provide second aspect second is possible Embodiment, wherein the update module is specifically used for updating each Oriented Path from Its Maximal Subtrees in the production scheduling model according to following steps The time cost of diameter:
It is respectively corresponded based on production procedure current in the production task and the production procedure after current production procedure Each resources of production for concentrating of resources of production under current production environment updated production service ability, update production tune Spend the time cost of each directed walk in model.
The third aspect, the embodiment of the present application also provide a kind of electronic equipment, comprising: processor, memory and bus, it is described Memory is stored with the executable machine readable instructions of the processor, when electronic equipment operation, the processor with it is described By bus communication between memory, the machine readable instructions executed when being executed by the processor above-mentioned first aspect and Step in above-mentioned first aspect in any possible embodiment.
Fourth aspect, the embodiment of the present application also provide a kind of computer readable storage medium, the computer-readable storage medium Computer program is stored in matter, which executes above-mentioned first aspect and above-mentioned first party when being run by processor Step in face in any possible embodiment.
In the embodiment of the present application, the corresponding resources of production collection of each production procedure in acquisition production task first, wherein It includes that at least one for the corresponding production procedure of resources of production collection provides the production that production services that each resources of production, which are concentrated, Resource establishes production scheduling model then according to the resources of production collection got, wherein providing in production model comprising adjacent production According to the directed walk of production procedure sequentially formed between source, and include the time of every directed walk in production scheduling model Cost, the time cost finally based on each directed walk of production scheduling model concentrate one life of selection from each resources of production Resource is produced, to generate the production path for including at least one directed walk.Using the above scheme, by establishing above-mentioned production scheduling Model carries out Dynamic Scheduling, and integration can provide the resources of production of production service for corresponding production task, and filter out Shorten and paid needed for completing production task to rationally efficiently be produced with resources of production in one Optimal Production path Time cost, improve production efficiency.
To enable the above objects, features, and advantages of the application to be clearer and more comprehensible, preferred embodiment is cited below particularly, and cooperate Appended attached drawing, is described in detail below.
Detailed description of the invention
Technical solution in ord to more clearly illustrate embodiments of the present application, below will be to needed in the embodiment attached Figure is briefly described, it should be understood that the following drawings illustrates only some embodiments of the application, therefore is not construed as pair The restriction of range for those of ordinary skill in the art without creative efforts, can also be according to this A little attached drawings obtain other relevant attached drawings.
Fig. 1 shows a kind of flow chart of production scheduling method provided by the embodiment of the present application;
Fig. 2 shows the schematic diagrames of production scheduling model provided by the embodiment of the present application;
Fig. 3 shows a kind of optimized flow chart of production scheduling method provided by the embodiment of the present application;
Fig. 4 shows the schematic diagram of production scheduling model adjusted provided by the embodiment of the present application;
Fig. 5 shows the schematic diagram of loose operations provided by the embodiment of the present application;
Fig. 6 shows the schematic diagram of updated production scheduling model provided by the embodiment of the present application;
Fig. 7 shows a kind of structural schematic diagram of production scheduling device provided by the embodiment of the present application;
Fig. 8 shows the structural schematic diagram of a kind of electronic equipment provided by the embodiment of the present application.
Specific embodiment
To keep the purposes, technical schemes and advantages of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application Middle attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is only It is some embodiments of the present application, instead of all the embodiments.The application being usually described and illustrated herein in the accompanying drawings is real The component for applying example can be arranged and be designed with a variety of different configurations.Therefore, below to the application's provided in the accompanying drawings The detailed description of embodiment is not intended to limit claimed scope of the present application, but is merely representative of the selected reality of the application Apply example.Based on embodiments herein, those skilled in the art institute obtained without making creative work There are other embodiments, shall fall in the protection scope of this application.
Method and apparatus in the embodiment of the present application are mainly used in the production scheduling scene under cloud manufacturing environment, with tradition Workshop Production scheduling system be only capable of production have fixed standard specific products compare, the production scheduling system under cloud manufacturing environment System can be adapted for diversification, personalized production task, and dynamic dispatching can be realized in the production environment of variation, and mention High efficiency.
Meanwhile under cloud manufacturing environment, it is distributed in the resources of production of diverse geographic location and passes through virtualization and serviceization Mode accesses cloud manufacturing environment, forms resources of production collection in large scale, and resources of production may go out when providing production service The existing various factors for influencing production service times, such as the fault occurrence frequency and failure recovery time etc. of resources of production.This is just Make the time cost when cloud manufacturing environment dispatching resources of production complete production task that probabilistic feature be presented.
So not only to be dispatched brought by the scale in view of resources of production when for production task design dispatching algorithm The influence of efficiency, it is considered however that logistics time and object when production task is transmitted between the resources of production of diverse geographic location Flow cost.
Production scheduling under cloud manufacturing environment needs correct process for producing resource service time uncertain problem, is based on This, this application provides a kind of production scheduling method and apparatus, can instruct the Production Scheduling System under cloud manufacturing environment, improve The production efficiency of Production Scheduling System.
For convenient for understanding the present embodiment, in conjunction with above-mentioned application scenarios, first to disclosed in the embodiment of the present application A kind of production scheduling method describes in detail.
Based on above-mentioned constraint condition, a kind of flow chart of production scheduling method provided by the embodiments of the present application, such as Fig. 1 institute Show, comprising:
S101 obtains the corresponding resources of production collection of each production procedure in production task;Wherein each resources of production collection In to include at least one provide the resources of production of production service for the corresponding production procedure of resources of production collection.
In the production scheduling under cloud manufacturing environment, resources of production are only capable of providing one for a production task in synchronization The production service of seed type.And can not be interrupted when service is provided, until service finishes.When providing production service, remaining Production task will arrange in waiting list according to the sequence of first in, first out, wait specific production service to be subjected.
Simultaneously as the diversification of production task and personalization, a resources of production are only capable of needed for providing production task Part producing service, it is therefore desirable to which multiple resources, which cooperate, completes production.Since cloud manufacturing platform incorporates a large amount of production Resource, therefore each production is serviced, there are multiple resources of production to can provide such service.When production task will receive life When producing service, scheduling system needs to concentrate in together the resources of production that can provide production service for the same production procedure.
So the corresponding resources of production collection of each production procedure is every in order to be retrieved as in acquisition production task here A production procedure can provide the resources of production collection of the resources of production composition of production service.
S102 is established according to the resources of production collection of the sequence of each production procedure in the production task and acquisition Production scheduling model, wherein including sequentially forming according to production procedure between adjacent resources of production in the production scheduling model Directed walk, include the time cost of every directed walk in the production scheduling model.
Wherein, production task has its specific production procedure, needs the sequence in strict accordance with production procedure, successively receives Corresponding production service, is finally completed production, so need to be by resources of production collection corresponding with production procedure according to production procedure Sequence is arranged, and sequentially forms oriented path according to production procedure between adjacent resources of production, is adjusted with establishing production Spend model.
Under cloud manufacturing environment, resources of production are by forming production service after virtualization and serviceization.Although these are produced Service is managed collectively in service cloud pond beyond the clouds, but is produced service mapped resources of production and be but distributed in different geography In the manufacturing enterprise of position.Therefore, it in the production task scheduling process under cloud manufacturing environment, needs to exist in view of production task Required logistics time and logistics cost and each resources of production mention when transmitting between distributed resources of production for production task For the time of service.To sum up, the fluctuation of time cost must be taken into consideration in production scheduling method, and in the production scheduling model, respectively Directed walk represents above-mentioned time cost.
S103, based on the time cost of each directed walk of production scheduling model, from each resources of production collection One resources of production of middle selection, to generate the production path for including at least one directed walk.
Wherein, include a plurality of directed walk in production scheduling model, passed through from production task start and ending a plurality of The time cost of directed walk is the time cost of each process of production task.And this plurality of directed walk constitutes completion The production path of production task.Because of the particularity of cloud manufacturing environment, a plurality of production road can be passed through by completing a production task Diameter, and every production path includes at least a directed walk.
In addition, the time cost in every production path is the sum for forming the time cost of directed walk in the production path.
As shown in Fig. 2, being the schematic diagram of production scheduling model provided by the embodiments of the present application.
As previously mentioned, production task possesses multiple production procedure Si(i is more than or equal to 1) needs in strict accordance with SiSequence, according to The secondary corresponding production service of receiving, and it is finally completed entire production task.And production service can be provided for each production procedure Resources of production Mi,j(i, j are all larger than the resources of production collection O (S equal to 1) compositioni) (i is more than or equal to 1), wherein Mi,jIt is i-th J-th of resources of production that the corresponding resources of production of production procedure are concentrated.Each of production scheduling model resources of production are all It is conceptualized as a node v, each node v has specific coordinate, represents the specific location where resources of production.Dotted line frame O (Si) in all node on behalf resources of production collection O (Si) the node collection that is formed in scheduling model.In the production scheduling model All node v composition node integrate as V.Because production is thought to need in strict accordance with SiSequence, successively receive corresponding raw Produce service.Therefore in production scheduling model, production task will transport between the node and node of adjacent resources of production collection. The node of adjacent resources of production collection is connected two-by-two, forms a series of directed walks, whole directed edges composition of the network model Directed walk integrate as E.By scheduling model it is found that directed walk and node are formd from source node to end in network model The mulitpath of node, each of them path all can serve as the production path of production task.Production task can along appoint It anticipates one and produces path, successively receive the specific production service of the offer of resources of production representated by respective nodes, and final complete At production.Any one directed walk in production scheduling modelIt is owned by weightProduction task is represent by this The time cost paid required for directed edge, weight are determined by the calculating of scheduling rule function.And produce path lseSuperiority and inferiority take Certainly in the weight V in production pathse。VseValue be the production path in include whole directed edges weights sum, it may be assumed thatWherein,It is the directed walk of source node and first resources of production composition Time cost,Be since first resources of production, the directed walk that is formed between adjacent resources of production when Between cost sum,It is the time cost of the directed walk of the last one resources of production and end node composition.
Production scheduling model is established, cloud system is utilized based on the particularity of cloud manufacturing environment using above-mentioned production scheduling method Diversification, personalized production service can be provided for a variety of different production tasks by making a large amount of resources of production in environment.Meanwhile According to each production procedure reasonable distribution resources of production that the state of each resources of production is in production task, so as to shorten the task Production cycle improves production efficiency.
It is to above-mentioned steps as shown in figure 3, being the optimized flow chart of production scheduling method provided by the embodiments of the present application The refinement of S103, in which:
S301 is determined based on the time cost of each directed walk in current production scheduling model from the current production of execution The smallest production path of total time cost required for process to the last one production procedure for executing the production task, and will The resources of production that current production procedure is executed in the smallest production path of determining total time cost are selected as the life ultimately generated Produce a resources of production in path.
Here, select in production scheduling model time cost in each item production path most under a production path be final The production path of the execution production task of selection.Specifically, system is first according to the life of production task when production task publication Process sequence is produced, the specific resources of production collection that production can be provided and serviced is searched under cloud manufacturing environment, and according to production sequence Arrangement, generates production scheduling network model as shown in Figure 2.By reading the status information of simultaneously process for producing resource, calculate Out in dispatch network model every directed walk weight, i.e. time cost.
Next production path optimal under conditions present is found according to production scheduling model.Since production path is All paths from source node to end node, therefore the problem can be converted into the Solve problems of signal source shortest path.
For the ease of analysis, scheduling model is now adjusted to as shown in Figure 4.
In production scheduling model, the Optimal Production path under conditions present is found.Firstly, institute in initialization node collection V There is nodal community, to source node s, there is s.p=Null and s.d=0, wherein s.p=Null, which refers to, saves the forerunner of source node S Point is set to sky, i.e., without predecessor node, s.d=0 refers to that the Optimal Production path from source node S to source node S is 0.For All node v ∈ C in addition to node sV{ s } has v.p=in addition to the node v of S in node collection V that is, as described above Null and v.d=∞, wherein v.p=Null refers to that the predecessor node by node v is set to sky, i.e., without predecessor node, v.d=∞ Refer in all paths currently searched for from source node S to node v, the weight in Optimal Production path is infinity.
According to the topological order of node, find first not processed node v, to from all sides of node v into Row loose operations.By taking the production scheduling model in Fig. 4 as an example, each node v in dispatch network is owned by attribute v.p and v.d. Wherein v.p is the predecessor node in current production path, and v.d is in all paths currently searched for, Optimal Production path Weight.Loose operations to directed walk are that, if then the predecessor node of v node is u, will currently produce path lsuWeight U.d adds directed walkWeightIt is compared with v.d, if the former is smaller, v.p and v.d is updated, made ?And v.p=u.As shown in Figure 5 is the signal of loose operations provided by the embodiment of the present application Figure, with V1For, V1Predecessor node be U1And U2, i.e., currently produce pathNecessarily pass U1And U2, first determine whether U1Whether For V1Predecessor node, will have determined pass through U1Production pathWeight U1.d it addsWeightWith V.d is compared, because having made v.d=∞ when initialization, necessarily the former is smaller, so by U1As V1Forerunner's section Point, and enable V1Weight beNext, repeating aforesaid operations, U is verified2It whether is V1Forerunner section Point, if so, making V1Weight be
To all directed walks all after above-mentioned loose operations, since end node e, before searching for the node Node e.p, and the predecessor node e.p.p of search node e.p are driven, in this way iteration to source node s, passed through in iterative process Node and connect these nodes directed walk constitute in current production scheduling model from source node s to end node e Optimal Production path Lse.L at this timeseTotal time cost it is minimum, and L will be formedseEach resources of production be determined as it is optimal Resources of production.And in LseMiddle to find the node a that predecessor node is source node s, i.e. a.p=s, Production Scheduling System will be to section Resources of production representated by point a issue production task, and the waiting list which will enter resources of production is medium waiting It is serviced by production.
S302, after having executed current production procedure, using next production procedure as current production procedure, described in update The time cost of each directed walk in production scheduling model, and the determination is returned from current production procedure is executed to execution institute The step of stating required for the last one production procedure of production task total time cost the smallest production path, until having executed The last one production procedure of the production task.
After having executed current production procedure, at this time since the service time in production process is uncertain and production money The state change in source, original Optimal Production path LseIt has been no longer desirable for current dispatch environment, has needed to carry out production Readjustment degree.
Assuming that the node that the resources of production that production task is currently located are formed in production scheduling model is v, resources of production The node that all resources of production of collection are formed in scheduling model integrates as Vk.Since production task has received to finish production at this time Service, therefore source node s and V are removed in node collection VkIn do not include node v all nodes, i.e., removal node collection V in All nodesForm new scheduling model network.In new scheduling model network, node v will make For the source node s in new scheduling model network.
If production task is in resources of production M1,2Upper receiving finishes production service S1, then updated production scheduling model is such as Shown in Fig. 6.Resources of production M at this time1,2Node v in a model becomes source node, and eliminates original source node s and O (S1) In the node of other resources in a model.
Then, the weight of each directed walk in production scheduling model is updated.As previously described, because in production process The state change of service time uncertainty and resources of production is produced, original production scheduling model can not reflect currently Locating production environment.Therefore the weight to directed edge in production scheduling model is needed to be updated, so that production scheduling model The state that current scheduling platform can correctly be described, makes optimal scheduling.
After being updated to directed walk, the process in step S301 is repeated, finds out current production scheduling model In Optimal Production path L from source node s to end node ese.L at this timeseBe based on current production scheduling platform status and Search for the Optimal Production path obtained.With original LseCompare, production path changed.At this point, executing in LseMiddle searching Predecessor node is the node a of source node s, i.e. a.p=s, and Production Scheduling System will issue to resources of production representated by node a Production task, the production task will enter the medium production service to be subjected of waiting list of resources of production.
In the embodiment of the present application, based on production procedure current in production task and the production after current production procedure Each resources of production that the corresponding resources of production of process are concentrated updated production service ability under current production environment, more The time cost of each directed walk in new production scheduling model.
Specifically, determining that any one is directed toward having for next stage resources of production from upper level resources of production according to following steps Include: to the time cost in path
Corresponding production procedure is completed to next stage resources of production starting pair according to from the upper level resources of production The waiting time for the production procedure answered transports processed product to next stage production money from the upper level resources of production The logistics time in source, the next stage resources of production are completed the service time of corresponding production procedure, determine the Oriented Path from Its Maximal Subtrees The time cost of diameter.
Wherein, since the resources of production under cloud manufacturing platform are distributed in different geographical locations, production task is not Transport needs to consume corresponding logistics time between same resources of production.For each of production scheduling model node a, use Coordinate value (xa,yb) indicate the position where resources of production representated by node a.Then have for each in scheduling model To pathThe logistics time is enabled to be
Production scheduling model interior joint a provides production service SiConsumed production service time isAccording to cloud Production specific features under manufacturing environment, the service time are uncertain.Mathematics probabilistic for service time at present It describes shared random number, fuzzy number and interval number three classes and describes method.Random counting method needs the accurate general of known service time Rate distribution, fuzzy number is also required to the fuzzy membership function of known service time, therefore random number and fuzzy counting method are dependent on In the great amount of samples data that the time obtains.But in actual production, it is limited to data acquisition modes, workload, safety, randomness Equal practical factors, acquisition mass production sample data is more difficult, and most of service times are difficult to be fitted to accurate function, And the boundary of service time or range are easier to obtain, therefore describe the fluctuation of service time using interval number herein.Section The modeling advantage of counting method is need to only to determine service time lower boundaryThe coboundary andWithout regard in section Specific value or the regularity of distribution, this description method closing to reality production status the most.Due to the variation of service time be with What machine occurred, therefore this model definesDesired valueAre as follows:Actual service time needs to receive corresponding production service S in production taskiIt It can just learn afterwards.
In cloud manufacture scheduling model, each resources of production synchronization is only capable of providing a kind of life for a production task Produce service.When multiple production tasks are transported to the same resources of production, production task will be in waiting list according to elder generation Enter the sequence arrangement first gone out, waits specific production service to be subjected.The Queue time t of production scheduling model interior joint aq,aFor The sum of the service time of the medium all production tasks to be serviced of the waiting list of resources of production a, it may be assumed thatDue toIt is uncertain, therefore Queue time t for interval numberq,aAnd it is uncertain, Enable tq,aDesired value E (tq,a) are as follows:(For currently in the waiting of resources of production a The service time of the production service consumption received required for medium k-th of the production task to be serviced of queue).When with active service Between it is the same, the actual arrays time needs to receive production service Shi Caineng in production task to learn.
After the parameter that above each influence time cost has been determined, the time cost is determined according to following steps:
During executing each production task, one of the function time is calculated based on preset a variety of time costs Cost calculates function, determines the time cost;
The method also includes:
According to the task action result for executing a variety of production tasks respectively and every kind of production task institute in the process of implementation The time cost used calculates function, and it is optimal to filter out corresponding task action result in a variety of time costs calculating function Time cost calculates function as the time cost used when executing subsequent production task and calculates function.
Here, time cost function decides the weight of the directed walk in production scheduling model.And the power of directed walk Value decides the weight in the production path by the directed walk, and then influences the result of production scheduling.In the embodiment of the present application At least six kinds of time cost functions are described, six kinds of time cost functions are illustrated individually below.
(1) MS:MS time cost function provides, if resources of production representated by b node belong to resources of production collection O (Si), Then directed walkWeight provide S for biThe service time expectation of production service, it may be assumed that
(2) ML:ML scheduling rule provides, directed walkWeight be resources of production that node a and node b are respectively represented Between logistics time, it may be assumed that
(3) MQ:MQ scheduling rule provides, directed walkWeight be node b Queue time it is expected, it may be assumed that
(4) MLS:MLS scheduling rule provides, if resources of production representated by b node belong to resources of production collection O (Si), then The weight of directed walk are as follows:
(5) MMQL:MMQL scheduling rule provides, directed walkWeight are as follows:
(6) MSQL:MSQL scheduling rule provides, if resources of production representated by b node belong to resources of production collection O (Si), Then directed walkWeight are as follows:
To the emulation experiment of above-mentioned six kinds of time cost functional simulations production scene, to judge its respective scheduling knot of screening Fruit.To the task completion rate of six kinds of time cost functions, task-delay rate, average task-delay time and average service availability Result be compared, it can be deduced that, the dispatching effect of scheduling rule function MQ, MMQL and MSQL will be much better than scheduling rule letter Number ML, MLS and MS, this is because the former scheduling rule has comprehensively considered more factors, and reasonable design scheduling letter Number expression formula, has more acurrate reasonable assessment to the weight of each directed edge.In scheduling rule function MQ, MMQL and MSQL In, optimal scheduling rule function is MSQL.When general assignment quantity is identical, the task completion rate of MSQL is higher than other scheduling rule Then function, and the task-delay rate of MSQL and average task-delay time are below other scheduling rule functions.When general assignment number When measuring identical, the average service utilization rate of MSQL is less than the average service utilization rate of MQ and MMQL strategy.Therefore, MSQL can be Under the premise of guaranteeing that task completion rate and task-delay rate are horizontal, average service utilization rate, the i.e. average load of resources of production are reduced Lotus.This illustrates that scheduling rule function MSQL is more reasonable to the scheduling of production and the distribution of resource.
Cloud manufacturing environment is uncertain production environment of typical service time, while cloud manufacturing environment is in large scale, raw Resource dispersion is produced, brings new difficulty for production scheduling.In the embodiment of the present application, first to the production tune under cloud manufacturing environment Degree problem carries out abstract modeling, the scheduling process of production task is abstracted into production scheduling model, and by analyzing the model Feature proposes a kind of new production scheduling method in conjunction with readjustment degree, time cost function, correctly can handle service time not Under the premise of determining feature, the characteristics of producing under cloud manufacturing environment is taken into account, meanwhile, these features are included in production scheduling method In, the time complexity of production scheduling method can be greatly reduced, enable the method to instruct the cloud manufacturing environment lower time not true Fixed production scheduling, to produce money as each production procedure reasonable distribution in production task according to the state of each resources of production Production efficiency is improved so as to shorten the task production cycle in source.
In addition, having carried out simulation comparison experiment to six kinds of different time cost functions.Time cost function determines life The weight of directed walk in scheduling model is produced, and the weight of directed walk is to the weight meeting for producing path by the directed walk It has a direct impact, and then influences the result of final production scheduling.Therefore, suitable, reasonable time cost function is selected extremely It closes important.The embodiment of the present application is investigated and screens to the relevant parameter of production scheduling model first, selection and production scheduling Parameter relevant to resource allocation, and these parameters are modeled.Then integration parameters design six kinds of different time schedulings Function.Finally, one specific production scheduling scene of design, uses the Simio modeling and simulating software realization scheduling scenario.Pass through Grouping experiment is scheduled in current scheduling scenario with different time cost functions, and analysis compares final scheduling As a result, the superiority and inferiority of assessment time cost function.
Based on the same inventive concept, production scheduling dress corresponding with production scheduling method is additionally provided in the embodiment of the present application It sets, since the principle that the device in the embodiment of the present application solves the problems, such as is similar to the above-mentioned production scheduling method of the embodiment of the present application, Therefore the implementation of device may refer to the implementation of method, and overlaps will not be repeated.As shown in fig. 7, comprises:
Module 701 is obtained, for obtaining the corresponding resources of production collection of each production procedure in production task, wherein each Resources of production are concentrated, and to include at least one provide the resources of production that production services for the corresponding production procedure of resources of production collection;
First processing module 702, for according to the sequence of each production procedure in the production task and acquisition Resources of production collection establishes production scheduling model, wherein including between adjacent resources of production in the production scheduling model according to life The directed walk of process sequentially formed is produced, includes the time cost of every directed walk in the production scheduling model;
Second processing module 703, for the time cost based on each directed walk of production scheduling model, from each The resources of production concentrate one resources of production of selection, to generate the production path for including at least one directed walk.
The Second processing module 703 is specifically used for:
Based on the time cost of each directed walk in current production scheduling model, determine from execute current production procedure to The smallest production path of total time cost required for the last one production procedure of the production task is executed, and will be determining The resources of production that current production procedure is executed in the smallest production path of total time cost are selected as the production path ultimately generated In a resources of production;
After having executed current production procedure, using next production procedure as current production procedure, the production is updated The time cost of each directed walk in scheduling model, and the determination is returned from current production procedure is executed to the execution life It is described until having executed required for the last one production procedure of production task the step of total time cost the smallest production path Production task the last one production procedure.
The update module is specifically used for updating in the production scheduling model each directed walk according to following steps Time cost:
It is respectively corresponded based on production procedure current in the production task and the production procedure after current production procedure Each resources of production for concentrating of resources of production under current production environment updated production service ability, update production tune Spend the time cost of each directed walk in model.
In the present embodiment, concrete function and the friendship of module 701, first processing module 702 and Second processing module 703 are obtained Mutual mode, reference can be made to the record of the corresponding embodiment of Fig. 1, details are not described herein.
As shown in figure 8, being the structural schematic diagram of electronic equipment provided by the embodiments of the present application, which includes processor 81, memory 82 and bus 83, the memory 82 storage execute instruction, when described device operation, the processor 81 with It is communicated between the memory 82 by bus 83, the processor 81 executes described execute instruction so that described device executes such as Lower method:
Obtain the corresponding resources of production collection of each production procedure in production task;Wherein each resources of production concentration includes There is at least one to provide the resources of production of production service for the corresponding production procedure of resources of production collection;
According to the resources of production collection of the sequence of each production procedure in the production task and acquisition, establishes production and adjust Model is spent, wherein comprising oriented according to sequentially forming for production procedure between adjacent resources of production in the production scheduling model Path includes the time cost of every directed walk in the production scheduling model;
Based on the time cost of each directed walk of production scheduling model, selection is concentrated from each resources of production One resources of production, to generate the production path for including at least one directed walk.
Corresponding to one of Fig. 1 production scheduling method, the embodiment of the present application also provides a kind of computer-readable storages Medium is stored with computer program on the computer readable storage medium, executes when which is run by processor The step of stating production scheduling method.
Specifically, which can be general storage medium, such as mobile disk, hard disk, on the storage medium Computer program when being run, a kind of above-mentioned production scheduling method is able to carry out, thus for each life in production task The optimal resources of production of process selecting are produced, and then achieve the effect that improve production efficiency.
A kind of computer program product of production scheduling method provided by the embodiment of the present application, including store program generation The computer readable storage medium of code, the instruction that said program code includes can be used for executing previous methods as described in the examples Method, specific implementation can be found in embodiment of the method, and details are not described herein.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description It with the specific work process of device, can refer to corresponding processes in the foregoing method embodiment, details are not described herein.In the application In provided several embodiments, it should be understood that disclosed systems, devices and methods, it can be real by another way It is existing.The apparatus embodiments described above are merely exemplary, for example, the division of the unit, only a kind of logic function It can divide, there may be another division manner in actual implementation, in another example, multiple units or components can combine or can collect At another system is arrived, or some features can be ignored or not executed.Another point, shown or discussed mutual coupling Conjunction or direct-coupling or communication connection can be the indirect coupling or communication connection by some communication interfaces, device or unit, It can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme 's.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit It is that each unit physically exists alone, can also be integrated in one unit with two or more units.
It, can be with if the function is realized in the form of SFU software functional unit and when sold or used as an independent product It is stored in the executable non-volatile computer-readable storage medium of a processor.Based on this understanding, the application Technical solution substantially the part of the part that contributes to existing technology or the technical solution can be with software in other words The form of product embodies, which is stored in a storage medium, including some instructions use so that One computer equipment (can be personal computer, server or the network equipment etc.) executes each embodiment institute of the application State all or part of the steps of method.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. is various to deposit Store up the medium of program code.
Finally, it should be noted that embodiment described above, the only specific embodiment of the application, to illustrate the application Technical solution, rather than its limitations, the protection scope of the application is not limited thereto, although with reference to the foregoing embodiments to this Shen It please be described in detail, those skilled in the art should understand that: anyone skilled in the art Within the technical scope of the present application, it can still modify to technical solution documented by previous embodiment or can be light It is readily conceivable that variation or equivalent replacement of some of the technical features;And these modifications, variation or replacement, do not make The essence of corresponding technical solution is detached from the spirit and scope of the embodiment of the present application technical solution, should all cover the protection in the application Within the scope of.Therefore, the protection scope of the application shall be subject to the protection scope of the claim.

Claims (10)

1. a kind of production scheduling method characterized by comprising
Obtain the corresponding resources of production collection of each production procedure in production task;Wherein each resources of production concentration include to Few one provides the resources of production of production service for the corresponding production procedure of resources of production collection;
According to the resources of production collection of the sequence of each production procedure in the production task and acquisition, production scheduling mould is established Type, wherein including the Oriented Path from Its Maximal Subtrees sequentially formed between adjacent resources of production according to production procedure in the production scheduling model Diameter includes the time cost of every directed walk in the production scheduling model;
Based on the time cost of each directed walk of production scheduling model, selection one is concentrated from each resources of production Resources of production, to generate the production path for including at least one directed walk.
2. the method according to claim 1, wherein based on each directed walk of the production scheduling model when Between cost, one resources of production of selection are concentrated from each resources of production, to generate the life for including at least one directed walk Produce path, comprising:
Based on the time cost of each directed walk in current production scheduling model, determine from current production procedure is executed to execution The smallest production path of total time cost required for the last one production procedure of the production task, and will be determining total when Between execute the resources of production of current production procedure in the smallest production path of cost and be selected as in the production path ultimately generated One resources of production;
After having executed current production procedure, using next production procedure as current production procedure, the production scheduling is updated The time cost of each directed walk in model, and the determination is returned from current production procedure is executed to the execution production times Life required for the last one production procedure of business the step of total time cost the smallest production path, described in executed The last one production procedure of production task.
3. according to the method described in claim 2, it is characterized in that, described update each Oriented Path from Its Maximal Subtrees in the production scheduling model The time cost of diameter, comprising:
Based on production procedure current in the production task and the corresponding life of production procedure after current production procedure The updated production service ability under current production environment of each resources of production in resource set is produced, the production scheduling mould is updated The time cost of each directed walk in type.
4. according to the method described in claim 3, it is characterized in that, determining that any one produces from upper level according to following steps Resource is directed toward the time cost of the directed walk of next stage resources of production:
It is corresponding to next stage resources of production starting according to corresponding production procedure is completed from the upper level resources of production The waiting time of production procedure transports processed product to the next stage resources of production from the upper level resources of production Logistics time, the next stage resources of production are completed the service time of corresponding production procedure, determine the directed walk Time cost.
5. the method according to claim 1, wherein determining the time cost according to following steps:
During executing each production task, one of function time cost is calculated based on preset a variety of time costs Function is calculated, determines the time cost;
The method also includes:
It is used in the process of implementation according to the task action result for executing a variety of production tasks respectively and every kind of production task Time cost calculate function, a variety of time costs calculate function in filter out the corresponding task action result optimal time Cost calculates function as the time cost used when executing subsequent production task and calculates function.
6. a kind of production scheduling device characterized by comprising
Module is obtained, for obtaining the corresponding resources of production collection of each production procedure in production task, wherein each production money Source is concentrated, and to include at least one provide the resources of production that production services for the corresponding production procedure of resources of production collection;
First processing module, for according to the sequence of each production procedure in the production task and the resources of production of acquisition Collection, establishes production scheduling model, wherein including between adjacent resources of production in the production scheduling model according to production procedure The directed walk sequentially formed includes the time cost of every directed walk in the production scheduling model;
Second processing module, for the time cost based on each directed walk of production scheduling model, from each life It produces and selects a resources of production in resource set, to generate the production path for including at least one directed walk.
7. device according to claim 6, which is characterized in that the Second processing module is specifically used for:
Based on the time cost of each directed walk in current production scheduling model, determine from current production procedure is executed to execution The smallest production path of total time cost required for the last one production procedure of the production task, and will be determining total when Between execute the resources of production of current production procedure in the smallest production path of cost and be selected as in the production path ultimately generated One resources of production;
After having executed current production procedure, using next production procedure as current production procedure, the production scheduling is updated The time cost of each directed walk in model, and the determination is returned from current production procedure is executed to the execution production times Life required for the last one production procedure of business the step of total time cost the smallest production path, described in executed The last one production procedure of production task.
8. device according to claim 7, which is characterized in that the update module is specifically used for being updated according to following steps The time cost of each directed walk in the production scheduling model:
Based on production procedure current in the production task and the corresponding life of production procedure after current production procedure The updated production service ability under current production environment of each resources of production in resource set is produced, the production scheduling mould is updated The time cost of each directed walk in type.
9. a kind of electronic equipment characterized by comprising processor, memory and bus, the memory are stored with the place The executable machine readable instructions of device are managed, when electronic equipment operation, pass through bus between the processor and the memory Communication, the machine readable instructions execute production scheduling side as claimed in claim 1 to 5 when being executed by the processor The step of method.
10. a kind of computer readable storage medium, which is characterized in that be stored with computer journey on the computer readable storage medium Sequence executes the step of the production scheduling method as described in claim 1 to 5 any one when the computer program is run by processor Suddenly.
CN201811266948.6A 2018-10-29 2018-10-29 A kind of production scheduling method and device Pending CN109409746A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811266948.6A CN109409746A (en) 2018-10-29 2018-10-29 A kind of production scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811266948.6A CN109409746A (en) 2018-10-29 2018-10-29 A kind of production scheduling method and device

Publications (1)

Publication Number Publication Date
CN109409746A true CN109409746A (en) 2019-03-01

Family

ID=65470434

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811266948.6A Pending CN109409746A (en) 2018-10-29 2018-10-29 A kind of production scheduling method and device

Country Status (1)

Country Link
CN (1) CN109409746A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112397147A (en) * 2020-12-03 2021-02-23 北京三维天地科技股份有限公司 Gene sequencing delivery method and system for realizing collinear production based on intelligent scheduling technology

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105959401A (en) * 2016-06-20 2016-09-21 北京航空航天大学 Supply-demand matching and dynamic scheduling method of manufacturing service based on hypernetwork

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105959401A (en) * 2016-06-20 2016-09-21 北京航空航天大学 Supply-demand matching and dynamic scheduling method of manufacturing service based on hypernetwork

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
李珊珊: "云制造资源优化配置研究", 《万方学位论文》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112397147A (en) * 2020-12-03 2021-02-23 北京三维天地科技股份有限公司 Gene sequencing delivery method and system for realizing collinear production based on intelligent scheduling technology
CN112397147B (en) * 2020-12-03 2021-06-15 北京三维天地科技股份有限公司 Gene sequencing delivery method and system for realizing collinear production based on intelligent scheduling technology

Similar Documents

Publication Publication Date Title
Chekired et al. Industrial IoT data scheduling based on hierarchical fog computing: A key for enabling smart factory
US8255344B2 (en) Systems and methods for parallel processing optimization for an evolutionary algorithm
US20180270121A1 (en) Information processing architecture for network edge-based optimization problems
Adibi et al. A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem
CN109445386A (en) A kind of most short production time dispatching method of the cloud manufacturing operation based on ONBA
Li et al. Assembly line balancing problem with task learning and dynamic task reassignment
CN108768716A (en) A kind of micro services routing resource and device
Cao et al. A parallel computing framework for large-scale air traffic flow optimization
Sarathambekai et al. Task scheduling in distributed systems using heap intelligent discrete particle swarm optimization
Hu et al. Multi-objective new product development by complete Pareto front and ripple-spreading algorithm
CN108122032A (en) A kind of neural network model training method, device, chip and system
CN103942283B (en) Manufacturing resource recommendation method and system on basis of Web services
Kliewer et al. A general parallel simulated annealing library and its application in airline industry
CN109409746A (en) A kind of production scheduling method and device
Heinrich et al. Quality-of-service-aware service selection: A novel approach considering potential service failures and nondeterministic service values
In et al. Policy-based scheduling and resource allocation for multimedia communication on grid computing environment
CN112506644A (en) Task scheduling method and system based on cloud edge-side hybrid computing mode system
Ayoubi et al. An autonomous IoT service placement methodology in fog computing
CN110377769A (en) Modeling Platform system, method, server and medium based on graph data structure
Li et al. A scheduling method for IOT-aided packaging and printing manufacturing system
Rondon et al. Neural network modelling and simulation of the scheduling
Pérez et al. Parallel/distributed implementation of cellular training for generative adversarial neural networks
Kliewer A general software library for parallel simulated annealing
CN106686076B (en) Key feature sequence choosing method in resource service network based on cluster
Xiao et al. Dynamic resource allocation algorithm of virtual networks in edge computing networks

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