CN115032957A

CN115032957A - Production scheduling method and device, storage medium and electronic equipment

Info

Publication number: CN115032957A
Application number: CN202210772014.XA
Authority: CN
Inventors: 钱文胜; 陈海龙; 王文治; 潘波; 王胤丰
Original assignee: China Telecom Corp Ltd
Current assignee: China Telecom Corp Ltd
Priority date: 2022-06-30
Filing date: 2022-06-30
Publication date: 2022-09-09
Anticipated expiration: 2042-06-30
Also published as: CN115032957B

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 an order dispatching priority; and calculating the user priority coefficient and the dispatching priority to obtain a target priority, and dispatching the production scheduling work order according to the target priority. The method provides two aspects of data support and corresponding theoretical basis for determining the order dispatching sequence, provides an automatic, parallelization, differentiation and optimized production resource comprehensive scheduling mode, optimizes the production resource scheduling effect, improves the real-time performance and accuracy of production scheduling, achieves the effect of rapidly delivering multiple products to customers, improves the satisfaction degree of users and improves the user reflux degree.

Description

Production scheduling method and device, storage medium and electronic equipment

Technical Field

The present disclosure relates to the field of production control technologies, and in particular, to a production scheduling method, a production scheduling apparatus, a computer-readable storage medium, and an electronic device.

Background

With the national major decision deployment of digital transformation, "service middlebox + data middlebox" has become the core mode for large enterprises to develop digital transformation, which is called "dual-middlebox" mode for short.

In the face of products with different values and different production processes, how to efficiently schedule production resources, provide production opening services with different priorities, quickly deliver the production opening services to customers and realize high output of enterprises is one of the core problems to be solved in business.

In view of this, there is a need in the art to develop a new production scheduling method and apparatus.

It is to be noted that the information disclosed in the above background section is only for enhancement of 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 present disclosure is directed to a production scheduling method, a production scheduling apparatus, a computer-readable storage medium, and an electronic device, so as to overcome the technical problem of poor resource scheduling effect due to the limitations of the related art at least to some extent.

Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.

According to a first aspect of the embodiments of the present invention, there is provided a production scheduling 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 dispatching 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 the user priority coefficient of the target user.

In an exemplary embodiment of the present invention, the generating a production scheduling work order according to the user order of the target user includes:

acquiring a user order of the target user, and acquiring a production main body 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 scheduling work order to obtain an order dispatch priority includes:

acquiring the work order type of the production scheduling work order, and determining the preposed work number of the production scheduling work order according to the work order type;

and acquiring a preset parameter corresponding to the work order type, and calculating the preset parameter and the preset work order number to obtain an order dispatching priority.

In an exemplary embodiment of the invention, the work order type includes: the system comprises a communication product work order, a cloud application product work order, an entity product work order, a service product work order and a rights and interests product work order.

In an exemplary embodiment of the present invention, the dispatching the production scheduling work order according to the target priority includes:

sequencing the target priority to obtain a sequencing result;

and dispatching the production scheduling work order according to the sequencing result.

In an exemplary embodiment of the present invention, the dispatching the production scheduling work order according to the sorting result includes:

performing a first round of dispatching on the production scheduling work order with the dispatching priority same as a preset parameter based on the sequencing result;

performing a second round of dispatching on the production scheduling work order of which the work order type is the communication product work order based on the sequencing result;

and performing a third dispatching order on the production scheduling work order with the work order type as the service product work order based on the sequencing result.

According to a second aspect of the embodiments 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 obtain 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 an order dispatching priority;

and the production scheduling module is configured to calculate the user priority coefficient and the dispatching priority to obtain a target priority, and dispatching the production scheduling work order according to the target priority.

According to a third aspect of embodiments 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 in any of the exemplary embodiments described above.

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 foregoing technical solutions, the production scheduling method, the production scheduling apparatus, 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 order dispatching priority can be obtained by respectively calculating the dynamic evaluation work order and the production scheduling work order, and two-aspect data support and corresponding theoretical basis are provided for determining the order dispatching sequence. Furthermore, the user priority coefficient and the order dispatching priority are calculated to obtain the target priority for dispatching the order, an automatic, parallelized, differentiated and optimized production resource comprehensive dispatching mode is provided, the production resource dispatching effect is optimized, the real-time performance and accuracy of production dispatching are improved, the effect of rapidly delivering multiple products to customers 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 present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.

FIG. 1 schematically illustrates a flow diagram of a production scheduling method in an exemplary embodiment of the present disclosure;

FIG. 2 schematically illustrates a flow chart of a method of calculating a user priority coefficient in an exemplary embodiment of the disclosure;

FIG. 3 schematically illustrates a flow chart of a method of generating a production scheduling work order in an exemplary embodiment of the disclosure;

FIG. 4 schematically illustrates a flow chart of a method of calculating a dispatch priority in an exemplary embodiment of the disclosure;

FIG. 5 schematically illustrates a flow chart of a method of dispatching orders by target priority in an exemplary embodiment of the disclosure;

FIG. 6 schematically illustrates a flow chart of a method of further target priority ordering in an exemplary embodiment of the disclosure;

FIG. 7 is a diagram schematically illustrating a scheduling model architecture of a production scheduling method in an application scenario in an exemplary embodiment of the present disclosure;

FIG. 8 is a flow chart diagram schematically illustrating a production scheduling method in an application scenario according to an exemplary embodiment of the disclosure;

fig. 9 schematically illustrates a schematic structural diagram 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. Example embodiments may, however, be embodied in many different 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 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 disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. 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/parts/etc.; the terms "comprising" and "having" are intended to be inclusive and mean that there may be additional elements/components/etc. other than the listed elements/components/etc.; the terms "first" and "second", etc. are used merely as labels, and are not limiting on 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 their repetitive description 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 order to solve the problems in the related art, the present disclosure provides a production scheduling method. Fig. 1 shows a flow chart of a production scheduling method, as shown in fig. 1, the production scheduling method at least includes the following steps:

and 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 order dispatching priority.

And S130, calculating the user priority coefficient and the order dispatching priority to obtain a target priority, and dispatching the production scheduling work order according to the target priority.

In the exemplary embodiment of the disclosure, through the calculation of the dynamic evaluation work order and the production scheduling work order, the user priority coefficient and the dispatching priority can be obtained, and two-aspect data support and a corresponding theoretical basis are provided for the determination of the dispatching sequence. Furthermore, the user priority coefficient and the order dispatching priority are calculated to obtain the target priority for dispatching the order, an automatic, parallelized, differentiated and optimized production resource comprehensive dispatching mode is provided, the production resource dispatching effect is optimized, the real-time performance and accuracy of production dispatching are improved, the effect of rapidly delivering multiple products to customers is achieved, the user service experience and satisfaction are improved, and the user reflux degree is further improved.

Each step of the production scheduling method is explained in detail below.

In step S110, a dynamic evaluation parameter of the target user is obtained, and the 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 a lot of digital products, including a communication class, a cloud application class, a material class, a service class, a rights class, and the like, and further subdivided products are many.

Based on the nationwide centralized service middlings, the flow of customers is large, and the products are ordered more, so that how to rapidly produce and open the products and deliver the products to the users is very important. Therefore, the comprehensive scheduling of production resources becomes a focus problem. The production resources comprise all resources such as networks, systems, platforms, real objects, vehicles and personnel related to the production process of the product.

Further, the evaluation may be performed based on a dynamic evaluation model RFMA (Recency, Frequency, monetry, Average), and therefore, a dynamic evaluation parameter corresponding to the dynamic evaluation model RFMA may be obtained first.

The dynamic evaluation parameters may include last consumption (Recency), consumption Frequency (Frequency), total consumption amount (money), and Average consumption amount (Average), among others.

Specifically, the last consumption refers to the time of the last purchase, which is used to measure loyalty and can be expressed as R value; the consumption frequency refers to the number of times of purchase in a limited time, is used for measuring the activity and can be expressed as an F value; the total consumption amount refers to the amount spent in a limited time and is used for measuring the contribution degree and can be expressed as an M value, the average consumption amount refers to the amount spent in an order in a limited time (namely M/F) and is used for measuring the average contribution degree of the order of the user and can be expressed as an A value.

Furthermore, the obtained dynamic evaluation parameters can 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, and as shown in fig. 2, the method may include at least the following steps: in step S210, the dynamic evaluation parameter is normalized to obtain a target evaluation parameter, and the target evaluation parameter is calculated to obtain a user score.

Based on the dynamic assessment model RFMA, a customer Score (Score) calculation model is first proposed, that is, customer Score (Score) [ T0- (D-R) ] + a + F + b + M + c + a ×.d.

Where a is 0.2, b is 0.3, c is 0.4, and d is 0.1, and in actual operation, a, b, c, and d may be fine-tuned. T0 is a defined time, which characterizes the statistical period, and can be calculated according to 365 days when the statistical period is 1 year. 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 is M/F.

The user scores are evaluation values of user value and profit-making capability, and can be ranked from large to small according to the user scores to obtain a user priority coefficient of the target user.

However, since R is time, F is frequency, and M is amount, which do not belong to the same measurement dimension, there is a possibility that some values are large and some values are small. To exploit the value of each dimension to the user score, R, M, F, A may be normalized first using the "X' ═ X-Xmin)/(Xmax-Xmin" mode.

Specifically, if R ═ T0- (D-R) ], rmin ═ 0, rmax ═ T0 is set, 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 achieved by inquiring a database, respectively counting F, M, A values of all users in a T0 period, and then solving the maximum value and the minimum value.

Thus, the user scores (Score) R '× a + F' × b + M '× c + a' × d.

Wherein a is 0.2, b is 0.3, c is 0.4, d is 0.1, R ', F', M ', a' are 0 and 1; then the user Score (Score) is also a number > 0 and < 1, and the larger the number, the higher the priority of the customer.

In step S220, the user score is adjusted to obtain a target score, so as to determine the target score as the user priority coefficient of the target user.

In order to adapt to the sequencing logic of the subsequent production scheduling work order dispatching priority, the user score needs to be adjusted to be logic with a smaller numerical value and a higher user priority.

Thus, a "1-" treatment may be performed on the user score. That is, the target score is 1- (R '. a + F'. b + M '. c + a'. d).

At this time, the smaller the target score, the higher the customer priority.

User scoring in the "1-" mode will result in C1 for all customers (customers) that generate orders within a time period t, e.g., 10 minutes: s1, C2: s2, C3: s3.. wherein Ci represents the ith customer, Si represents the score of Ci, 0 ═ Si < (1, i ═ 1, 2..

Therefore, the target score Si can be determined as a user priority coefficient of the target user, and then, the smaller the coefficient, the higher the priority of the user.

In the exemplary embodiment, the corresponding user priority coefficient is obtained by calculating the obtained dynamic evaluation parameters, a user score calculation model based on a dynamic evaluation model is provided, a data basis is provided for determining a final target priority coefficient, and the accuracy and the real-time performance of production scheduling are further guaranteed.

In step S120, a production scheduling work order is generated according to the user order of the target user, and the production scheduling work order is calculated to obtain an order dispatching priority.

In an exemplary embodiment of the present disclosure, user orders for target users may be collected to generate corresponding production scheduling work orders.

In an alternative embodiment, fig. 3 shows a flow diagram of a method for generating a production scheduling work order, which may include at least the following steps, as shown in fig. 3: 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.

User orders for all target users within a time period t, e.g., 10 minutes, are aggregated up to the current time.

In addition, in order to generate the production scheduling work order, the production main body and the destination address related in all the user orders can be obtained.

Wherein, the production subject is a subject providing a corresponding product, and the destination address is an address to which the product needs to be provided.

In step S320, a production scheduling work order corresponding to the user order is generated according to the production agent.

And correspondingly generating a production scheduling work order according to the production main body 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 scheduling work order corresponding to the user order is generated according to the destination address.

When a user order contains products with different destination addresses, the user order can be divided into sub-orders with different addresses of 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 orders contain products with different destination addresses, the orders 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 according to the identity correspondence of the product type and the production main body aiming at each user order.

In the exemplary embodiment, a production scheduling work order is generated through the obtained production main body and destination address in the user order, and data support and a theoretical basis are provided for calculating the order dispatching priority.

After the production scheduling work order is generated, the production scheduling work order may be calculated to obtain a dispatch priority.

In an alternative embodiment, fig. 4 shows a flow chart of a method for calculating a dispatch priority, which, as shown in fig. 4, may at least include the following steps: in step S410, the work order type of the production scheduling work order is obtained, and the lead work order number of the production scheduling work order is determined according to the work order type.

In an alternative embodiment, the work order types include: the system comprises a communication product work order, a cloud application product work order, an entity product work order, a service product work order and a rights and interests product work order.

The communication product work order can be a maintenance team and a management system to develop network resource or parameter configuration and the like; the cloud application product work order can be used for a maintenance team and a management system to carry out cloud platform resource or parameter configuration, application deployment and the like; the entity product work order can be the physical goods delivered to the goods by the logistics company; the service product work order can be installation, system integration or maintenance service carried out by a maintenance worker; the equity product work order may be an equity platform enabled coupon, discount, etc. configuration.

The jth production scheduling Work Order (Work Order, WOij) Order Priority (OP) of the ith client is marked as OPij; the Number of work orders (Number of retrieved Order) that must be constructed before the production scheduling work Order is dispatched is recorded as NROij, and a calculation model of the dispatching priority structure matrix is constructed and is shown in Table 1:

TABLE 1

A yes or no determination is made for each production scheduling work order. Specifically, a "yes" is 1, and a "no" is 0. The home-visit service work order depends on the completion of the current network configuration work order and the material distribution work order.

In step S420, a preset parameter corresponding to the work order type is obtained, and the preset parameter and the number of the pre-processed work orders are calculated to obtain an order dispatching priority.

For the cloud application service work order, the construction of the broadband service work order is also completed, so the calculation model is further summarized as follows: OPij ═ 1+ NROij. Wherein 1 is a preset parameter.

For example, the client Ci is to open a broadband service and a video monitoring service. The broadband service is opened by three production scheduling work orders, namely a broadband product current network configuration work order, a broadband terminal logistics distribution work order and a broadband home-entry installation service work order. The broadband home-entry installation service work order is completed by depending on the construction of the current network configuration work order and the logistics distribution work order, and then the order dispatching priorities of the three production scheduling work orders with the broadband service opened are respectively as follows: OPi1 ═ 1, OPi2 ═ 1, and OPi3 ═ 1+2 ═ 3.

Three production scheduling work orders are needed for video monitoring service fulfillment, namely a video monitoring platform configuration work order, a video terminal logistics distribution work order and a video monitoring home-mounted service work order. The video monitoring home-in installation service work order is not only dependent on the construction completion of the video platform configuration work order and the logistics distribution work order, but also dependent on the construction completion of the broadband home-in installation service work order, so the order dispatching priorities of three production scheduling work orders opened by video monitoring services are respectively as follows: OPi4 ═ 1, OPi5 ═ 1, and OPi6 ═ 1+3 ═ 4.

In the exemplary embodiment, the corresponding dispatching priority can be obtained by calculating the production scheduling work order, a data basis is provided for determining the final target priority coefficient, and the accuracy and the real-time performance of production scheduling are further guaranteed.

In step S130, the user priority coefficient and the order dispatching priority are calculated to obtain a target priority, and the production scheduling work order is dispatched according to the target priority.

To determine the final dispatch Priority (LOP), a computational model may be constructed from the user Priority coefficient and the dispatch Priority, which may be as shown in table 2:

TABLE 2

That is, the final dispatch priority of the jth production dispatch job order of customer Ci, i.e., the target priority LOPij ═ OPij × Si. Where Si is the client priority coefficient and OPij is the order priority.

It should be noted that different production scheduling work orders (including work orders at different addresses) under the same user share one client priority coefficient.

After the target priority is calculated, the production scheduling work order may be dispatched according to the target priority.

In an alternative embodiment, fig. 5 shows a flow chart of a method for dispatching orders according to target priority, as shown in fig. 5, the method may at least include the following steps: in step S510, the target priorities are sorted to obtain a sorting result.

In order to be able to dispatch in a small to large manner according to the target priority, the target priority may be sorted to obtain a corresponding sorting result.

In step S520, the production scheduling work order is dispatched according to the sorting result.

In an alternative embodiment, fig. 6 shows a flow diagram of a method for further ordering according to target priority, as shown in fig. 6, the method may at least include the following steps: in step S610, based on the sorting result, a first round of dispatching is performed on the production scheduling work order with the same dispatching priority as the preset parameter.

For the production scheduling work order with the order priority OPij equal to 1, that is, the preset parameter, the production scheduling work orders may be ordered in sequence according to the order from small to large of the target priority LOPij in the ordering result.

In step S620, based on the sorting result, a second round of dispatching is performed on the production scheduling work order whose work order type is the communication product work order.

The second round of dispatch mainly targets communication service class product work orders. When there is no communication service class product work order, the second round of orders may be skipped.

Specifically, after the work order of the broadband product and the work order of the physical product are constructed and the receipt is finished, the work order of the broadband service product is sent; other communication service product work orders which have binding relation with the broadband service, such as VOIP (Voice over Internet Protocol) service, are dispatched synchronously with the broadband service product work order; other communication service product work orders which are not bound with the broadband service, such as digital circuit, IDC (Internet Data Center) and other services, are dispatched in sequence from small to large according to LOPij.

In step S630, based on the sorting result, a third round of dispatching is performed on the production scheduling work order whose work order type is the service type product work order.

The third dispatch mainly aims at the service product work order depending on the broadband service opening.

Specifically, after the cloud application type product work order, the physical product work order construction and the broadband service opening receipt are completed, the cloud application type service product work orders are sequentially dispatched from small to large according to the LOPij.

In the exemplary embodiment of the disclosure, three orders are dispatched according to the determined target priority, and the dispatching logic of different product work orders can be strictly followed, so that the technical problem of accurate dispatching of limited resources is effectively solved, and the user experience and the product satisfaction are improved.

The following describes the production scheduling method in the embodiment of the present disclosure in detail with reference to an application scenario.

Fig. 7 is 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 a lot of 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, a subdivided product is numerous.

Fig. 8 shows a flow diagram of a production scheduling method in an application scenario, and as shown in fig. 8, by the current time, within a limited time period T0 (which may be 365 days per 1 year), based on historical accumulated data of all customers, a database is queried to statistically determine F, M, A maximum and minimum values, i.e., Fmax, Fmin, Mmax, Mmin, Amax, Amin.

By the current time, all customer orders within a time period t, e.g., 10 minutes, are aggregated.

Further, the client value and the profit creating capability are dynamically evaluated for all clients in the time period t.

Specifically, all customer names are extracted from all user orders and may be denoted as C1, C2. Then, the client center database is queried, and R, F, M, A values for each client, i.e., Ri, Fi, Mi, Ai values of client Ci, i.e., 1, 2.

Based on the dynamic evaluation model RFMA, a customer Score calculation model, i.e., customer Score (Score) [ T0- (D-R) ]. + a + F × b + M × c + a × D, is first proposed. In actual operation, a, b, c and D may also be fine-tuned, T0 is a limited time, a statistical period is characterized, when the statistical period is 1 year, it may be calculated according to 365 days, D is the current time, D-R is the number of days, R, M, F may be counted by querying a database, and a is M/F.

However, since R is time, F is frequency, and M is amount, which do not belong to the same measurement dimension, there is a possibility that some values are large and some values are small. In order to exploit the value of each dimension to the user score, R, M, F, A can be normalized first using the pattern of "X ═ X-Xmin)/(Xmax-Xmin".

The calculation of the maximum value and the minimum value of F, M and A can be realized by respectively counting the F, M, A values of all users in the T0 period by querying a database, and then calculating the maximum value and the minimum value.

Thus, the user scores (Score) R '× a + F' × b + M '× c + a' × d.

Wherein a is 0.2, b is 0.3, c is 0.4, d is 0.1, R ', F', M ', a' are all 0 and 1; then the user Score (Score) is also a number > 0 and < 1, and the larger the number, the higher the priority of the customer.

Thus, the user score may be processed "1-". That is, the target score is 1- (R '. a + F'. b + M '. c + a'. d).

At this time, the smaller the target score, the higher the customer priority.

User scoring in the "1-" mode will result in C1 for all customers (customers) that generate orders within a time period t, e.g., 10 minutes: s1, C2: s2, C3: s3.. wherein Ci represents the ith customer, Si represents the score of Ci, 0 ═ Si < (1), i ═ 1, 2.

On the other hand, a dispatch priority calculation (OP) is performed on the production scheduling work orders for the m customers.

If the customer order contains products with different addresses, the products are split into orders with different addresses of the same customer by taking the destination address as a unit.

For each customer order, a production scheduling work order is correspondingly generated according to the identity of the product type and the production subject, i.e., WOij, i is 1, 2.

And calculating the priority of each work order according to the work order priority structure matrix calculation model, namely OPij is 1+ NROij, NROij is the number of work orders which must finish construction before the work order is dispatched, i is 1,2, and.

A final dispatch priority calculation is performed on the production scheduling worksheets of the m customers, i.e., LOPij OPij Si, i1, 2.

And further, dispatching according to the production dispatching work order.

For the production scheduling work order with the order priority OPij equal to 1, that is, the preset parameters, the production scheduling work orders can be ordered in sequence according to the order from small to large of the target priority LOPij in the ordering result.

Specifically, after the work order of the broadband product and the work order of the physical product are constructed and the receipt is finished, the work order of the broadband service product is sent; other communication service product work orders which have binding relation with the broadband service, such as VOIP service, are sent in synchronization with the broadband service product work order; and other communication service product work orders which are not bound with the broadband service, such as digital circuit, IDC and other services, are dispatched in sequence from small to large according to LOPij.

The third dispatch sheet mainly aims at the service product work sheet which is opened by the broadband service.

And finally, after receiving the construction receipt of each production subject, the comprehensive scheduling center updates the production scheduling worksheet pool in time and prepares to dispatch the worksheet again until the dispatching is completed.

Within time period t, all production scheduling work orders for all customers form a work order pool. Whether the construction of the front work order is finished and the order is returned is synchronously considered while the orders are sequentially dispatched according to the final order dispatching priority, so that the automation, the parallelization and the differentiation processing of production dispatching are realized, the quick delivery is carried out to the client, and the income of the enterprise is instantly maximized.

In the production scheduling method under the application scene, the user priority coefficient and the order dispatching priority can be obtained by respectively calculating the dynamic evaluation work order and the production scheduling work order, and two aspects of data support and corresponding theoretical basis are provided for determining the order dispatching sequence. Furthermore, the user priority coefficient and the order dispatching priority are calculated to obtain the target priority for dispatching the order, an automatic, parallelized, differentiated and optimized production resource comprehensive dispatching mode is provided, the production resource dispatching effect is optimized, the real-time performance and accuracy of production dispatching are improved, the effect of rapidly delivering multiple products to customers 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, production resource comprehensive scheduling can be orderly implemented based on nationwide centralized service middleboxes aiming at product orders of different graded customers, different services and different production processes, the production resource comprehensive scheduling comprises a network, a system, a platform, a real object, a vehicle, personnel and the like, production opening graded service is provided, rapid delivery to customers is realized, high-value customers are ensured to obtain product opening preferentially, and the problem of how to service limited resources to the high-value customers preferentially is effectively solved. 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 apparatus, and as shown in fig. 9, the production scheduling apparatus 900 may include: a first calculation module 910, a second calculation module 920, and a production scheduling module 930. Wherein:

a first calculating 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 calculating 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 an order dispatching priority;

the production scheduling module 930 is configured to calculate the user priority coefficient and the dispatching priority to obtain a target priority, and dispatch the production scheduling work order according to the target priority.

sequencing the target priority to obtain a sequencing result;

The details of the production scheduling apparatus 900 are already described in detail in the corresponding production scheduling method, and therefore are not described herein again.

It should be noted that although in the above detailed description several modules or units of the production scheduling device 900 are mentioned, 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, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

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 only an example, and should not bring any limitation to the functions and the scope of use of the 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. The components of the 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 different 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 to cause the processing unit 1010 to perform steps according to various exemplary embodiments of the present invention as described in the "exemplary methods" section above in this specification.

The memory unit 1020 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)1021 and/or a cache memory unit 1022, and may further include a read-only memory unit (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 of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 1030 may be any 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, and a local bus using any of a variety of bus architectures.

The electronic device 1000 may 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 devices (e.g., router, modem, etc.) that enable the electronic device 1000 to communicate with one or more other computing devices. Such communication may occur through input/output (I/O) interfaces 1050. Also, the electronic device 1000 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 1060. As shown, the network adapter 1060 communicates with the 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 conjunction with the electronic device 1000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, to name a few.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, 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 (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above section "exemplary method" of this description, when said program product is run on the terminal device.

Referring to fig. 11, a program product 1100 for implementing the above 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 in this regard and, in the present 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. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. 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 thereof. A readable signal medium may 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 for aspects 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 and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, 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., through 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 variations, 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

1. A method for production scheduling, the method comprising:

2. The production scheduling method according to claim 1, wherein the calculating the dynamic evaluation parameter to obtain the user priority coefficient of the target user comprises:

3. The production scheduling method of claim 1, wherein the generating a production scheduling work order according to the user order of the target user comprises:

4. The production scheduling method of claim 1, wherein the calculating the production scheduling work order to obtain an order dispatching priority comprises:

5. The production scheduling method of claim 4, wherein the work order type comprises: the system comprises a communication product work order, a cloud application product work order, an entity product work order, a service product work order and a rights and interests product work order.

6. The production scheduling method of claim 5, wherein said dispatching said production scheduling work order according to said target priority comprises:

sorting the target priorities to obtain a sorting result;

7. The production scheduling method of claim 6, wherein said dispatching said production scheduling work order according to said sorting result comprises:

and performing a third dispatching order on the production scheduling work order with the work order type as the service type product work order based on the sequencing result.

8. A production scheduling apparatus, comprising:

9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the production scheduling method according to any one of claims 1 to 7.

10. 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-7 via execution of the executable instructions.