CN115032957B - Production scheduling method and device, storage medium and electronic equipment - Google Patents
Production scheduling method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN115032957B CN115032957B CN202210772014.XA CN202210772014A CN115032957B CN 115032957 B CN115032957 B CN 115032957B CN 202210772014 A CN202210772014 A CN 202210772014A CN 115032957 B CN115032957 B CN 115032957B
- Authority
- CN
- China
- Prior art keywords
- user
- target
- work order
- production scheduling
- priority
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 201
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000003860 storage Methods 0.000 title claims abstract description 21
- 238000011156 evaluation Methods 0.000 claims abstract description 64
- 238000004364 calculation method Methods 0.000 claims description 23
- 238000004891 communication Methods 0.000 claims description 20
- 238000013210 evaluation model Methods 0.000 claims description 9
- 238000010276 construction Methods 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 9
- 230000004069 differentiation Effects 0.000 abstract description 5
- 238000010992 reflux Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 11
- 238000012545 processing Methods 0.000 description 7
- 238000009826 distribution Methods 0.000 description 5
- 238000012544 monitoring process Methods 0.000 description 5
- 238000009434 installation Methods 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 239000011159 matrix material Substances 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000005259 measurement Methods 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000009466 transformation Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/32—Operator till task planning
- G05B2219/32252—Scheduling production, machining, job shop
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The disclosure belongs to the technical field of production control, and relates to a production scheduling method and device, a storage medium and electronic equipment. The method comprises the following steps: acquiring dynamic evaluation parameters of a target user, and calculating the dynamic evaluation parameters to obtain a user priority coefficient of the target user; generating a production scheduling work order according to a user order of a target user, and calculating the production scheduling work order to obtain a dispatching order priority; and calculating the user priority coefficient and the dispatch priority to obtain a target priority, and dispatching the production scheduling worksheet according to the target priority. The method provides two data support and corresponding theoretical basis for determining the order sequence, provides an automatic, parallelization, differentiation and optimized comprehensive scheduling mode of production resources, optimizes the scheduling effect of the production resources, improves the instantaneity and accuracy of the production scheduling, achieves the effect of rapidly delivering multiple products to clients, improves the satisfaction degree of the users and improves the reflux degree of the users.
Description
Technical Field
The present disclosure relates to the field of production control technologies, and in particular, to a production scheduling method and device, a computer readable storage medium, and an electronic device.
Background
With the serious decision deployment of the country on digital transformation, the service center and the data center become the core mode for large enterprises to develop digital transformation, namely a double center mode.
The method is one of the core problems to be solved by the business center aiming at the customers with different values and the products with different production procedures, and how to efficiently schedule production resources, provide production opening services with different priorities, rapidly deliver to the customers and realize high output of enterprises.
In view of this, there is a need in the art to develop a new production scheduling method and apparatus.
It should be noted that the information disclosed in the above background section is only for enhancing understanding of the background of the present disclosure and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The disclosure aims to provide a production scheduling method, a production scheduling device, a computer readable storage medium and an electronic device, so as to overcome the technical problem of poor resource scheduling effect caused by the limitation of the related technology at least to a certain extent.
Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.
According to a first aspect of an embodiment of the present invention, there is provided a production scheduling method, the method including:
acquiring dynamic evaluation parameters of a target user, and calculating the dynamic evaluation parameters to obtain a user priority coefficient of the target user;
generating a production scheduling work order according to the user order of the target user, and calculating the production scheduling work order to obtain a dispatching priority;
and calculating the user priority coefficient and the dispatch priority to obtain a target priority, and dispatching the production scheduling worksheet according to the target priority.
In an exemplary embodiment of the present invention, the calculating the dynamic evaluation parameter to obtain the user priority coefficient of the target user includes:
normalizing the dynamic evaluation parameters to obtain target evaluation parameters, and calculating the target evaluation parameters to obtain user scores;
and adjusting the user score to obtain a target score, so as to determine the target score as a user priority coefficient of the target user.
In an exemplary embodiment of the present invention, the generating a production schedule work order according to a user order of the target user includes:
Acquiring a user order of the target user, and acquiring a production subject and a destination address related in the user order;
generating a production scheduling work order corresponding to the user order according to the production main body; and/or
And generating a production scheduling work order corresponding to the user order according to the destination address.
In an exemplary embodiment of the present invention, the calculating the production schedule worksheet to obtain the dispatch priority includes:
acquiring the work order type of the production scheduling work order, and determining the front work order number of the production scheduling work order according to the work order type;
and acquiring preset parameters corresponding to the work order types, and calculating the preset parameters and the preposed work order numbers to obtain the order sending priority.
In an exemplary embodiment of the present invention, the work order type includes: communication type product worksheets, cloud application type product worksheets, entity type product worksheets, service type product worksheets and rights and interests type product worksheets.
In an exemplary embodiment of the present invention, the dispatching the production scheduling worksheet according to the target priority includes:
sorting the target priority to obtain a sorting result;
And dispatching the production scheduling worksheets according to the sequencing result.
In an exemplary embodiment of the present invention, the dispatching the production scheduling worksheet according to the sorting result includes:
based on the sorting result, performing a first round of dispatch on the production scheduling worksheets with the dispatch priority same as a preset parameter;
based on the sorting result, performing a second round of dispatch of the production scheduling worksheets with the worksheets of the communication type product worksheets;
and based on the sorting result, performing third dispatch on the production scheduling worksheet of which the worksheet type is the service product worksheet.
According to a second aspect of the embodiment of the present invention, there is provided a production scheduling apparatus including:
the first calculation module is configured to acquire dynamic evaluation parameters of a target user, and calculate the dynamic evaluation parameters to acquire a user priority coefficient of the target user;
the second calculation module is configured to generate a production scheduling work order according to the user order of the target user, and calculate the production scheduling work order to obtain a dispatch priority;
and the production scheduling module is configured to calculate the user priority coefficient and the dispatch priority to obtain a target priority, and dispatch the production scheduling worksheet according to the target priority.
According to a third aspect of an embodiment of the present invention, there is provided an electronic apparatus including: a processor and a memory; wherein the memory has stored thereon computer readable instructions which, when executed by the processor, implement the production scheduling method of any of the above-described exemplary embodiments.
According to a fourth aspect of embodiments of the present invention, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the production scheduling method in any of the above-described exemplary embodiments.
As can be seen from the above technical solutions, the production scheduling method, the production scheduling device, the computer storage medium and the electronic device in the exemplary embodiments of the present disclosure have at least the following advantages and positive effects:
in the method and the device provided by the exemplary embodiment of the disclosure, the user priority coefficient and the dispatch priority can be obtained through the calculation of the dynamic evaluation and the production scheduling worksheet respectively, so that two aspects of data support and corresponding theoretical basis are provided for the determination of the dispatch sequence. Furthermore, the target priority is obtained by calculating the user priority coefficient and the dispatch priority, and dispatch is performed, so that an automatic, parallelization, differentiation and optimized comprehensive scheduling mode of production resources is provided, the scheduling effect of the production resources is optimized, the instantaneity and accuracy of the production scheduling are improved, the effect of rapidly delivering multiple products to clients is achieved, the user service experience and satisfaction are improved, and the user reflux degree is further improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure. It will be apparent to those of ordinary skill in the art that the drawings in the following description are merely examples of the disclosure and that other drawings may be derived from them without undue effort.
FIG. 1 schematically illustrates a flow diagram of a method of production scheduling in an exemplary embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow diagram of a method of calculating user priority coefficients in an exemplary embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow diagram of a method of generating a production schedule work order in an exemplary embodiment of the present disclosure;
FIG. 4 schematically illustrates a flow diagram of a method of calculating dispatch priority in an exemplary embodiment of the present disclosure;
FIG. 5 schematically illustrates a flow diagram of a method of assigning orders according to target priorities in an exemplary embodiment of the present disclosure;
FIG. 6 schematically illustrates a flow diagram of a method of dispatching orders further according to target priority in an exemplary embodiment of the present disclosure;
FIG. 7 schematically illustrates a scheduling model architecture diagram of a production scheduling method in an application scenario in an exemplary embodiment of the present disclosure;
FIG. 8 schematically illustrates a flow chart of a method for production scheduling in an application scenario in an exemplary embodiment of the present disclosure;
FIG. 9 schematically illustrates a schematic structure of a production scheduling apparatus in an exemplary embodiment of the present disclosure;
FIG. 10 schematically illustrates an electronic device for implementing a production scheduling method in an exemplary embodiment of the present disclosure;
fig. 11 schematically illustrates a computer-readable storage medium for implementing a production scheduling method in an exemplary embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the present disclosure. One skilled in the relevant art will recognize, however, that the aspects of the disclosure may be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.
The terms "a," "an," "the," and "said" are used in this specification to denote the presence of one or more elements/components/etc.; the terms "comprising" and "having" are intended to be inclusive and mean that there may be additional elements/components/etc. in addition to the listed elements/components/etc.; the terms "first" and "second" and the like are used merely as labels, and are not intended to limit the number of their objects.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
In view of the problems in the related art, the present disclosure proposes a production scheduling method. Fig. 1 shows a flow chart of a production scheduling method, which, as shown in fig. 1, comprises at least the following steps:
s110, acquiring dynamic evaluation parameters of the target user, and calculating the dynamic evaluation parameters to obtain a user priority coefficient of the target user.
And S120, generating a production scheduling work order according to the user order of the target user, and calculating the production scheduling work order to obtain the dispatching priority.
And S130, calculating a user priority coefficient and a dispatch priority to obtain a target priority, and dispatching the production scheduling worksheet according to the target priority.
In the exemplary embodiment of the disclosure, the user priority coefficient and the dispatch priority can be obtained through the calculation of the dynamic evaluation and the production scheduling worksheet respectively, so that two aspects of data support and corresponding theoretical basis are provided for the determination of the dispatch sequence. Furthermore, the target priority is obtained by calculating the user priority coefficient and the dispatch priority, and dispatch is performed, so that an automatic, parallelization, differentiation and optimized comprehensive scheduling mode of production resources is provided, the scheduling effect of the production resources is optimized, the instantaneity and accuracy of the production scheduling are improved, the effect of rapidly delivering multiple products to clients is achieved, the user service experience and satisfaction are improved, and the user reflux degree is further improved.
The steps of the production scheduling method are described in detail below.
In step S110, a dynamic evaluation parameter of the target user is obtained, and a user priority coefficient of the target user is obtained by calculating the dynamic evaluation parameter.
In an exemplary embodiment of the present disclosure, in a digital business scenario, a user needs numerous digital products, including communication classes, cloud application classes, physical classes, service classes, rights classes, etc., and further, numerous products.
Based on the centralized business center in the whole country, the customer flow is large, and the product ordering is more, so how to rapidly produce and open the product and deliver the product to the user is very important. Therefore, comprehensive scheduling of production resources becomes a focus problem. The production resources comprise all resources such as networks, systems, platforms, physical objects, vehicles, personnel and the like involved in the production process of the product.
Further, the evaluation may be performed based on the dynamic evaluation model RFMA (Recency, frequency, monetary, average), and thus, the dynamic evaluation parameters corresponding to the dynamic evaluation model RFMA may be acquired first.
The dynamic evaluation parameters may include, among others, the last consumption (precision), the Frequency of consumption (Frequency), the total amount of consumption (monetari), and the Average amount of consumption (Average).
Specifically, the last consumption refers to the time of the last purchase, which is used to measure loyalty, and may be represented as an R value; the consumption frequency refers to the number of purchases in a defined time, and is used for measuring liveness, and can be expressed as an F value; the total amount of consumption refers to the amount spent in a defined time, which may be expressed as an M value, and the average amount of consumption refers to the amount spent in an order average (i.e., M/F) in a defined time, which may be expressed as an a value.
Further, the obtained dynamic evaluation parameters may be calculated to obtain a user priority coefficient.
In an alternative embodiment, fig. 2 shows a flow chart of a method for calculating a user priority coefficient, as shown in fig. 2, the method may at least comprise the steps of: in step S210, the target evaluation parameters are obtained by normalizing the dynamic evaluation parameters, and the target evaluation parameters are calculated to obtain the user scores.
Based on the dynamic evaluation model RFMA, a customer Score (Score) calculation model is first proposed, that is, customer Score (Score) = [ T0- (D-R) ]xa+f+b+m+c+a+d.
Where a=0.2, b=0.3, c=0.4, d=0.1, and in actual operation, fine tuning of a, b, c, and d may be performed. T0 is a time, and represents a statistical period, and when the statistical period is 1 year, the statistical period can be calculated according to 365 days. D is the current time and D-R is the number of days. R, M, F can be counted by querying a database and a=m/F.
The user score is an evaluation value of the user value and the profit creation capability, and can be ranked according to the user score from large to small so as to obtain a user priority coefficient of the target user.
However, since R is time, F is the number of times, and M is the amount of money, these are not the same measurement dimension, there may be cases where the existing value is large and the existing value is small. To exploit the value of each dimension to score the user, the normalization process may be performed on R, M, F, A using a pattern of "X' = (X-Xmin)/(Xmax-Xmin)".
Specifically, r= [ T0- (D-R) ], rmin=0, rmax=t0, then the target evaluation parameter R' = (R-0)/(T0-0) = [ T0- (D-R) ]/t0=1- (D-R)/T0.
Correspondingly, the target evaluation parameter F ' = (F-Fmin)/(Fmax-Fmin), the target evaluation parameter M ' = (M-Mmin)/(Mmax-Mmin), and the target evaluation parameter a ' = (a-Amin)/(Amax-Amin).
The calculation of the maximum value and the minimum value of F, M and A can be performed by searching a database, respectively counting F, M, A values of all users in the period T0, and then solving the maximum value and the minimum value.
Thus, user Score (Score) =r '×a+f' ×b+m '×c+a' ×d.
Wherein a=0.2, b=0.3, c=0.4, d=0.1, r ', F', M ', a' are all > =0 and < =1; then, the user Score (Score) is also a numeric value of > =0 and < =1, and the larger the numeric value, the higher the priority of the client.
In step S220, the user score is adjusted to obtain a target score, so as to determine the target score as a user priority coefficient of the target user.
To adapt the ordering logic of the order priorities of the subsequent production schedule work orders, logic is needed that adjusts the user scores to be higher the smaller the value.
Thus, a "1-" process may be performed on the user score. That is, the target score=1- (R '×a+f' ×b+m '×c+a' ×d).
At this time, the smaller the target score, the higher the client priority.
For a time period t, e.g. 10 minutes, all customers (customers) generating orders, scoring the customers in "1-" mode, respectively, will result in C1: s1, C2: s2, C3: s3. where Ci represents the i-th customer, si represents the score of Ci, 0= < Si < = 1, i = 1, 2.
Therefore, the target score Si can be determined as the user priority coefficient of the target user, and then the smaller the coefficient, the higher the priority of the user.
In the present exemplary embodiment, a user scoring calculation model based on a dynamic evaluation model is provided by calculating the obtained dynamic evaluation parameters to obtain corresponding user priority coefficients, and a data base is provided for determining the final target priority coefficient, so that accuracy and instantaneity of production scheduling are further ensured.
In step S120, a production scheduling job ticket is generated according to the user order of the target user, and the production scheduling job ticket is calculated to obtain the dispatch priority.
In an exemplary embodiment of the present disclosure, user orders for a target user may be collected to generate a corresponding production schedule work order.
In an alternative embodiment, fig. 3 shows a flow diagram of a method of generating a production schedule work order, as shown in fig. 3, which may include at least the steps of: in step S310, a user order of the target user is acquired, and a production subject and a destination address involved in the user order are acquired.
By the present moment, the user orders of all target users within a time period t, e.g. 10 minutes, are pooled.
In addition, in order to generate the production schedule work order, the production subject and destination addresses involved in all the user orders can also be acquired.
Wherein the production subject is a subject providing the corresponding product, and the destination address is an address to which the product needs to be provided.
In step S320, a production schedule work order corresponding to the user order is generated according to the production subject.
And correspondingly generating a production scheduling work order according to the production subject of the product in the user order.
Specifically, products belonging to the same production subject in the same user order can be classified as a production scheduling work order.
In step S330, a production schedule work order corresponding to the user order is generated according to the destination address.
When the user order contains products with different destination addresses, the user order can be divided into sub orders with different addresses by the same user by taking the destination addresses as units, and then a production scheduling work order is correspondingly generated for the sub orders with each destination address.
In addition, when the user order contains products with different destination addresses, the order with different destination addresses of the same user can be split by taking the destination addresses as units; and generating a production scheduling work order corresponding to the identity of the product type and the production main body according to each user order.
In the present exemplary embodiment, a production scheduling work order is generated by the obtained production subject and destination address in the user order, which provides data support and theoretical basis for calculating the order priority.
After the production schedule worksheet is generated, the production schedule worksheet may be computed to obtain the dispatch priority.
In an alternative embodiment, fig. 4 shows a flowchart of a method for calculating dispatch priority, and as shown in fig. 4, the method may at least include the following steps: in step S410, the work order type of the production scheduling work order is acquired, and the front work order number of the production scheduling work order is determined according to the work order type.
In an alternative embodiment, the worksheet type includes: communication type product worksheets, cloud application type product worksheets, entity type product worksheets, service type product worksheets and rights and interests type product worksheets.
The communication type product work order can be that a maintenance team and a management system develop network resources or parameter configuration and the like; the cloud application product worksheet can be a maintenance team, a management system, and the like for developing cloud platform resources or parameter configuration, application deployment and the like; the physical product worksheet can be a physical commodity delivery arrival carried out by a logistics company; the service class product worksheet can be installed by a maintenance person to go to the gate for performing installation, system integration or maintenance service; the equity product worksheet may be configured as an equity platform enabled coupon, discount, or the like.
The j-th production scheduling job Order (WOij) Order Priority (OP) of the i-th client is denoted as OPij; the work order number (Number of Relied Order) of the production scheduling work order, which is recorded as NROij and has to be constructed before dispatching, is used for constructing a dispatching priority structure matrix calculation model, and the dispatching priority structure matrix calculation model is shown in table 1:
TABLE 1
A "yes or no" determination is made for each production schedule work order. Specifically, "yes" is 1, and "no" is 0. The service work order is dependent on the completion of the existing network configuration work order and the physical distribution work order.
In step S420, a preset parameter corresponding to the work order type is obtained, and the preset parameter and the pre-work order number are calculated to obtain the order sending priority.
For cloud application service worksheets, the construction of the broadband service worksheets is also relied on, so that the calculation model is further summarized as follows: opij=1+nroij. Wherein 1 is a preset parameter.
For example, customer Ci opens broadband services and video surveillance-type services. The opening of the broadband service needs three production scheduling worksheets, namely a broadband product existing network configuration worksheet, a broadband terminal logistics distribution worksheet and a broadband upper door installation service worksheet. The broadband overhead installation service work order is completed depending on the construction of the existing network configuration work order and the logistics distribution work order, and then the dispatch priorities of the three production scheduling work orders with the broadband service being opened are respectively as follows: opi1=1, opi2=1, opi3=1+2=3.
The video monitoring service opening needs three production scheduling worksheets, namely a video monitoring platform configuration worksheet, a video terminal logistics distribution worksheet and a video monitoring upper door installation service worksheet. The video monitoring service worksheet is not only completed by means of video platform configuration worksheets and logistics distribution worksheets, but also completed by means of broadband service worksheets, so that the dispatching priorities of three production dispatching worksheets for opening video monitoring services are respectively as follows: opi4=1, opi5=1, opi6=1+3=4.
In the present exemplary embodiment, the corresponding dispatch priority can be obtained by calculating the production scheduling worksheet, so that a data base is provided for determining the final target priority coefficient, and the accuracy and the instantaneity of production scheduling are further ensured.
In step S130, the user priority coefficient and the dispatch priority are calculated to obtain a target priority, and the production scheduling worksheet is dispatched according to the target priority.
To determine the final order priority (Last Order Priority, LOP), a calculation model may be constructed from the user priority coefficients and order priorities, which may be as shown in table 2:
TABLE 2
That is, the final dispatch priority of the j-th production dispatch worksheet of the customer Ci, that is, the target priority lopij=opij×si. Wherein Si is a client priority coefficient, and OPij is a dispatch priority.
It should be noted that different production scheduling worksheets (worksheets with different addresses) under the same user share a client priority coefficient.
After the target priority is calculated, the production scheduling worksheet can be dispatched according to the target priority.
In an alternative embodiment, fig. 5 shows a flow chart of a method for assigning orders according to target priorities, and as shown in fig. 5, the method may at least include the following steps: in step S510, the target priorities are ranked to obtain a ranking result.
In order to send orders according to the mode that the target priority is from small to large, the target priority can be ordered to obtain a corresponding ordering result.
In step S520, the production scheduling worksheet is dispatched according to the sorting result.
In an alternative embodiment, fig. 6 shows a flow chart of a method for further dispatching orders according to target priority, and as shown in fig. 6, the method may at least comprise the following steps: in step S610, a first round of dispatch is performed on the production scheduling worksheets with the dispatch priority same as the preset parameters based on the sorting result.
For the dispatch priority opij=1, that is, the production dispatch worksheets with preset parameters, the production dispatch worksheets can be dispatched in sequence according to the order of the target priority LOPij from small to large in the sequencing result.
In step S620, based on the sorting result, a second round of dispatch is performed on the production scheduling work order of which the work order type is the communication type product work order.
The second round of dispatch is mainly aimed at the communication service class product work order. The second round of dispatch can be skipped when there is no communication service class product work order.
Specifically, after the construction of the broadband product work order and the real product work order is completed, the broadband service product work order is dispatched; other communication service product worksheets having binding relation with the broadband service, such as VOIP (voice over IP, voice over Internet Protocol) service, are dispatched in synchronization with the broadband service product worksheets; other communication service product worksheets which are not in binding relation with the broadband service, such as services of digital circuits, IDC (Internet data center ) and the like, are sequentially dispatched from small to large according to LOPij.
In step S630, based on the sorting result, a third round of dispatch is performed on the production scheduling worksheet whose worksheet type is the service-class product worksheet.
The third order is mainly aimed at the service product work orders which depend on the broadband service opening.
Specifically, after the cloud application type product work order, the physical product work order and the broadband service opening receipt are constructed, the cloud application type service product work order is sequentially dispatched from small to large according to the LOPij.
In the exemplary embodiment of the disclosure, three rounds of dispatch are performed according to the determined target priority, so that dispatch logics of different product worksheets can be strictly followed, the technical problem of accurate scheduling of limited resources is effectively solved, and user experience and product satisfaction are improved.
The production scheduling method in the embodiment of the present disclosure is described in detail below in connection with an application scenario.
Fig. 7 shows a scheduling model architecture diagram of a production scheduling method in an application scenario, as shown in fig. 7, in a digital service scenario, a user needs numerous digital products, including a communication class, a cloud application class, a real object class, a service class, a rights class, and the like, and further subdivides the products into numerous.
Based on the centralized business center in the whole country, the customer flow is large, and the product ordering is more, so how to rapidly produce and open the product and deliver the product to the user is very important. Therefore, comprehensive scheduling of production resources becomes a focus problem. The production resources comprise all resources such as networks, systems, platforms, physical objects, vehicles, personnel and the like involved in the production process of the product.
Fig. 8 shows a flow chart of a production scheduling method in an application scenario, as shown in fig. 8, the maximum value and the minimum value of F, M, A, namely Fmax, fmin, mmax, mmin, amax, amin, are determined by querying database statistics based on historical accumulated data of all clients within a limited time period T0 (which may be 365 days in 1 year) at the current moment.
By the current time, the time period t is pooled, e.g. all customer orders within 10 minutes.
Further, all clients for time period t are dynamically assessed for client value and profitability.
Specifically, all customer names are extracted from all customer orders, and may be noted as C1, C2. And, the customer center database is queried and the R, F, M, A value for each customer, i.e., the Ri, fi, mi, ai value for customer Ci, i=1, 2,..m, is calculated separately for a defined period of time T0 from the current time.
Specifically, the last consumption refers to the time of the last purchase, which is used to measure loyalty, and may be represented as an R value; the consumption frequency refers to the number of purchases in a defined time, and is used for measuring liveness, and can be expressed as an F value; the total amount of consumption refers to the amount spent in a defined time, which may be expressed as an M value, and the average amount of consumption refers to the amount spent in an order average (i.e., M/F) in a defined time, which may be expressed as an a value.
Based on the dynamic evaluation model RFMA, a customer Score calculation model, that is, customer Score (Score) = [ T0- (D-R) ], a+f+b+m+c+a+d, is first proposed. In practical operation, a, b, c and D may be fine-tuned, T0 is a time, a statistical period is represented, when the statistical period is 1 year, it may be calculated according to 365 days, D is a current time, D-R is a number of days, R, M, F may be counted by querying a database, and a=m/F.
The user score is an evaluation value of the user value and the profit creation capability, and can be ranked according to the user score from large to small so as to obtain a user priority coefficient of the target user.
However, since R is time, F is the number of times, and M is the amount of money, these are not the same measurement dimension, there may be cases where the existing value is large and the existing value is small. To exploit the value of each dimension to score the user, the normalization process may be performed on R, M, F, A using a pattern of "X' = (X-Xmin)/(Xmax-Xmin)".
Specifically, r= [ T0- (D-R) ], rmin=0, rmax=t0, then the target evaluation parameter R' = (R-0)/(T0-0) = [ T0- (D-R) ]/t0=1- (D-R)/T0.
Correspondingly, the target evaluation parameter F ' = (F-Fmin)/(Fmax-Fmin), the target evaluation parameter M ' = (M-Mmin)/(Mmax-Mmin), and the target evaluation parameter a ' = (a-Amin)/(Amax-Amin).
The calculation of the maximum value and the minimum value of F, M and A can be performed by searching a database, respectively counting F, M, A values of all users in the period T0, and then solving the maximum value and the minimum value.
Thus, user Score (Score) =r '×a+f' ×b+m '×c+a' ×d.
Wherein a=0.2, b=0.3, c=0.4, d=0.1, r ', F', M ', a' are all > =0 and < =1; then, the user Score (Score) is also a numeric value of > =0 and < =1, and the larger the numeric value, the higher the priority of the client.
To adapt the ordering logic of the order priorities of the subsequent production schedule work orders, logic is needed that adjusts the user scores to be higher the smaller the value.
Thus, a "1-" process may be performed on the user score. That is, the target score=1- (R '×a+f' ×b+m '×c+a' ×d).
At this time, the smaller the target score, the higher the client priority.
For a time period t, e.g. 10 minutes, all customers (customers) generating orders, scoring the customers in "1-" mode, respectively, will result in C1: s1, C2: s2, C3: s3. where Ci represents the i-th customer, si represents the score of Ci, 0= < Si < = 1, i = 1, 2.
Therefore, the target score Si can be determined as the user priority coefficient of the target user, and then the smaller the coefficient, the higher the priority of the user.
On the other hand, dispatch priority calculation (OP) is performed on the production scheduling worksheets of the m clients.
If the customer order contains products with different addresses, the customer order is split into orders with different addresses by taking the destination address as a unit.
For each customer order, a production schedule work order is correspondingly generated according to the identity of the product type and the production subject, WOij, i=1, 2.
And calculating the dispatching priority of each work order according to the dispatching priority structure matrix calculation model, namely, OPij=1+NROij, wherein NROij is the work order number which must be constructed before dispatching the work order, i=1, 2,.
The final dispatch priority calculation is performed for the m customers' production dispatch worksheets, i.e., lopij=opij×si, i=1, 2.
Further, dispatch is performed according to the production scheduling worksheet.
For the dispatch priority opij=1, that is, the production dispatch worksheets with preset parameters, the production dispatch worksheets can be dispatched in sequence according to the order of the target priority LOPij from small to large in the sequencing result.
The second round of dispatch is mainly aimed at the communication service class product work order. The second round of dispatch can be skipped when there is no communication service class product work order.
Specifically, after the construction of the broadband product work order and the real product work order is completed, the broadband service product work order is dispatched; other communication service product worksheets with binding relation with the broadband service, such as VOIP service, are dispatched synchronously with the broadband service product worksheets; and other communication service product worksheets which are not in binding relation with the broadband service, such as digital circuits, IDCs and other services, are sequentially dispatched from small to large according to LOPij.
The third order is mainly aimed at the service product work orders which depend on the broadband service opening.
Specifically, after the cloud application type product work order, the physical product work order and the broadband service opening receipt are constructed, the cloud application type service product work order is sequentially dispatched from small to large according to the LOPij.
And finally, after receiving the construction receipt of each production main body, the comprehensive dispatching center timely updates the production dispatching work unit pool, and prepares to dispatch the bill again until the dispatch is completed.
During the time period t, all production scheduling worksheets of all clients form a worksheet pool. And synchronously considering whether the construction of the front work order is finished and the work order is returned when the order is sequentially dispatched according to the final order dispatching priority, thus realizing the automation, parallelization and differentiation processing of the production dispatching, quickly delivering to clients and maximizing the income of enterprises in real time.
According to the production scheduling method under the application scene, the user priority coefficient and the dispatch priority can be obtained through the dynamic evaluation and the calculation of the production scheduling worksheet respectively, and two data support and corresponding theoretical basis are provided for the determination of the dispatch sequence. Furthermore, the target priority is obtained by calculating the user priority coefficient and the dispatch priority, and dispatch is performed, so that an automatic, parallelization, differentiation and optimized comprehensive scheduling mode of production resources is provided, the scheduling effect of the production resources is optimized, the instantaneity and accuracy of the production scheduling are improved, the effect of rapidly delivering multiple products to clients is achieved, the user service experience and satisfaction are improved, and the user reflux degree is further improved.
When the production scheduling method is used in a digital service scene, the comprehensive scheduling of production resources, including networks, systems, platforms, objects, vehicles, personnel and the like, can be orderly implemented based on the product orders of different classified clients, different services and different production procedures by the nationwide centralized service center, the production opening classified service is provided, the quick delivery to the clients is realized, the high-value clients are ensured to obtain the product opening preferentially, and the problem of how to service the high-value clients preferentially by limited resources is effectively solved. And the customer satisfaction is improved, and meanwhile, the instant maximum income is brought to enterprises.
Fig. 9 shows a schematic structural diagram of a production scheduling device, and as shown in fig. 9, the production scheduling device 900 may include: a first calculation module 910, a second calculation module 920, and a production scheduling module 930. Wherein:
a first calculation module 910, configured to obtain a dynamic evaluation parameter of a target user, and calculate the dynamic evaluation parameter to obtain a user priority coefficient of the target user;
a second calculation module 920, configured to generate a production scheduling work order according to the user order of the target user, and calculate the production scheduling work order to obtain a dispatch priority;
and the production scheduling module 930 is configured to calculate the user priority coefficient and the dispatch priority to obtain a target priority, and dispatch the production scheduling worksheet according to the target priority.
In an exemplary embodiment of the present invention, the calculating the dynamic evaluation parameter to obtain the user priority coefficient of the target user includes:
normalizing the dynamic evaluation parameters to obtain target evaluation parameters, and calculating the target evaluation parameters to obtain user scores;
and adjusting the user score to obtain a target score, so as to determine the target score as a user priority coefficient of the target user.
In an exemplary embodiment of the present invention, the generating a production schedule work order according to a user order of the target user includes:
acquiring a user order of the target user, and acquiring a production subject and a destination address related in the user order;
generating a production scheduling work order corresponding to the user order according to the production main body; and/or
And generating a production scheduling work order corresponding to the user order according to the destination address.
In an exemplary embodiment of the present invention, the calculating the production schedule worksheet to obtain the dispatch priority includes:
acquiring the work order type of the production scheduling work order, and determining the front work order number of the production scheduling work order according to the work order type;
and acquiring preset parameters corresponding to the work order types, and calculating the preset parameters and the preposed work order numbers to obtain the order sending priority.
In an exemplary embodiment of the present invention, the work order type includes: communication type product worksheets, cloud application type product worksheets, entity type product worksheets, service type product worksheets and rights and interests type product worksheets.
In an exemplary embodiment of the present invention, the dispatching the production scheduling worksheet according to the target priority includes:
Sorting the target priority to obtain a sorting result;
and dispatching the production scheduling worksheets according to the sequencing result.
In an exemplary embodiment of the present invention, the dispatching the production scheduling worksheet according to the sorting result includes:
based on the sorting result, performing a first round of dispatch on the production scheduling worksheets with the dispatch priority same as a preset parameter;
based on the sorting result, performing a second round of dispatch of the production scheduling worksheets with the worksheets of the communication type product worksheets;
and based on the sorting result, performing third dispatch on the production scheduling worksheet of which the worksheet type is the service product worksheet.
The specific details of the production scheduling apparatus 900 are described in detail in the corresponding production scheduling method, and thus are not described herein.
It should be noted that although several modules or units of the production scheduling device 900 are mentioned in the above detailed description, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
An electronic device 1000 according to such an embodiment of the invention is described below with reference to fig. 10. The electronic device 1000 shown in fig. 10 is merely an example and should not be construed as limiting the functionality and scope of use of embodiments of the present invention.
As shown in fig. 10, the electronic device 1000 is embodied in the form of a general purpose computing device. Components of electronic device 1000 may include, but are not limited to: the at least one processing unit 1010, the at least one memory unit 1020, a bus 1030 connecting the various system components (including the memory unit 1020 and the processing unit 1010), and a display unit 1040.
Wherein the storage unit stores program code that is executable by the processing unit 1010 such that the processing unit 1010 performs steps according to various exemplary embodiments of the present invention described in the above section of the "exemplary method" of the present specification.
The memory unit 1020 may include readable media in the form of volatile memory units such as Random Access Memory (RAM) 1021 and/or cache memory unit 1022, and may further include Read Only Memory (ROM) 1023.
Storage unit 1020 may also include a program/utility 1024 having a set (at least one) of program modules 1025, such program modules 1025 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
Bus 1030 may be representing one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 1000 can also communicate with one or more external devices 1200 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 1000, and/or with any device (e.g., router, modem, etc.) that enables the electronic device 1000 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 1050. Also, electronic device 1000 can communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 1060. As shown, the network adapter 1060 communicates with other modules of the electronic device 1000 over the bus 1030. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with the electronic device 1000, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, and includes several instructions to cause a computing device (may be a personal computer, a server, a terminal device, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, a computer-readable storage medium having stored thereon a program product capable of implementing the method described above in the present specification is also provided. In some possible embodiments, the various aspects of the invention may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the invention as described in the "exemplary methods" section of this specification, when said program product is run on the terminal device.
Referring to fig. 11, a program product 1100 for implementing the above-described method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (8)
1. A method of production scheduling, the method comprising:
acquiring dynamic evaluation parameters of a target user, and calculating the dynamic evaluation parameters based on a dynamic evaluation model RFMA to obtain a user priority coefficient of the target user; wherein R is the last consumption, F is the consumption frequency, M is the total consumption amount, and A is the average consumption amount;
the calculating the dynamic evaluation parameter based on the dynamic evaluation model RFMA to obtain the user priority coefficient of the target user includes: normalizing the dynamic evaluation parameters to obtain target evaluation parameters, and calculating the target evaluation parameters to obtain user scores; adjusting the user score to obtain a target score, so as to determine the target score as a user priority coefficient of the target user;
Calculating the target evaluation parameters based on the following formula to obtain user scores: user score = R '×a+f' ×b+m '×c+a' ×d; wherein, R 'is the target evaluation parameter corresponding to R, F' is the target evaluation parameter corresponding to F, M 'is the target evaluation parameter corresponding to M, A' is the target evaluation parameter corresponding to A, a, b, c, d is a preset weight coefficient;
the step of adjusting the user score to obtain a target score comprises the following steps: determining the target score according to the difference between the designated parameter and the user score;
generating a production scheduling work order according to the user order of the target user, and calculating the production scheduling work order to obtain a dispatching priority; the step of calculating the production scheduling worksheet to obtain the dispatching priority comprises the following steps: acquiring the work order type of the production scheduling work order, and determining the front work order number of the production scheduling work order according to the work order type; acquiring preset parameters corresponding to the work order types, and calculating the preset parameters and the prepositioned work order to obtain the order-dispatching priority; the front work order number is the work order number which is required to finish construction before the production scheduling work order is dispatched;
After the preset parameters corresponding to the work order types are acquired, the preset parameters and the front work order numbers are calculated based on the following formula to obtain the order sending priority: opij=1+nroij; wherein OPij is the order-dispatching priority corresponding to the j-th production scheduling work order of the i-th client, 1 is the preset parameter, and NROij is the front-end work order corresponding to the j-th production scheduling work order of the i-th client;
and calculating the user priority coefficient and the dispatch priority to obtain a target priority, and dispatching the production scheduling worksheet according to the target priority.
2. The production scheduling method of claim 1, wherein the generating a production scheduling job ticket from the user order of the target user comprises:
acquiring a user order of the target user, and acquiring a production subject and a destination address related in the user order;
generating a production scheduling work order corresponding to the user order according to the production main body; and/or
And generating a production scheduling work order corresponding to the user order according to the destination address.
3. The production scheduling method of claim 1, wherein the work order type comprises: communication type product worksheets, cloud application type product worksheets, entity type product worksheets, service type product worksheets and rights and interests type product worksheets.
4. The method of claim 3, wherein dispatching the production scheduling worksheet according to the target priority comprises:
sorting the target priority to obtain a sorting result;
and dispatching the production scheduling worksheets according to the sequencing result.
5. The method of claim 4, wherein dispatching the production scheduling worksheets according to the sorting result comprises:
based on the sorting result, performing a first round of dispatch on the production scheduling worksheets with the dispatch priority same as a preset parameter;
based on the sorting result, performing a second round of dispatch of the production scheduling worksheets with the worksheets of the communication type product worksheets;
and based on the sorting result, performing third dispatch on the production scheduling worksheet of which the worksheet type is the service product worksheet.
6. A production scheduling apparatus, comprising:
the first calculation module is configured to acquire dynamic evaluation parameters of a target user, and calculate the dynamic evaluation parameters based on a dynamic evaluation model RFMA to acquire a user priority coefficient of the target user; the dynamic evaluation parameters comprise the latest consumption, the consumption frequency, the total consumption amount and the average consumption amount; wherein R is the last consumption, F is the consumption frequency, M is the total consumption amount, and A is the average consumption amount;
The calculating the dynamic evaluation parameter based on the dynamic evaluation model RFMA to obtain the user priority coefficient of the target user includes: normalizing the dynamic evaluation parameters to obtain target evaluation parameters, and calculating the target evaluation parameters to obtain user scores; adjusting the user score to obtain a target score, so as to determine the target score as a user priority coefficient of the target user;
calculating the target evaluation parameters based on the following formula to obtain user scores: user score = R '×a+f' ×b+m '×c+a' ×d; wherein, R 'is the target evaluation parameter corresponding to R, F' is the target evaluation parameter corresponding to F, M 'is the target evaluation parameter corresponding to M, A' is the target evaluation parameter corresponding to A, a, b, c, d is a preset weight coefficient;
the step of adjusting the user score to obtain a target score comprises the following steps: determining the target score according to the difference between the designated parameter and the user score;
the second calculation module is configured to generate a production scheduling work order according to the user order of the target user, and calculate the production scheduling work order to obtain a dispatch priority; the step of calculating the production scheduling worksheet to obtain the dispatching priority comprises the following steps: acquiring the work order type of the production scheduling work order, and determining the front work order number of the production scheduling work order according to the work order type; acquiring preset parameters corresponding to the work order types, and calculating the preset parameters and the prepositioned work order to obtain the order-dispatching priority; the front work order number is the work order number which is required to finish construction before the production scheduling work order is dispatched;
After the preset parameters corresponding to the work order types are acquired, the preset parameters and the front work order numbers are calculated based on the following formula to obtain the order sending priority: opij=1+nroij; wherein OPij is the order-dispatching priority corresponding to the j-th production scheduling work order of the i-th client, 1 is the preset parameter, and NROij is the front-end work order corresponding to the j-th production scheduling work order of the i-th client;
and the production scheduling module is configured to calculate the user priority coefficient and the dispatch priority to obtain a target priority, and dispatch the production scheduling worksheet according to the target priority.
7. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the production scheduling method of any one of claims 1-5.
8. An electronic device, comprising:
a processor;
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the production scheduling method of any one of claims 1-5 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210772014.XA CN115032957B (en) | 2022-06-30 | 2022-06-30 | Production scheduling method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210772014.XA CN115032957B (en) | 2022-06-30 | 2022-06-30 | Production scheduling method and device, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115032957A CN115032957A (en) | 2022-09-09 |
| CN115032957B true CN115032957B (en) | 2024-02-06 |
Family
ID=83129188
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210772014.XA Active CN115032957B (en) | 2022-06-30 | 2022-06-30 | Production scheduling method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115032957B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104361482A (en) * | 2014-12-09 | 2015-02-18 | 北京京东尚科信息技术有限公司 | Method and system for distributing orders to storehouse |
| CN107944695A (en) * | 2017-11-21 | 2018-04-20 | 电子科技大学 | One kind is based on the probabilistic chaining key setting buffers method of production |
| CN112508309A (en) * | 2021-01-29 | 2021-03-16 | 深圳坤湛科技有限公司 | Intelligent scheduling method, equipment and computer storage medium |
| CN113706240A (en) * | 2021-08-18 | 2021-11-26 | 上海明略人工智能(集团)有限公司 | Order sorting method and device, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6941514B2 (en) * | 2001-04-30 | 2005-09-06 | Bellsouth Intellectual Property Corporation | System and method for priority-based work order scheduling |
-
2022
- 2022-06-30 CN CN202210772014.XA patent/CN115032957B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104361482A (en) * | 2014-12-09 | 2015-02-18 | 北京京东尚科信息技术有限公司 | Method and system for distributing orders to storehouse |
| CN107944695A (en) * | 2017-11-21 | 2018-04-20 | 电子科技大学 | One kind is based on the probabilistic chaining key setting buffers method of production |
| CN112508309A (en) * | 2021-01-29 | 2021-03-16 | 深圳坤湛科技有限公司 | Intelligent scheduling method, equipment and computer storage medium |
| CN113706240A (en) * | 2021-08-18 | 2021-11-26 | 上海明略人工智能(集团)有限公司 | Order sorting method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115032957A (en) | 2022-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7761548B2 (en) | Dynamic server consolidation and rationalization modeling tool | |
| CN108446975B (en) | Quota management method and device | |
| JP5677967B2 (en) | Specification, estimation, causal driver discovery and market response elasticity or lift coefficient automation | |
| US8374912B2 (en) | System and method for managing and optimizing advertising campaigns managed on the internet | |
| US20070133781A1 (en) | Method and system for automatic assignment of work units to agents | |
| CN109324905A (en) | Database operation method, device, electronic equipment and storage medium | |
| CN110458410A (en) | A kind of method and apparatus of task distribution | |
| CN110489556A (en) | Quality evaluating method, device, server and storage medium about follow-up record | |
| CN114819769A (en) | Slicing processing method and system for IT service task | |
| US8494895B1 (en) | Platform maturity analysis system | |
| US20090254395A1 (en) | Systems and methods for optimizing market selection for entity operations location | |
| Wu et al. | Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach | |
| CN112860672A (en) | Method and device for determining label weight | |
| CN115032957B (en) | Production scheduling method and device, storage medium and electronic equipment | |
| JP2007272722A (en) | Method and system for analyzing set-up of branch office | |
| Li et al. | Learning to bundle proactively for on-demand meal delivery | |
| CN116011863A (en) | Network point service evaluation system and method | |
| KR20110045220A (en) | System and method for valuation of trading area condition in SOHO | |
| CN115423305A (en) | IT service management method and device and server | |
| CN113962588A (en) | Self-picking point addressing method, system, medium, equipment and terminal | |
| CN114282881A (en) | Depreciation measuring and calculating method and device, storage medium and computer equipment | |
| KR20180082214A (en) | Risk value evaluating system for unclaimed construction and risk value evaluating apparatus for unclaimed construction | |
| CN113205391A (en) | Historical order matching degree based order dispatching method, electronic equipment and computer readable medium | |
| US20180052814A1 (en) | Integrated tool for work intake | |
| CN111598516B (en) | Post site selection method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |