Method for determining a manufacturing task allocation scheme, computing device and storage medium

Abstract

The application provides a method for determining a manufacturing task allocation scheme, a computing device and a storage medium. The method comprises the following steps: determining at least one service provider for performing a manufacturing task of each link according to a task type to which the manufacturing task of each link belongs; determining a plurality of preliminary schemes of the service provider capable of completing a task amount of each link and determining a service cost and a time cost of each preliminary scheme in each link; matching the plurality of preliminary schemes of each link to obtain a plurality of candidate schemes capable of completing the manufacturing task, determining a total service cost and a total time cost of each candidate scheme, and determining a total cost for completing the manufacturing task according to the total service cost and the total time cost; and screening a candidate scheme satisfying a preset constraint condition from the plurality of candidate schemes, and taking the candidate scheme with the minimum total cost as the allocation scheme of the manufacturing task. The optimal allocation of resources is realized.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of resource configuration, and particularly relates to a manufacturing task allocation scheme determination method, a computing device and a storage medium. BACKGROUND

[0002] After a manufacturing enterprise accepts an order from abroad, the manufacturing task needs to be processed by purchasing, producing and other services, and the finished product needs to be delivered to the foreign customer. This process includes purchasing, production, warehousing, transportation and customs clearance, etc. However, there is no resource allocation scheme that can maximize the reduction of costs. Therefore, a manufacturing task allocation scheme determination method is needed to select appropriate service providers for different manufacturing tasks, so as to maximize the reduction of order costs for the manufacturing enterprise. SUMMARY

[0003] The main purpose of the present application is to provide a manufacturing task allocation scheme determination method, a computing device and a storage medium, so as to realize the optimized allocation of resources and maximize the reduction of costs for the manufacturing task under the premise of ensuring efficiency.

[0004] In a first aspect, the present application provides a manufacturing task allocation scheme determination method, comprising: determining at least one service provider for executing the manufacturing task of each link according to the task type to which each link of the manufacturing task belongs, wherein the links of the manufacturing task include purchasing, production, warehousing, transportation and customs clearance; in each link, determining a plurality of preliminary schemes of service providers capable of completing the task quantity of the link according to the task quantity of the link and the capability data of each service provider for executing the manufacturing task of the link, and determining the service cost and time cost of each preliminary scheme, wherein the preliminary scheme is a single service provider or a combination of a plurality of service providers capable of completing the task quantity of the link; matching the plurality of preliminary schemes of each link in different ways to obtain a plurality of candidate schemes capable of completing the manufacturing task, and determining the total service cost and total time cost of each candidate scheme according to the service cost and time cost of each preliminary scheme, and determining the total cost of completing the manufacturing task according to the total service cost and total time cost; screening the candidate schemes that meet the preset constraint condition from the plurality of candidate schemes, and determining the candidate scheme with the minimum total cost from the candidate schemes that meet the preset constraint condition by using a genetic algorithm, and taking the candidate scheme with the minimum total cost as the allocation scheme of the manufacturing task.

[0005] In one embodiment, in the purchasing link, the service providers include material suppliers; the service cost and time cost of each preliminary scheme are determined by using the following formula:

[0006]

[0007] wherein C P denotes the service cost of executing each prepared solution in the procurement stage, P P (h) denotes the price of a unit of material of the hth material supplier, N P (h) denotes the quantity of material procured from the hth material supplier, x h denotes the decision variable for the hth material supplier, x h takes 1 to indicate that the hth material supplier is selected, x h takes 0 to indicate that the hth material supplier is not selected, and different values of x h form different prepared solutions in the procurement stage;

[0008] The time length of executing each prepared solution is determined by using the following formula:

[0009]

[0010] wherein T P denotes the time length of executing each prepared solution in the procurement stage, t pe (h) denotes the arrival time of the hth material supplier, t pb (h) denotes the start time of starting to procure from the hth material supplier, x h denotes the decision variable for the hth material supplier, x h takes 1 to indicate that the hth material supplier is selected, x h takes 0 to indicate that the hth material supplier is not selected.

[0011] In one embodiment, in the production stage, the service provider comprises production bases; the service cost and the time length of executing each prepared solution are determined by using the following formula to determine the service cost of executing each prepared solution:

[0012]

[0013] wherein C M denotes the service cost of executing each prepared solution in the production stage, P M (i) denotes the price of a unit of finished product produced by the ith production base using material, N M (i) denotes the quantity of finished product produced by the ith production base using material, x i denotes the decision variable for the ith production base, x i takes 1 to indicate that the ith production base is selected, x i takes 0 to indicate that the ith production base is not selected, and different values of x iDifferent values ​​of are used to form different preparation plans in the production process;

[0014] Use the following formula to determine how long it will take to execute each alternative:

[0015]

[0016] Among them, T M Indicates the time it takes to execute each preparatory plan in the production process, T W (i) represents the parking time of the material at the i-th production base, T S (i) represents the processing time of the material at the i-th production base, x i represents the decision variable for the i-th production base, x i Taking 1 means selecting the i-th production base, x i Taking 0 means not selecting the i-th production base.

[0017] In one embodiment, in the warehousing stage, the service provider includes a warehousing base; determining the service fee and time required to execute each preliminary plan includes: determining the service fee for executing each preliminary plan using the following formula:

[0018]

[0019] Among them, C S represents the service cost of executing each preparation plan in the warehousing link, P SM (j) represents the price of material per unit storage space in the jth storage base, S SM (j) represents the size of the storage space occupied by the material in the jth storage base, T SM (j) represents the storage time of the material in the jth storage base, P SP (j) represents the price of the finished product per unit of storage space in the jth storage base, S SP (j) represents the size of the storage space occupied by the finished product in the jth storage base, T SP (j) represents the storage time of the finished product in the jth storage base, x j represents the decision variable for the j-th storage base, x j Taking 1 means selecting the jth storage base, x j Taking 0 means not to select the jth storage base, through x j Different values ​​of are used to form different preparation plans in the warehousing process;

[0020] Use the following formula to determine how long it will take to execute each alternative:

[0021]

[0022] wherein T S represents the time length for executing each prepared plan in the warehousing link, T SM (j) represents the warehousing time length of the material in the jth warehousing base, t mb (j) represents the warehousing end time of the material in the jth warehousing base, t pe (j) represents the warehousing start time of the material in the jth warehousing base, T SP (j) represents the warehousing time length of the product in the jth warehousing base, t vb (j) represents the warehousing end time of the product in the jth warehousing base, t me (j) represents the warehousing start time of the product in the jth warehousing base, x j represents the decision variable for the jth warehousing base, x j takes 1 to represent selecting the jth warehousing base, x j takes 0 to represent not selecting the jth warehousing base.

[0023] In one embodiment, in the transfer link, the service provider includes the cargo ship service of each time period; determining the service cost and time length for executing each prepared plan, comprising: determining the service cost for executing each prepared plan by using the following formula:

[0024]

[0025] wherein C V represents the service cost for executing each prepared plan in the transfer link, P V (l) represents the price of each position in the cargo ship of the lth time period, N V (l) represents the number of positions occupied in the cargo ship of the lth time period, x l represents the decision variable for the cargo ship service of the lth time period, x l takes 1 to represent selecting the cargo ship service of the lth time period, x l takes 0 to represent not selecting the cargo ship service of the lth time period, by x l different values of x form different prepared plans in the transfer link;

[0026] determining the time length for executing each prepared plan by using the following formula:

[0027]

[0028] wherein T V represents the time length for executing each prepared plan in the transfer link, t ve (l) represents the departure time of the cargo ship of the lth time period, t vb(l) represents the start loading time of the cargo ship for the lth time period, x l represents the decision variable of the cargo ship service for the lth time period, x l taking 1 represents selecting the cargo ship service of the lth time period, x l taking 0 represents not selecting the cargo ship service of the lth time period.

[0029] In one embodiment, in the customs clearance process, the service provider includes a transit service provider; determining the service cost and time length for executing each prepared scheme, comprising: determining the service cost for executing each prepared scheme by using the following formula:

[0030]

[0031] wherein C F represents the service cost for executing each prepared scheme in the customs clearance process, C B represents the insurance cost, F k represents the ex-works price of the kth cargo, M k represents the customs duty rate, and n represents the total amount of cargo;

[0032] determining the time length for executing each prepared scheme by using the following formula:

[0033] T F = x k · T` FI (k)

[0034] wherein T F represents the time length for executing each prepared scheme in the customs clearance process, T` FI (k) represents the service time length of the kth transit service provider, x k represents the decision variable for the kth transit service provider, x k taking 1 represents selecting the kth transit service provider, x k taking 0 represents not selecting the kth transit service provider.

[0035] In one embodiment, according to the service cost and time length for executing each prepared scheme, the total service cost and total time length of each candidate scheme are determined correspondingly, and the total cost for completing the manufacturing task is determined according to the total service cost and total time length, comprising:

[0036] determining the total service cost of each candidate scheme by using the following formula:

[0037] T = T P + T M + T S + T V + T F

[0038] wherein T represents the total time cost, T P represents the time cost of executing each prepared scheme in the procurement link, T M represents the time cost of executing each prepared scheme in the production link, T S represents the time cost of executing each prepared scheme in the warehousing link, T V represents the time cost of executing each prepared scheme in the transfer link, T F represents the time cost of executing each prepared scheme in the customs clearance link;

[0039] The total time cost of each candidate scheme is determined by using the following formula:

[0040] C=C P +C M +C S +C V +C F

[0041] wherein C represents the total service cost, C P represents the service cost of executing each prepared scheme in the procurement link, C M represents the service cost of executing each prepared scheme in the production link, C S represents the service cost of executing each prepared scheme in the warehousing link, C V represents the service cost of executing each prepared scheme in the transfer link, C F represents the service cost of executing each prepared scheme in the customs clearance link;

[0042] The total time cost is normalized according to a first preset method to obtain a normalized total time cost, or the total service cost is normalized according to a second preset method to obtain a normalized total service cost;

[0043] When the total time cost is normalized, the total cost of the manufacturing task is determined by using the following formula:

[0044] F=ω1T’+ω2C

[0045] wherein F represents the total cost of the manufacturing task, ω1 represents the weight of the total time cost in the total cost, ω2 represents the weight of the total service cost in the total cost, T’ represents the normalized total time cost, and C represents the total service cost;

[0046] When the total service cost is normalized, the total cost of the manufacturing task is determined by using the following formula:

[0047] F=ω1T+ω2C’

[0048] wherein F represents a total cost of the manufacturing task, ω1 represents a weight of a total time cost in the total cost, ω2 represents a weight of a total service cost in the total cost, T represents the total time cost, and C' represents the total service cost after normalization processing.

[0049] In an embodiment, the preset constraint condition comprises: the total service cost does not exceed a preset total cost threshold; and / or the total time cost does not exceed a preset total time threshold; and / or a distance between a procurement place of the procurement link and a production place of the production link does not exceed a preset distance threshold; and / or a sum of a parking time of the material at the production base, a storage time of the finished product at the storage base, and a difference between a starting shipment time and a ship departure time is less than a preset invalid time threshold.

[0050] In a second aspect, the present application provides a device for determining a manufacturing task allocation scheme, comprising: a data preparation module configured to determine at least one service provider for performing a manufacturing task of each link according to a task type to which the manufacturing task of each link belongs, wherein the manufacturing task of each link comprises procurement, production, storage, transfer and customs clearance; a scheme preset module configured to determine, in each link, a plurality of preliminary schemes of service providers capable of completing a task volume of the link according to the task volume of the link and capability data of each service provider performing the manufacturing task of the link, and determine a service cost and a time cost of each preliminary scheme, wherein the preliminary scheme is a single service provider or a combination of a plurality of service providers capable of completing the task volume of the link; a scheme providing module configured to obtain a plurality of candidate schemes capable of completing the manufacturing task by matching the plurality of preliminary schemes of each link in different ways, determine a total service cost and a total time cost of each candidate scheme according to the service cost and the time cost of each preliminary scheme, and determine a total cost of completing the manufacturing task according to the total service cost and the total time cost; and a scheme determining module configured to screen candidate schemes satisfying a preset constraint condition from the plurality of candidate schemes, and determine a candidate scheme with the minimum total cost from the candidate schemes satisfying the preset constraint condition by using a genetic algorithm, and take the candidate scheme with the minimum total cost as the allocation scheme of the manufacturing task.

[0051] In a third aspect, the present application provides a computing device comprising a processor and a memory, wherein the memory stores a computer program which, when executed by the processor, implements the steps of the method for determining a manufacturing task allocation scheme as described above.

[0052] In a fourth aspect, the present application provides a storage medium storing a computer program which, when executed by a processor, implements the steps of the method for determining a manufacturing task allocation scheme as described above.

[0053] In the case of manufacturing tasks, the whole cycle of the order is considered in combination with the actual situation, which can make the relevant service resources be reasonably allocated, reduce the phenomenon of resource idling and resource shortage, be beneficial to quickly find the optimal task allocation scheme, reduce the time cost and economic cost of manufacturing tasks, and improve the production efficiency of manufacturing enterprises. BRIEF DESCRIPTION OF DRAWINGS

[0054] The drawings accompanying the specification of this application serve to provide further understanding of the present application, the illustrative embodiments of the present application and the description thereof serve to explain the present application, and do not constitute an improper limitation on the present application, in the drawings:

[0055] Figure 1 a schematic diagram of factors to be considered for the determination method of the manufacturing task allocation scheme according to an exemplary embodiment of the present application;

[0056] Figure 2 a flowchart of the determination method of the manufacturing task allocation scheme according to an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0057] It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other without conflict. The present application will be described in detail below with reference to the drawings and in combination with the embodiments.

[0058] When a manufacturing enterprise receives an overseas order, first, as shown in Figure 1 the overseas order can be task-decomposed according to five links of procurement, production, warehousing, transportation and customs clearance, each link has its corresponding service resource set, and a weighted sum of total time length and total cost is taken as the objective function, based on preset constraint conditions, genetic algorithm is used to optimize the configuration of service resources.

[0059] The total time length is composed of the time lengths of procurement, processing, warehousing, transportation and customs clearance, and the total cost is composed of procurement, processing, warehousing, transportation and customs clearance (the customs clearance fee can include insurance and customs duty generated when the goods are exported).

[0060] The preset constraint conditions can be divided into regional coordination and time coordination. The regional coordination means that the distance between the production base where production and processing are located and the warehousing base where warehousing is located needs to be within a preset range, for example, it can be in the same city. The time coordination means that the procurement time, production time and transportation time need to maintain good coordination, for example, the time difference between the procurement arrival time and the start production time, the production end time and the start transportation time is as small as possible.

[0061] Embodiment one

[0062] The embodiment provides a method for determining a manufacturing task allocation scheme, Figure 2 A flow chart of the method for determining the manufacturing task allocation scheme according to an exemplary embodiment of the present application is shown in FIG. 1. As shown in the figure, the method of the embodiment can include: Figure 2

[0063] S100: determining at least one service provider for performing a manufacturing task of each link according to a task type to which the link belongs, wherein the links of the manufacturing task include procurement, production, warehousing, transfer and customs clearance.

[0064] S200: determining a plurality of preliminary schemes of service providers capable of completing a task amount of each link according to the task amount of the link and capability data of each service provider for performing the manufacturing task of the link, and determining a service cost and a time cost for performing each preliminary scheme, wherein the preliminary scheme is a single service provider or a combination of a plurality of service providers capable of completing the task amount of the link.

[0065] S300: matching the plurality of preliminary schemes of each link to obtain a plurality of candidate schemes capable of completing the manufacturing task, and determining a total service cost and a total time cost of each candidate scheme according to the service cost and the time cost for performing each preliminary scheme, and determining a total cost for completing the manufacturing task according to the total service cost and the total time cost.

[0066] S400: screening a candidate scheme satisfying a preset constraint condition from the plurality of candidate schemes, and determining a candidate scheme with a minimum total cost from the candidate schemes satisfying the preset constraint condition by using a genetic algorithm, and taking the candidate scheme with the minimum total cost as the allocation scheme of the manufacturing task.

[0067] With the increase of the problem size, the search space of the combinatorial optimization problem also increases sharply, and sometimes it is difficult to obtain the optimal solution by using the enumeration method in calculation. For such complex problems, people have realized that the main effort should be put on seeking a satisfactory solution, and the genetic algorithm is one of the best tools for seeking such a satisfactory solution. The genetic algorithm is a method for simulating the biological evolution mechanism of the nature to perform a random global search and optimization on the solution of a problem. Each chromosome in the genetic algorithm corresponds to a solution, and the solution is adaptively evaluated by using a fitness function to distinguish the advantages and disadvantages of the solution. The genetic algorithm is a process for seeking an optimal solution by continuously searching and optimizing.

[0068] In the procurement link, the service provider can include a material supplier; and the service cost and the time cost for performing each preliminary scheme can be determined by using the following formula:

[0069] ​

[0070] wherein C P denotes the service cost of executing each prepared solution in the procurement stage, P P (h) denotes the price of a unit of material of the hth material supplier, N P (h) denotes the quantity of material procured from the hth material supplier, x h denotes the decision variable for the hth material supplier, x h taking 1 means selecting the hth material supplier, x h taking 0 means not selecting the hth material supplier, different values of x h form different prepared solutions in the procurement stage;

[0071] The time length of executing each prepared solution is determined by the following formula:

[0072]

[0073] wherein T P denotes the time length of executing each prepared solution in the procurement stage, t pe (h) denotes the arrival time of the hth material supplier, t pb (h) denotes the start time of procuring from the hth material supplier, x h denotes the decision variable for the hth material supplier, x h taking 1 means selecting the hth material supplier, x h taking 0 means not selecting the hth material supplier.

[0074] In the production stage, the service provider can include production bases; determining the service cost and time length of executing each prepared solution can include determining the service cost of executing each prepared solution by the following formula:

[0075]

[0076] wherein C M denotes the service cost of executing each prepared solution in the production stage, P M (i) denotes the price of a unit of finished product produced by the ith production base using material, N M (i) denotes the quantity of finished product produced by the ith production base using material, x i denotes the decision variable for the ith production base, x i taking 1 means selecting the ith production base, x i taking 0 means not selecting the ith production base, different values of x i form different prepared solutions in the production stage;

[0077] The cost time length for executing each preparatory scheme is determined by the following formula:

[0078]

[0079] wherein T M represents the cost time length for executing each preparatory scheme in the production link, T W (i) represents the parking time length of the material at the i-th production base, T S (i) represents the processing time length of the material at the i-th production base, x i represents the decision variable for the i-th production base, x i taking 1 represents selecting the i-th production base, x i taking 0 represents not selecting the i-th production base.

[0080] In the warehousing link, the service provider can include a warehousing base; determining the service cost and the cost time length for executing each preparatory scheme can include: determining the service cost for executing each preparatory scheme by the following formula:

[0081]

[0082] wherein C S represents the service cost for executing each preparatory scheme in the warehousing link, P SM (j) represents the price of occupying a unit warehousing space of the material at the j-th warehousing base, S SM (j) represents the size of the warehousing space occupied by the material at the j-th warehousing base, T SM (j) represents the warehousing time length of the material at the j-th warehousing base, P SP (j) represents the price of occupying a unit warehousing space of the finished product at the j-th warehousing base, S SP (j) represents the size of the warehousing space occupied by the finished product at the j-th warehousing base, T SP (j) represents the warehousing time length of the finished product at the j-th warehousing base, x j represents the decision variable for the j-th warehousing base, x j taking 1 represents selecting the j-th warehousing base, x j taking 0 represents not selecting the j-th warehousing base, by different values of x j different preparatory schemes in the warehousing link are formed;

[0083] The cost time length for executing each preparatory scheme is determined by the following formula:

[0084]

[0085] wherein T Sdenotes the time length of executing each prepared solution in the warehousing link, T SM (j) denotes the warehousing time length of the material in the jth warehousing base, t mb (j) denotes the end time of storage of the material in the jth warehousing base, t pe (j) denotes the start time of storage of the material in the jth warehousing base, T SP (j) denotes the warehousing time length of the finished product in the jth warehousing base, t vb (j) denotes the end time of storage of the finished product in the jth warehousing base, t me (j) denotes the start time of storage of the finished product in the jth warehousing base, x j denotes the decision variable for the jth warehousing base, x j taking 1 indicates that the jth warehousing base is selected, x j taking 0 indicates that the jth warehousing base is not selected.

[0086] In the transfer link, the service provider can include cargo ship services in each time period; determining the service cost and time length of executing each prepared solution can include: determining the service cost of executing each prepared solution by using the following formula:

[0087]

[0088] wherein C V denotes the service cost of executing each prepared solution in the transfer link, P V (l) denotes the price of each position in the cargo ship in the lth time period, N V (l) denotes the number of positions occupied in the cargo ship in the lth time period, x l denotes the decision variable for the cargo ship service in the lth time period, x l taking 1 indicates that the cargo ship service in the lth time period is selected, x l taking 0 indicates that the cargo ship service in the lth time period is not selected, different values of x l form different prepared solutions in the transfer link;

[0089] determining the time length of executing each prepared solution by using the following formula:

[0090]

[0091] wherein T V denotes the time length of executing each prepared solution in the transfer link, t ve (l) denotes the departure time of the cargo ship in the lth time period, t vb (l) denotes the start loading time of the cargo ship in the lth time period, xl x l = 1 represents selecting the cargo ship service of the lth time period, x l = 0 represents not selecting the cargo ship service of the lth time period.

[0092] In the customs clearance process, the service provider can include a transit service provider; determining the service cost and the time length for executing each prepared scheme can include: determining the service cost for executing each prepared scheme by using the following formula:

[0093]

[0094] wherein C F represents the service cost for executing each prepared scheme in the customs clearance process, C B represents the insurance cost, F k represents the CIF price of the kth cargo, M k represents the customs duty rate, and n represents the total amount of the cargo;

[0095] determining the time length for executing each prepared scheme by using the following formula:

[0096] T F = x k · T` FI (k)

[0097] wherein T F represents the time length for executing each prepared scheme in the customs clearance process, T` FI (k) represents the service time length of the kth transit service provider, x k represents the decision variable for the kth transit service provider, x k = 1 represents selecting the kth transit service provider, x k = 0 represents not selecting the kth transit service provider.

[0098] wherein according to the service cost and the time length for executing each prepared scheme, the total service cost and the total time length of each candidate scheme are determined correspondingly, and the total cost for completing the manufacturing task is determined according to the total service cost and the total time length, can include:

[0099] determining the total service cost of each candidate scheme by using the following formula:

[0100] T = T P + T M + T S + T V + T F

[0101] wherein T represents the total time length, TP denotes the time length for executing each prepared scheme in the procurement link, T M denotes the time length for executing each prepared scheme in the production link, T S denotes the time length for executing each prepared scheme in the storage link, T V denotes the time length for executing each prepared scheme in the transfer link, T F denotes the time length for executing each prepared scheme in the customs clearance link, T

[0102] The total time length of each candidate scheme is determined by using the following formula:

[0103] C = C P + C M + C S + C V + C F

[0104] wherein C denotes the total service cost, C P denotes the service cost for executing each prepared scheme in the procurement link, C M denotes the service cost for executing each prepared scheme in the production link, C S denotes the service cost for executing each prepared scheme in the storage link, C V denotes the service cost for executing each prepared scheme in the transfer link, C F denotes the service cost for executing each prepared scheme in the customs clearance link, C

[0105] The total time length is normalized according to a first preset method to obtain a normalized total time length, or the total service cost is normalized according to a second preset method to obtain a normalized total service cost. For example, the total time length can be normalized by calculating the ratio of the difference between the total time length and a preset minimum time length to the difference between a preset maximum time length and the preset minimum time length. For example, the total service cost can be normalized by calculating the ratio of the difference between the total service cost and a preset minimum cost to the difference between a preset maximum cost and the preset minimum cost. The specific normalization method is not specifically limited herein, and can be limited by a person skilled in the art as needed, as long as the normalized parameter can be used together with another parameter to calculate the total cost.

[0106] When the total time length is normalized, the total cost of the manufacturing task is determined by using the following formula:

[0107] F = ω1T’ + ω2C

[0108] F=ω1T+ω2C', wherein F represents the total cost of the manufacturing task, ω1 represents a weight of the total time cost in the total cost, ω2 represents a weight of the total service cost in the total cost, T represents the total time cost, and C' represents the total service cost after normalization processing.

[0109] When the total service cost is normalized, the total cost of the manufacturing task is determined by using the following formula:

[0110] F=ω1T+ω2C', wherein F represents the total cost of the manufacturing task, ω1 represents a weight of the total time cost in the total cost, ω2 represents a weight of the total service cost in the total cost, T represents the total time cost, and C' represents the total service cost after normalization processing.

[0111] F=ω1T+ω2C', wherein F represents the total cost of the manufacturing task, ω1 represents a weight of the total time cost in the total cost, ω2 represents a weight of the total service cost in the total cost, T represents the total time cost, and C' represents the total service cost after normalization processing.

[0112] In formulating the task allocation scheme, it can be determined that there is no spare time between the steps that are connected to each other, for example, if the production is started immediately after the arrival of the purchased materials, it can be considered that the time of arrival of the materials and the time of starting production are the same, and so on.

[0113] The preset constraint condition can include that the total service cost does not exceed a preset total cost threshold; and / or the total time cost does not exceed a preset total time threshold; and / or the distance between the procurement place of the procurement step and the production place of the production step does not exceed a preset distance threshold; and / or the sum of the parking time of the materials at the production base, the storage time of the finished products at the storage base, and the difference between the time of starting loading and the time of the cargo ship leaving the port is less than a preset invalid time threshold.

[0114] The distance between the procurement place of the procurement step and the production place of the production step does not exceed a preset distance threshold, that is, regional coordination, which can be expressed as follows:

[0115]

[0116]

[0117] The sum of the parking time of the materials at the production base, the storage time of the finished products at the storage base, and the difference between the time of starting loading and the time of the cargo ship leaving the port can be expressed as follows:

[0118] TS=t u

[0119] t u =∑|(t mb -t pe )|+|(t vb -t me )|+|(t ve -tvb |

[0120] wherein t mb denotes the end time of the storage of the material at the storage site, t pe denotes the start time of the storage of the material at the storage site, t vb denotes the end time of the storage of the finished product at the storage site, t me denotes the start time of the storage of the finished product at the storage site, t ve denotes the time of departure of the freighter.

[0121] The storage time of the material and the finished product in the warehouse has a great influence on the inventory cost, and reducing the residence time of the raw material and the finished product in the warehouse can greatly save the cost. This means that the procurement time, the production time and the transportation time need to maintain a high degree of synergy, and the time difference between the arrival time of the purchased material and the start time of the production, and the time difference between the end time of the production and the start time of the transportation are meaningless time, and the smaller the meaningless time, the smaller the cost of occupying the warehouse.

[0122] In the case of a clear manufacturing task, the resources required by the entire cycle of the order are considered globally in combination with the actual situation, which can make the relevant service resources be reasonably allocated, reduce the phenomenon of resource idling and resource shortage, be conducive to quickly finding the optimal task allocation scheme, reduce the time cost and economic cost of the manufacturing task, and improve the production efficiency of the manufacturing enterprise.

[0123] Example Two

[0124] The embodiment provides a determination device of a manufacturing task allocation scheme, which comprises the following modules: a data preparation module, which is used for determining at least one service provider for executing a manufacturing task of each link according to a task type to which the manufacturing task of each link belongs, wherein the manufacturing task of each link comprises procurement, production, warehousing, transfer and customs clearance; a scheme presetting module, which is used for determining a plurality of preliminary schemes of service providers capable of completing a task amount of each link according to the task amount of the link and capability data of each service provider for executing the manufacturing task of the link, and determining service cost and time cost of each preliminary scheme, wherein the preliminary scheme is a single service provider or a combination of a plurality of service providers capable of completing the task amount of the link; a scheme providing module, which is used for matching the plurality of preliminary schemes of each link to obtain a plurality of candidate schemes capable of completing the manufacturing task, and determining total service cost and total time cost of each candidate scheme according to the service cost and the time cost of each preliminary scheme, and determining total cost of completing the manufacturing task according to the total service cost and the total time cost; and a scheme determining module, which is used for screening a candidate scheme satisfying a preset constraint condition from the plurality of candidate schemes, and determining a candidate scheme with minimum total cost from the candidate schemes satisfying the preset constraint condition by using a genetic algorithm, and taking the candidate scheme with the minimum total cost as the allocation scheme of the manufacturing task.

[0125] The determination device of the manufacturing task allocation scheme of the embodiment can further comprise a processor and a memory, and the processor is used for executing the following program modules stored in the memory: the data preparation module, the scheme presetting module, the scheme providing module and the scheme determining module.

[0126] Embodiment three

[0127] The embodiment provides a computing device comprising a processor and a memory, and the memory stores a computer program, when the computer program is executed by the processor, the steps of the determination method of the manufacturing task allocation scheme are realized.

[0128] In one embodiment, the computing device can comprise one or more processors (CPU), input / output interfaces, network interfaces and memories.

[0129] The memory can comprise a non-permanent memory in a computer readable medium, random access memory (RAM) and / or non-volatile memory such as read-only memory (ROM) or flash (flash FLASH RAM). The memory is an example of the computer readable medium.

[0130] Embodiment four

[0131] The embodiment provides a storage medium, which stores a computer program. When the computer program is executed by a processor, steps of a method for determining a manufacturing task allocation scheme are implemented.

[0132] The computer program can employ any combination of one or more storage media. The storage media can be a readable signal medium or a readable storage medium.

[0133] The readable storage medium can include, for example, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination thereof. More specific examples (a non-exhaustive list) of the readable storage medium can include an electrical connection having one or more wires, a portable disc, 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 thereof.

[0134] The readable signal medium can include a data signal that is propagated in or on a baseband medium or a propagated medium that stores the readable computer program. Such a propagated signal can take any of a variety of forms, including but not limited to electro-magnetic, optical, or any suitable combination thereof. The readable signal medium can also be any 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.

[0135] The computer program included in the storage medium can be transmitted in any suitable medium, including but not limited to wireless, wired, optical, RF, or any suitable combination thereof.

[0136] The computer program for performing the operations of the present application can be written in any combination of one or more programming languages. The programming language can include an object-oriented programming language, such as Java, C++, or the like, and can also include a conventional procedural programming language, such as the "C" programming language or similar programming languages. The computer program can execute entirely on the user's computing device, partly on the user's device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user's computing device through any kind of network, including a local area network or a wide area network, or can be connected to an external computing device, such as an Internet service provider through the Internet.

[0137] It is to be understood that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments in accordance with the present application. As used herein, the term "includes" and / or "including" means incorporating one or more aspects of features, steps, operations, devices, components and / or the combinations thereof.

[0138] It is to be understood that the terms "first", "second", and the like used herein do not imply a particular order or sequence, but are used to distinguish one aspect from another. It is to be understood that such terms are used interchangeably and are not intended to require a particular order or sequence, unless otherwise specifically noted.

[0139] Further, although the method of operation of the present application is illustrated in a particular order, this is not meant to imply that the operations must be performed in that particular order, or that all illustrated operations must be performed, in order to achieve the desired result. Additionally or alternatively, certain steps can be omitted, combined, performed in a different order, and / or performed in parallel.

[0140] While the spirit and principles of the application have been described with reference to several specific embodiments, it is to be understood that the application is not limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be included within the spirit and scope of the appended claims.

Claims

1. A method of determining a manufacturing task allocation scheme, characterized by, The method comprises the following steps: determining at least one service provider for executing each link of the manufacturing task according to the task type to which each link of the manufacturing task belongs, wherein the links of the manufacturing task include procurement, production, warehousing, transfer and customs clearance; in each link, determining a plurality of preliminary schemes of service providers capable of completing the task volume of the link according to the task volume of the link and the capability data of each service provider for executing the manufacturing task of the link, and determining the service cost and time cost of each preliminary scheme, wherein the preliminary scheme is a single service provider or a combination of a plurality of service providers capable of completing the task volume of the link; arranging the preliminary schemes of each link in different combinations to obtain a plurality of candidate schemes capable of completing the manufacturing task, and correspondingly determining the total service cost and total time cost of each candidate scheme according to the service cost and time cost of each preliminary scheme, and determining the total cost of completing the manufacturing task according to the total service cost and total time cost; screening the candidate schemes that meet the preset constraint conditions from the plurality of candidate schemes, and determining the candidate scheme with the minimum total cost from the candidate schemes that meet the preset constraint conditions by using a genetic algorithm, and taking the candidate scheme with the minimum total cost as the allocation scheme of the manufacturing task; wherein the preset constraint conditions include: the total service cost does not exceed a preset total cost threshold; and / or the total time cost does not exceed a preset total time threshold; and / or the distance between the procurement location of the procurement link and the production location of the production link does not exceed a preset distance threshold; and / or the sum of the parking time of the material at the production base, the warehousing time of the finished product at the warehousing base, and the difference between the start loading time and the ship departure time is less than a preset invalid time threshold; the distance between the procurement location of the procurement link and the production location of the production link, i.e. regional coordination, can be represented by the following expression: the sum of the parking time of the material at the production base, the warehousing time of the finished product at the warehousing base, and the difference between the start loading time and the ship departure time can be represented by the following expression: wherein, denotes the end time of the storage of the material at the storage site, denotes the start time of the storage of the material at the storage site, denotes the end time of the storage of the finished product at the storage site, denotes the start time of the storage of the finished product at the storage site, denotes the departure time of the cargo ship.

2. The method of claim 1, wherein in the procurement link, the service providers include material suppliers; determining the service cost and time cost of each preliminary scheme comprises: determining the service cost of each preliminary scheme by using the following formula: wherein denotes the service cost for executing each prepared scenario in the procurement phase, denotes the price of a unit of material of the hth material supplier, denotes the quantity of material procured from the hth material supplier, denotes the decision variable for the hth material supplier, denotes the selection of the hth material supplier, denotes the non-selection of the hth material supplier, by different values of the different procurement scenarios in the procurement phase. determining the time cost of each preliminary scheme by using the following formula: wherein, denotes the time length of the cost of executing each prepared scenario in the procurement phase, denotes the arrival time of the hth material supplier, denotes the start time of the procurement from the hth material supplier, denotes the decision variable for the hth material supplier, takes the value 1 if the hth material supplier is selected, takes the value 0 if the hth material supplier is not selected.

3. The method of claim 1, wherein in the production link, the service providers include production bases; determining the service cost and time cost of each preliminary scheme comprises: determining the service cost of each preliminary scheme by using the following formula: wherein, represents the service cost of executing each preliminary scheme in the production link, represents the price of producing a unit of finished product by the ith production base using the material, represents the quantity of finished product produced by the ith production base using the material, represents the decision variable for the ith production base, taking 1 represents selecting the ith production base, taking 0 represents not selecting the ith production base, and different values of form different preliminary schemes in the production link. determining the time cost of each preliminary scheme by using the following formula: in, Indicates the time it takes to execute each preliminary plan in the production process. Indicates the parking time of the material in the i-th production base, Indicates the processing time of the material in the i-th production base, represents the decision variable for the i-th production base, Taking 1 means selecting the i-th production base, Taking 0 means not selecting the i-th production base.

4. The method of claim 1, wherein in the warehousing link, the service providers include warehousing bases; determining the service cost and time cost of each preliminary scheme comprises: determining the service cost of each preliminary scheme by using the following formula: wherein, represents the service cost of executing each preliminary scheme in the warehousing link, represents the price of a unit warehousing space occupied by the material at the jth warehousing base, represents the size of the warehousing space occupied by the material at the jth warehousing base, represents the warehousing duration of the material at the jth warehousing base, represents the price of a unit warehousing space occupied by the finished product at the jth warehousing base, represents the size of the warehousing space occupied by the finished product at the jth warehousing base, represents the warehousing duration of the finished product at the jth warehousing base, represents the decision variable for the jth warehousing base, takes 1 to indicate that the jth warehousing base is selected, takes 0 to indicate that the jth warehousing base is not selected, and different values of form different preliminary schemes in the warehousing link. determining the time cost of each preliminary scheme by using the following formula: wherein, denotes the time length of performing each preparation scheme in the warehousing link, denotes the warehousing time length of the material in the jth warehousing base, , denotes the storage end time of the material in the jth warehousing base, denotes the storage start time of the material in the jth warehousing base, denotes the warehousing time length of the finished product in the jth warehousing base, , denotes the storage end time of the finished product in the jth warehousing base, denotes the storage start time of the finished product in the jth warehousing base, denotes the decision variable for the jth warehousing base, taking 1 indicates selecting the jth warehousing base, taking 0 indicates not selecting the jth warehousing base.

5. The method of claim 1, wherein in the transfer link, the service providers include ship services in each time period; determining the service cost and time cost of each preliminary scheme comprises: The service cost of executing each prepared scheme is determined by using the following formula: wherein, denotes the service cost of performing each prepared scenario in the transshipment leg, denotes the price of each slot in the cargo ship in the lth time period, denotes the number of slots in the cargo ship in the lth time period that are occupied, denotes the decision variable for the cargo ship service in the lth time period, denotes the selection of the cargo ship service in the lth time period, denotes the non-selection of the cargo ship service in the lth time period, by different values of form different prepared scenarios in the transshipment leg; The time length of executing each prepared scheme is determined by using the following formula: wherein, denotes the time length of performing each prepared scheme in the transit link, denotes the departure time of the cargo ship in the lth time period, denotes the start loading time of the cargo ship in the lth time period, denotes the decision variable of the cargo ship service for the lth time period, taking 1 indicates selecting the cargo ship service in the lth time period, taking 0 indicates not selecting the cargo ship service in the lth time period.

6. The method of claim 1, wherein In the customs clearance link, the service provider includes a transit service provider; The service cost and the time length of executing each prepared scheme are determined, including: The service cost of executing each prepared scheme is determined by using the following formula: wherein, denotes the service fee for performing each of the preliminary plans in the customs clearance process, denotes the insurance fee, denotes the FOB price of the kth cargo, denotes the customs duty rate, and n denotes the total amount of the cargo; The time length of executing each prepared scheme is determined by using the following formula: wherein, denotes the time length of performing each prepared scheme in the customs clearance process, denotes the service time length of the kth transit service provider, denotes the decision variable for the kth transit service provider, taking 1 indicates selecting the kth transit service provider, taking 0 indicates not selecting the kth transit service provider.

7. The method of claim 1, wherein According to the service cost and the time length of executing each prepared scheme, the total service cost and the total time length of each candidate scheme are determined correspondingly, and the total cost of completing the manufacturing task is determined according to the total service cost and the total time length, including: The total service cost of each candidate scheme is determined by using the following formula: wherein, denotes the total time length spent, denotes the time length spent for executing each prepared solution in the procurement phase, denotes the time length spent for executing each prepared solution in the production phase, denotes the time length spent for executing each prepared solution in the warehousing phase, denotes the time length spent for executing each prepared solution in the transshipment phase, denotes the time length spent for executing each prepared solution in the customs clearance phase; The total time length of each candidate scheme is determined by using the following formula: wherein, represents the total service cost, represents the service cost for executing each prepared plan in the procurement link, represents the service cost for executing each prepared plan in the production link, represents the service cost for executing each prepared plan in the warehousing link, represents the service cost for executing each prepared plan in the transfer link, represents the service cost for executing each prepared plan in the customs clearance link; The total time length is normalized according to a first preset method to obtain a normalized total time length, or the total service cost is normalized according to a second preset method to obtain a normalized total service cost; When the total time length is normalized, the total cost of the manufacturing task is determined by using the following formula: wherein, denotes the total cost of manufacturing tasks, denotes a weight of the total time spent in the total cost, denotes a weight of the total service cost in the total cost, denotes the total time spent after normalization, denotes the total service cost; When the total service cost is normalized, the total cost of the manufacturing task is determined by using the following formula: wherein, denotes the total cost of manufacturing tasks, denotes a weight of the total spent time in the total cost, denotes a weight of the total service cost in the total cost, denotes the total spent time, denotes the total service cost after normalization.

8. The method of claim 1, wherein The preset constraint condition includes: The total service cost does not exceed a preset total cost threshold; and / or The total time length does not exceed a preset total time length threshold; and / or The distance between the procurement place of the procurement link and the production place of the production link does not exceed a preset distance threshold; and / or The sum of the parking time length of the material at the production base, the storage time length of the finished product at the storage base, and the difference between the starting shipment time and the ship departure time is less than a preset invalid time length threshold.

9. A determination apparatus of a manufacturing task allocation scheme, characterized by, Including: A data preparation module is configured to determine at least one service provider for executing a manufacturing task of each link according to a task type to which each link of the manufacturing task belongs, wherein the links of the manufacturing task include procurement, production, storage, transfer, and customs clearance; A scheme preset module is configured to determine a plurality of prepared schemes of a service provider capable of completing a task amount of each link and determine a service cost and a time length of executing each prepared scheme according to the task amount of the link and capability data of each service provider for executing the manufacturing task of the link, wherein the prepared scheme is a single service provider or a combination of a plurality of service providers capable of completing the task amount of the link; A scheme providing module is configured to obtain a plurality of candidate schemes capable of completing the manufacturing task by different collocations of the plurality of prepared schemes of each link, and determine a total service cost and a total time length of each candidate scheme according to the service cost and the time length of executing each prepared scheme, and determine a total cost of completing the manufacturing task according to the total service cost and the total time length. A scheme determining module is configured to screen candidate schemes satisfying preset constraint conditions from the plurality of candidate schemes, and determine a candidate scheme with the minimum total cost from the candidate schemes satisfying the preset constraint conditions by using a genetic algorithm, and take the candidate scheme with the minimum total cost as the allocation scheme of the manufacturing task. The preset constraint conditions include: The total service cost is not more than a preset total cost threshold; and / or The total time cost is not more than a preset total time threshold; and / or The distance between the procurement location of the procurement link and the production location of the production link is not more than a preset distance threshold; and / or The sum of the parking time of the material at the production base, the storage time of the finished product at the storage base, and the difference between the starting shipment time and the ship departure time is less than a preset invalid time threshold; The distance between the procurement location of the procurement link and the production location of the production link is not more than a preset distance threshold, i.e., regional coordination, which can be expressed as: The sum of the parking time of the material at the production base, the storage time of the finished product at the storage base, and the difference between the starting shipment time and the ship departure time can be expressed as: wherein, denotes the end time of the storage of the material at the storage site, denotes the start time of the storage of the material at the storage site, denotes the end time of the storage of the finished product at the storage site, denotes the start time of the storage of the finished product at the storage site, denotes the departure time of the cargo ship.

10. A computing device, comprising: A processor and a memory are included, and the memory stores a computer program. When the computer program is executed by the processor, the steps of the manufacturing task allocation scheme determination method according to any one of claims 1 to 8 are implemented.

11. A storage medium, characterized by The memory stores a computer program. When the computer program is executed by the processor, the steps of the manufacturing task allocation scheme determination method according to any one of claims 1 to 8 are implemented.

Images