CN115330059A - Multi-factory production optimization configuration method, system, storage medium and electronic equipment - Google Patents

Multi-factory production optimization configuration method, system, storage medium and electronic equipment Download PDF

Info

Publication number
CN115330059A
CN115330059A CN202210982491.9A CN202210982491A CN115330059A CN 115330059 A CN115330059 A CN 115330059A CN 202210982491 A CN202210982491 A CN 202210982491A CN 115330059 A CN115330059 A CN 115330059A
Authority
CN
China
Prior art keywords
plan
production
factory
order
planning
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210982491.9A
Other languages
Chinese (zh)
Inventor
谷锐
赵祺
郑孝旭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Modiangou Intelligent Technology Dongguan Co ltd
Original Assignee
Modiangou Intelligent Technology Dongguan Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Modiangou Intelligent Technology Dongguan Co ltd filed Critical Modiangou Intelligent Technology Dongguan Co ltd
Priority to CN202210982491.9A priority Critical patent/CN115330059A/en
Publication of CN115330059A publication Critical patent/CN115330059A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313—Resource planning in a project environment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06314—Calendaring for a resource
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06395—Quality analysis or management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0838—Historical data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/08—Construction
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Primary Health Care (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Manufacturing & Machinery (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

The invention relates to the technical field of building design, in particular to a multi-factory production optimization configuration method, which is used for searching a factory most suitable for producing an order by replanning orders which cannot be produced by the factory and matching the orders with various factories, and avoids the problem that order production cannot be completed. The invention realizes the timely distribution of orders by the joint operation of multiple factories, can match the optimal factory for production, and ensures that the orders can complete the production in time.

Description

Multi-factory production optimization configuration method, system, storage medium and electronic equipment
Technical Field
The invention relates to the technical field of building design, in particular to a multi-factory production optimization configuration method and system.
Background
In the construction industry, taking a PC component as an example, a PC component factory is rapidly developed in recent years, but at present, most of such factories are in a single factory production operation mode, and there is almost no multi-factory joint operation mode, and an existing PC component factory is pull-type production, and after the factory receives an order, the factory may not produce a finished order due to uncertainty of sales order reception and engineering construction schedule, so when the factory encounters an order which cannot be finished, the order can only be delayed, or the factory can only seek other factories which can be handled, but the process is not well controlled, so that the production delivery date of the order is easily delayed, and the forwarded factory is not necessarily the most suitable factory, and when the order is not produced by the most suitable factory, problems such as mismatching of corresponding resources are likely to be caused, for example, the problem of long production time and the like are caused, and how to effectively and optimally match the factory is a problem which needs to be solved at present.
Disclosure of Invention
The invention provides a multi-factory production optimization configuration method aiming at the problems in the prior art, which can jointly operate the multi-factories and aim at the production factory with the optimal order matching.
In order to solve the technical problem, the invention discloses a multi-factory production optimization configuration method on one hand, which comprises the following steps:
s1, obtaining an order which cannot be produced in a factory;
s2, generating a production plan, a stacking plan and a transportation plan according to the information of the order;
s3, merging the production plan, the stacking plan and the transportation plan of the order into the existing plans of various factories to form new production plan, stacking plan and transportation plan;
s4, judging whether the production capacity of each factory meets new production planning, stacking planning and transportation planning or not;
s5, evaluating factories meeting new production planning, stacking planning and transportation planning;
and S6, distributing the order to the factory with the optimal evaluation.
Preferably, when judging whether the production capacity of each factory meets the new production plan, stacking plan and transportation plan, if all factories can not meet the order requirement, the order is equally divided, and the divided order is subjected to the processes of the methods S1 to S4 again until the factories meet the order requirement.
Preferably, the method S2 generates a production plan, a stacking plan, and a transportation plan according to the information of the order, and includes the following steps:
(1) The information of the order includes:
order delivery information O i ＝(D si ，V i ，T di ，T ti ，n)，
D si A date of delivery for the order;
V i is the amount of the component (m) delivered each time 3 )；
T di Cycle (days) for delivery;
T ti as the transit period (days);
n is the number of deliveries;
(2) Obtaining a production plan:
order beginning date of production D pi-s ＝D si -2*T di ；
End of order date D pi-e ＝D pi-s -n*T di ；
Average daily production requirement over a production period
Figure BDA0003800733690000031
The production plan of the order is
P p-i ＝[(D pi-s ，C di )，(D pi-s +1，C di )，......，(D pi→e ，C di )]；
(3) Acquiring a stacking plan:
date of initial Stacking D si-s ＝D pi-s +T di ；
End of Stacking date D si-e ＝D pi-s +2*T di ；
Volume V of stacked components in stacking time period si ＝2*V i ；
The stack of the order is planned as
S p-i ＝[(D si-s ，V si )，(D si-s +1，V si )，......，(D si-e ，V si )]；
(4) Acquiring a transportation plan:
date of each shipment D tsi-s-n ＝D si-n +(n-1)*T di ；
End date of each shipment D tsi-d-n ＝D si-n +(n-1)*T di +*T ti ；
Daily transport capacity requirement within a transport time period
Figure BDA0003800733690000032
The transportation plan of the order is
TS p-i ＝[(D tsi-s-1 ，V tsi )，(D tsi-s-1 +1，V tsi )，......，(D tsi-s-n ，V tsi )]。
Preferably, in the method S3, the method of combining the production plan, the stack plan and the transportation plan of the order with the existing plans of the various factories to form a new production plan, stack plan and transportation plan includes the following steps:
(1) Acquiring the current production plan, stacking and transportation plan of a factory j:
production planning
P j-p ＝[(D 1 ，C j-1 )，(D 2 ，C j-2 )，......，(D n ，C j-n )]；
Stack planning
S j-p ＝[(D 1 ，V j-s-1 )，(D 2 ，V j-s-2 )，......，(D n ，V j-s-n )]；
Transportation planning
TS j-p ＝[(D 1 ，V j-ts-1 )，(D 2 ，V j-ts-2 )，......，(D n ，V j-ts-n )]；
(2) And substituting the order production, stacking and transportation plans into the existing plan of the factory to generate a new plan:
merged post production planning
P j-p-n ＝[(D 1 ，C j-1-n )，(D 2 ，C j-2-n )，......，(D n ，C j-n-n )]Wherein, C j-n-n ＝C j-n +C di ；
Merge post stack planning
S j-p-n ＝[(D 1 ，V j-s-1-n )，(D 2 ，V j-s-2-n )，...，(D n ，V j-s-n-n )]Wherein Vj-s-n-n = Vj-s-n + Vsi;
merged post-delivery planning
TS j-p-n ＝[(D 1 ，V j-ts-1-n )，(D 2 ，V j-ts-2-n )，...，(D n ，V j-ts-n-n )]In which V is j-ts-n-n ＝V j-ts-n +V tsi 。
Preferably, in the method S4, determining whether the current production capacity of the plant meets the new plan includes the following steps:
obtaining the j-day maximum production capacity C of a factory j-d-max Maximum stacking capacity V of storage yard j-s-max Daily maximum transport capacity V j-ts-max ；
The production planning, the stacking planning and the transportation planning requirements of the new production planning each day are compared, and the requirements are met:
C j-n-n ≤C j-d-max 、V j-s-n-n ≤V j-s-max 、V j-ts-n-n ≤V j-ts-max ，
then factory j may produce the order.
Preferably, the method S5 evaluates a plant meeting a new production plan, a new stacking plan, and a new transportation plan, and includes the following steps:
establishing a hierarchical analysis model according to each factory and the production capacity of the factory;
and (5) sequencing the hierarchical lists of the models and checking the consistency to obtain the optimal factory.
Preferably, the step of performing the hierarchical order and consistency check on the model to obtain the optimal plant comprises the following steps:
(1) Judging a matrix A of a production capacity component of a factory, checking the consistency of the matrix C.R., and judging elements of the matrix A to comprise the daily average production full load rate, the daily average transportation full load rate, the yard full load rate, the engineering project transportation distance and the factory component return rate of the factory;
if the consistency C.R. is less than 0.1, the consistency degree of the judgment matrix A is within an allowable range; if the consistency C.R. is more than or equal to 0.1, correcting the judgment matrix A;
judging the weight w = [ w ] of the matrix A 1 、w 2 、w 3 、w 4 、w 5 ]；
(2) The judgment matrix B for the capacity component of each plant includes the judgment matrix B of the daily average production full load rate 1 Judgment matrix B of daily average transport full load rate 2 And a judgment matrix B of the full load rate of the storage yard 3 And a judgment matrix B of the transport distance of the engineering project 4 And a judgment matrix B of the return rate of the factory components 5 Checking consistency C.R. of all judgment matrixes;
if the consistency C.R. <0.1, the consistency degree of the judgment matrix B is within an allowable range; if the consistency C.R. is more than or equal to 0.1, correcting the judgment matrix B;
the weights of the individual capacities of each plant are obtained:
Figure BDA0003800733690000061
Figure BDA0003800733690000062
Figure BDA0003800733690000063
Figure BDA0003800733690000064
Figure BDA0003800733690000065
(3) Obtaining a total ranking weight w for each plant t-n ＝(w 1 *w B1-n +w 2 *w B2-n +w 3 *w B3-n +w 4 *w B4-n +w 5 *w B5-n )。
The second aspect of the invention discloses a multi-factory production optimizing configuration system, which comprises
The order acquisition unit is used for acquiring orders which cannot be produced by a factory;
the order planning unit is used for generating the plan of the order according to the information of the order, and the plan of the order comprises production plan, stacking plan and transportation plan;
the planning and merging unit is used for merging the planning of the orders into the existing planning of each factory to form a new planning;
the factory capacity judging unit is used for judging whether the production capacity of each factory meets a new plan or not;
the order decomposition unit is used for equally dividing the order into a plurality of new orders;
and a plant evaluation selection unit for evaluating the conformity of the plant satisfying the new plan and assigning the order to the plant whose evaluation is optimal.
A third aspect of the present invention discloses a computer storage medium storing computer instructions for executing the multi-factory production optimal configuration method as described above when the computer instructions are invoked.
The fourth aspect of the present invention discloses an electronic device, wherein the electronic device includes:
a processor; and a memory arranged to store computer executable instructions that, when executed, cause the processor to perform the multi-plant production optimization configuration method as described above.
The invention has the beneficial effects that:
according to the production optimization configuration method for multiple factories, orders which cannot be produced in factories are planned again and matched with each factory, so that factories most suitable for producing orders are found, and the problem that order production cannot be completed is solved. The invention realizes the timely distribution of orders through the joint operation of multiple factories, can match the optimal factory for production, and ensures that the orders can be produced in time.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
FIG. 2 is a model diagram of the hierarchical analysis established in accordance with the present invention;
FIG. 3 is a matrix diagram of the decision matrix A according to the present invention;
FIG. 4 is a matrix diagram of matrix B1 of the present invention;
FIG. 5 is a block schematic diagram of the system of the present invention.
Detailed Description
In order to facilitate understanding of those skilled in the art, the present invention is further described below with reference to the following examples and the accompanying drawings, which are not intended to limit the present invention. The present invention is described in detail below with reference to the attached drawings.
The first embodiment is as follows:
the method for optimizing and configuring multiple factory production according to the present embodiment, as shown in fig. 1, includes the following steps:
s1, obtaining an order which cannot be produced in a factory;
s2, generating a production plan, a stacking plan and a transportation plan according to the information of the order;
s3, integrating the production plan, the stacking plan and the transportation plan of the order into the existing plan of each factory to form a new production plan, a new stacking plan and a new transportation plan;
s4, judging whether the production capacity of each factory meets new production planning, stacking planning and transportation planning or not;
s5, evaluating factories meeting new production planning, stacking planning and transportation planning;
and S6, distributing the order to the factory with the optimal evaluation.
Specifically, the present embodiment is described by taking a PC component as an example, and a plurality of PC components are factory-united to manage production data in the same manner. In the embodiment, the order which cannot be produced by the PC component factory is obtained first, the information of the order, including basic delivery date, period, transportation period, etc., is obtained, corresponding plans are generated for the order, including production plan, stacking plan, and transportation plan, then the plans of the order are combined with the plans of each factory to form a new plan, whether each factory has the capability or not is judged according to the new plan, the production requirement is met, all factories meeting the requirement are evaluated again, the optimal factory is judged, and the order is distributed to the optimal factory, so that the optimal matching of the order is realized, and the problem that the order cannot be finished due to the production capacity of a single factory or other reasons is avoided. Furthermore, when the order is not matched with the optimal factory, the original order is split, for example, the original order is split equally, and then the split order is subjected to matching work of the conventional factory again until the factory can match, so that each order can be produced by the factory. In the embodiment, the combination of multiple factories is realized, the unfinished orders can be matched with a new factory in time, the orders can be split, and the orders can be produced in time.
More specifically, the specific method of this embodiment is as follows:
s1, obtaining an order which cannot be produced in a factory;
order delivery information O obtained in the unit project of the construction project i ＝(D si ，V i ，T di ，T ti N) in which D si A date of delivery for the order; v i Is the component square amount (m) of each delivery 3 )；T di Cycle (days) for delivery; t is ti As the transit period (days); n is the number of deliveries.
S2, generating a production plan, a stacking plan and a transportation plan according to the information of the order, which specifically comprises the following steps:
(1) Obtaining a production plan:
PC component factories generally require component stocking for unit projects in advance, typically 2 levels,
thus, the order production start date is D pi-s ＝D si -2*T di ；
End of order date of production D pi-e ＝D pi-s -n*T di ；
The average daily production requirement over the production period is
Figure BDA0003800733690000091
The production schedule of the order is
P p-i ＝[(D pi-s ，C di )，(D pi-s +1，C di )，......，(D pi-e ，C di )]；
(2) Acquiring a stacking plan:
date of commencement of Stacking D si-s ＝D pi-s +T di ；
End of Stacking date D si-e ＝D pi-s +2*T di ；
Volume V of stacked components in stacking time period si ＝2*V i ；
The stacking of the order is planned as
S p-i ＝[(D si-s ，V si )，(D si-s +1，V si )，......，(D si-e ，V si )]；
(3) Acquiring a transportation plan:
date of each shipment D tsi-s-n ＝D si-n +(n-1)*T di ；
End of delivery date D of each time tsi-d-n ＝D si-n +(n-1)*T di +*T ti ；
Daily transport capacity requirement within a transport period
Figure BDA0003800733690000101
The transportation of the order is planned as
TS p-i ＝[(D tsi-s-1 ，V tsi )，(D tsi-s-1 +1，V tsi )，......，(D tsi-s-n ，V tsi )]。
S3, incorporating the production planning, stacking planning and transportation planning of the order into the existing planning of each factory to form new production planning, stacking planning and transportation planning, which specifically comprises the following steps:
(1) Acquiring the current production plan, stacking and transportation plan of a factory j:
production planning
P j-p ＝[(D 1 ，C j-1 )，(D 2 ，C j-2 )，......，(D n ，C j-n )]；
Stack planning
S j-p ＝[(D 1 ，V j-s-1 )，(D 2 ，V j-s-2 )，......，(D n ，V j-s-n )]；
Transportation planning
TS j-p ＝[(D 1 ，V j-ts-1 )，(D 2 ，V j-ts-2 )，......，(D n ，V j-ts-n )]；
(2) And substituting the order production, stacking and transportation plans into the existing plan of the factory to generate a new plan, taking the production plan as an example, summing the production volume of two plans with the same date, and if D5= Dpi-s +1, then the production volume Cj-5-n = Cj-5+ Cdi of D5, so that:
merged post production planning
P j-p-n ＝[(D 1 ，C j-1-n )，(D 2 ，C j-2-n )，......，(D n ，C j-n-n )]Wherein, C j-n-n ＝C j-n +C di ；
Post merger stack planning
S j-p-n ＝[(D 1 ，V j-s-1-n )，(D 2 ，V j-s-2-n )，...，(D n ，V j-s-n-n )]Wherein, V j-s-n-n ＝V j-s-n +V si ；
Post-merger transportation planning
TS j-p-n ＝[(D 1 ，V j-ts-1-n )，(D 2 ，V j-ts-2-n )，......，(D n ，V j-ts-n-n )]In which V is j-ts-n-n ＝V j-ts-n +V tsi 。
S4, judging whether the production capacity of each factory meets new production planning, stacking planning and transportation planning, specifically:
obtaining the j-day maximum production capacity C of a factory j-d-max Maximum stacking capacity V of storage yard j-s-max Day maximum transport capacity V j-ts-max ；
The daily production planning, stacking planning and transportation planning requirements of the new production planning are compared, and simultaneously the requirements of:
C j-n-n ≤C j-d-max 、V j-s-n-n ≤V j-s-max 、V j-ts-n-n ≤V j-ts-max ，
factory j may produce the order.
S5, evaluating the factory meeting the new production plan, stacking plan and transportation plan, specifically:
(1) As shown in fig. 2, a hierarchical analysis model is established according to each plant and the production capacity of the plant;
(2) The method comprises the following steps of sequencing the hierarchical lists of the models and checking consistency to obtain an optimal factory, and specifically comprises the following steps:
in a criterion layer, judging a matrix A of a production capacity component of a factory, wherein the judgment matrix A is shown in figure 3, and checking the consistency of the matrix C.R., and elements of the judgment matrix A comprise the daily average production full load rate, the daily average transportation full load rate, the yard full load rate, the engineering project transportation distance and the factory component return rate of the factory;
if the consistency C.R. <0.1 indicates that the consistency degree of the judgment matrix A is considered to be in an allowable range, the calculation of the weight vector can be carried out by using the characteristic vector of A; if the consistency C.R. is more than or equal to 0.1, correcting the judgment matrix A;
judging the weight w = [ w ] of the matrix A 1 、w 2 、w 3 、w 4 、w 5 ]；
(2) At the scheme level, a judgment matrix B is formed for the production capacity component of each factory, and the judgment matrix B comprises a judgment matrix B of daily average production full load rate 1 (as shown in FIG. 4), a judgment matrix B of daily average transport full load rate 2 Judging matrix B of stock yard full load rate 3 Judgment matrix B of engineering project transportation distance 4 And a judgment matrix B of return rate of factory components 5 Checking consistency C.R. of all judgment matrixes;
if the consistency C.R. <0.1 indicates that the consistency degree of the judgment matrix B is considered to be in an allowable range, the calculation of the weight vector can be carried out by using the characteristic vector of B; if the consistency C.R. is more than or equal to 0.1, correcting the judgment matrix B;
the weight of each production capacity (i.e. each individual index) of each plant is obtained:
Figure BDA0003800733690000131
Figure BDA0003800733690000132
Figure BDA0003800733690000133
Figure BDA0003800733690000134
Figure BDA0003800733690000135
(3) The criteria layer and the scheme layer perform an overall ordering consistency check,when CR is less than 0.1, the total sequence is passed; calculate the Total order weight w for each plant t-n ＝(w 1 *w B1-n +w 2 *w B2-n +w 3 *w B3-n +w 4 *w B4-n +w 5 *w B5-n ) Then the optimal plant can be determined according to the total sorting weight.
And S6, after the total sorting weight is calculated, distributing the order to a factory with the optimal evaluation, namely the maximum total sorting weight.
Further, when judging whether the production capacity of each factory meets the new production plan, stacking plan and transportation plan, if all factories can not meet the order requirements, equally dividing the order, and then dividing the order into O orders i ＝(D si ，V i ，T di ，T ti N) resolution
Comprises the following steps: o is i-1 ＝(D si ，V i /2，T di ，T ti ，n)、O i-2 ＝(D si ，V i /2，T di ，T ti ，n)......；
And carrying out S2-S4 operation on the split order again until a factory meets the order requirement.
In this embodiment, the order that cannot be produced by the factory is re-planned and matched with each factory, so that the factory most suitable for producing the order is found, and the problem that the order cannot be produced is avoided. The invention realizes the timely distribution of orders through the joint operation of multiple factories, can match the optimal factory for production, and ensures that the orders can be produced in time.
Example two:
the system for optimizing and configuring multiple factories provided by the embodiment comprises
The order acquisition unit is used for acquiring orders which cannot be produced by a factory;
the order planning unit is used for generating the plan of the order according to the information of the order, and the plan of the order comprises production plan, stacking plan and transportation plan;
the planning and merging unit is used for merging the planning of the orders into the existing planning of each factory to form a new planning;
the factory capacity judging unit is used for judging whether the production capacity of each factory meets a new plan or not;
the order decomposition unit is used for equally dividing the order into a plurality of new orders;
and the factory evaluation selection unit is used for evaluating the conformity of the factory meeting the new plan and distributing the order to the factory with the optimal evaluation.
Specifically, in this embodiment, a PC component is taken as an example for explanation, first, an order that cannot be completed by a PC component factory is obtained through an order obtaining unit, relevant information on the order is obtained, a corresponding production plan, stacking plan and transportation plan are generated from the information of the order through an order planning unit, the plan of the order is merged with an original plan of each factory through a plan merging unit to form a new plan, then, whether the production capacity of each factory meets the new plan is judged through a factory capacity judging unit according to the new plan, if there is a factory meeting the requirement, the factory meeting the requirement is evaluated through a factory evaluation selecting unit, an optimal factory is screened, and the order is allocated to the optimal factory for production. During the period, if the order matching cannot be found in the new factory, the order is equally split through the order splitting unit, the split order is re-planned and matched with the new factory, and if the project matching does not exist, the order is split again until the factory matching order exists. That is, the system of this embodiment can operate a plurality of factories in a united manner, redistribute incomplete orders until an optimal matching factory is selected, avoid the situation that incomplete orders are delayed or cannot be delivered on time, and have very high practicability.
Example three:
the embodiment discloses a computer storage medium storing a computer program for electronic data exchange, wherein the computer program enables a computer to execute part or all of the steps of the multi-factory production optimization configuration method described in the first embodiment.
Example four:
the present embodiment discloses a computer program product comprising a non-transitory computer readable storage medium storing a computer program, and the computer program is operable to cause a computer to perform some or all of the steps of the multi-fab production optimization configuration method described in the first embodiment.
Example five:
the electronic device disclosed in this embodiment, wherein the electronic device includes:
a processor; and a memory arranged to store computer executable instructions (program code), which may be an electronic memory such as a flash memory, an EEPROM (electrically erasable programmable read only memory), an EPROM, a hard disk, or a ROM. The memory has a storage space for storing program code for performing any of the method steps in the embodiments. For example, the memory space for the program code may comprise respective program codes for implementing the respective steps in the above method, respectively. The program code can be read from and written to one or more computer program products. These computer program products comprise a program code carrier such as a hard disk, a Compact Disc (CD), a memory card or a floppy disk. Such a computer program product is typically the computer-readable storage medium of embodiment four. The computer-readable storage medium may have storage sections, storage spaces, and the like similarly arranged as the memory in the electronic device of the present embodiment. The program code may be compressed, for example, in a suitable form. In general, the memory unit stores program code for performing the steps of the method according to the invention, i.e. program code readable by a processor such as the like, which, when run by an electronic device, causes the electronic device to perform the individual steps of the method described above.
Although the present invention has been described with reference to the above preferred embodiments, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (10)

1. A multi-factory production optimization configuration method is characterized by comprising the following steps:
s1, obtaining an order which cannot be produced in a factory;
s2, generating a production plan, a stacking plan and a transportation plan according to the information of the order;
s3, merging the production plan, the stacking plan and the transportation plan of the order into the existing plans of various factories to form new production plan, stacking plan and transportation plan;
s4, judging whether the production capacity of each factory meets new production planning, stacking planning and transportation planning or not;
s5, evaluating factories meeting new production planning, stacking planning and transportation planning;
and S6, distributing the order to the factory with the optimal evaluation.
2. The method of claim 1, wherein the configuration method comprises: when judging whether the production capacity of each factory meets the new production plan, stacking plan and transportation plan, if all factories can not meet the order requirements, equally dividing and splitting the order, and performing the processes of the methods S1 to S4 on the split order again until the factories meet the order requirements.
3. The method for optimizing the configuration of multi-factory production according to claim 1, wherein the method S2 generates a production plan, a stacking plan and a transportation plan according to the information of the order, and comprises the following steps:
(1) The information of the order includes:
order delivery information O i ＝(D si ，V i ，T di ，T ti ，n)，
D si A date of delivery for the order;
V i is the amount of the component (m) delivered each time 3 )；
T dt Cycle (days) for delivery;
T ti as the transit period (days);
n is the number of deliveries;
(2) Obtaining a production plan:
order beginning date of production D pi-s ＝D si -2*T di ；
End of order date D pi-e ＝D pi-s -n*T di ；
Average daily production requirement over a production period
Figure FDA0003800733680000021
The production plan of the order is
P p-i ＝[(D pi-s ，C di )，(D pi-s +1，C di )，......，(D pi-e ，C di )]；
(3) Acquiring a stacking plan:
date of commencement of Stacking D si-s ＝D pi-s +T di ；
End of Stacking date D st-e ＝D pi-s +2*T di ；
Volume V of stacked components in stacking time period si ＝2*V i ；
The stacking of the order is planned as
S p-i ＝[(D si-s ，V si )，(D si-s +1，V si )，......，(D si-e ，V si )]；
(4) Acquiring a transportation plan:
date of each shipment D tsi-s-n ＝D si-n +(n-1)*T di ；
End date of each shipment D tsi-d-n ＝D si-n +(n-1)*T di +*T ti ；
Daily transport capacity requirement within a transport period
Figure FDA0003800733680000022
The transportation plan of the order is
TS p-i ＝
[(D tsi-s-1 ，V tsi )，(D tsi-s-1 +1，V tsi )，......，(D tsi-s-n ，V tsi )]。
4. The method of claim 3, wherein in the method S3, the production plan, the stack plan and the transportation plan of the order are integrated into the existing plans of the factories to form a new production plan, stack plan and transportation plan, and the method comprises the following steps:
(1) Acquiring the current production plan, stacking and transportation plan of a factory j:
production planning:
P j-p ＝[(D 1 ，C j-1 )，(D 2 ，C j-2 )，......，(D n ，C j-n )]；
and (3) stacking planning:
S j-p ＝[(D 1 ，V j-s-1 )，(D 2 ，V j-s-2 )，......，(D n ，V j-s-n )]；
transportation planning:
TS j-p ＝[(D 1 ，V j-ts-1 )，(D 2 ，V j-ts-2 )，......，(D n ，V j-ts-n )]；
(2) And substituting the order production, stacking and transportation plans into the existing plan of the factory to generate a new plan:
and (3) merging to plan production:
P j-p-n ＝[(D 1 ，C j-1-n )，(D 2 ，C j-2-n) ，......，(D n ，C j-n-n )]wherein, in the process, j-n-n ＝C j-n +C di ；
and (3) merging and stacking planning:
S j-p-n ＝[(D 1 ，V j-s-1-n )，(D 2 ，V j-s-2-n )，...，(D n ，V j-s-n-n )]wherein V is j-s-n-n ＝V j-s-n +V si ；
And (3) merging and then planning transportation:
TS j-p-n ＝
[(D 1 ，V j-ts-1-n )，(D 2 ，V j-ts-2-n )，......，(D n ，V j-ts-n-n )]in which V is j-ts-n-n ＝V j-ts-n +V tsi 。
5. The method of claim 1, wherein the step of determining whether the current capacity of the factory meets the new schedule in the method S4 comprises the following steps:
obtaining the j-day maximum production capacity C of a factory j-d-max Maximum stacking capacity V of storage yard j-s-max Day maximum transport capacity V j-ts-max ；
The daily production planning, stacking planning and transportation planning requirements of the new production planning are compared, and simultaneously the requirements of:
C j-n-n ≤C j-d-max 、V j-s-n-n ≤V j-s-max 、V j-ts-n-n ≤V j-ts-max ，
then factory j may produce the order.
6. The method of claim 1, wherein the configuration method comprises: the method S5 evaluates factories meeting new production plans, stacking plans and transportation plans, and comprises the following steps:
establishing a hierarchical analysis model according to the production capacity of each factory and the factory;
and (5) sequencing the hierarchical lists of the models and checking the consistency to obtain the optimal factory.
7. The method as claimed in claim 6, wherein the step of obtaining the optimal plant by the hierarchical single ordering and consistency check of the models comprises the following steps:
(1) Judging a matrix A of a production capacity component of a factory, checking the consistency of the matrix C.R., and judging elements of the matrix A to comprise the daily average production full load rate, the daily average transportation full load rate, the yard full load rate, the engineering project transportation distance and the factory component return rate of the factory;
if the consistency C.R. <0.1, the consistency degree of the judgment matrix A is within an allowable range; if the consistency C.R. is more than or equal to 0.1, correcting the judgment matrix A;
judging the weight w = [ w ] of the matrix A 1 、w 2 、w 3 、w 4 、w 5 ]；
(2) The judgment matrix B comprises a judgment matrix B of daily average production full load rate for the production capacity component of each factory 1 Judgment matrix B of daily average transport full load rate 2 Judging matrix B of stock yard full load rate 3 Judgment matrix B of engineering project transportation distance 4 And a judgment matrix B of return rate of factory components 5 Carrying out consistency C.R. checking calculation on all judgment matrixes;
if the consistency C.R. <0.1, the consistency degree of the judgment matrix B is within an allowable range; if the consistency C.R. is more than or equal to 0.1, correcting the judgment matrix B;
obtain the weight of the individual production capacities of each plant:
Figure FDA0003800733680000051
Figure FDA0003800733680000052
Figure FDA0003800733680000053
Figure FDA0003800733680000054
Figure FDA0003800733680000055
(3) Obtaining a total ranking weight w for each plant t-n ＝(w 1 *w B1-n +w 2 *w B2-n +w 3 *w B3-n +w 4 *w B4-n +w 5 *w B5-n )。
8. A multi-factory production optimal configuration system is characterized in that: comprises that
The order acquisition unit is used for acquiring orders which cannot be produced by a factory;
the order planning unit is used for generating the plan of the order according to the information of the order, and the plan of the order comprises production plan, stacking plan and transportation plan;
the planning merging unit is used for merging the planning of the orders into the existing planning of each factory to form a new planning;
the factory capacity judging unit is used for judging whether the production capacity of each factory meets a new plan or not;
the order decomposition unit is used for equally dividing the order into a plurality of new orders;
and the factory evaluation selection unit is used for evaluating the conformity of the factory meeting the new plan and distributing the order to the factory with the optimal evaluation.
9. A computer storage medium storing computer instructions which, when invoked, perform the multi-fab production optimization configuration method of any of claims 1-7.
10. An electronic device, wherein the electronic device comprises:
a processor; and the number of the first and second groups,
a memory arranged to store computer executable instructions that, when executed, cause the processor to perform the multi-fab production optimization configuration method of any of claims 1-7.
CN202210982491.9A 2022-08-16 2022-08-16 Multi-factory production optimization configuration method, system, storage medium and electronic equipment Pending CN115330059A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210982491.9A CN115330059A (en) 2022-08-16 2022-08-16 Multi-factory production optimization configuration method, system, storage medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210982491.9A CN115330059A (en) 2022-08-16 2022-08-16 Multi-factory production optimization configuration method, system, storage medium and electronic equipment

Publications (1)

Publication Number Publication Date
CN115330059A true CN115330059A (en) 2022-11-11

Family

ID=83924128

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210982491.9A Pending CN115330059A (en) 2022-08-16 2022-08-16 Multi-factory production optimization configuration method, system, storage medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN115330059A (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002169605A (en) * 2000-11-30 2002-06-14 Canon Inc Production system, production plan making device and recording medium
CN113269447A (en) * 2021-05-28 2021-08-17 深圳市时代速信科技有限公司 IC semiconductor order management method and device

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002169605A (en) * 2000-11-30 2002-06-14 Canon Inc Production system, production plan making device and recording medium
CN113269447A (en) * 2021-05-28 2021-08-17 深圳市时代速信科技有限公司 IC semiconductor order management method and device

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
爱德华•佛莱哲利: "《物流战略咨询 供应链一体化的方法论、工具和实践》", 中国财政经济出版社 *
王重玺等: "基于模糊层次分析法的IC代工厂选择方法" *

Similar Documents

Publication Publication Date Title
Zhang et al. New model of the storage location assignment problem considering demand correlation pattern
Zhong et al. Territory planning and vehicle dispatching with driver learning
WO2022262469A1 (en) Industrial park logistics scheduling method and system based on game theory
US7213007B2 (en) Method for forecasting using a genetic algorithm
Hemmati et al. Make-to-order/make-to-stock partitioning decision using the analytic network process
US20050131947A1 (en) Data processing system and method
Zhang et al. Integrated production planning and warehouse storage assignment problem: An IoT assisted case
Gravel et al. A multicriterion view of optimal resource allocation in job-shop production
CN108846623A (en) Based on the complete vehicle logistics dispatching method and device of multiple target ant group algorithm, storage medium, terminal
CN108647914A (en) Production scheduling method, apparatus, computer equipment and storage medium
CN111027902B (en) Unmanned warehouse goods transportation matching method and device
CN109214756A (en) Based on ant group algorithm and the complete vehicle logistics dispatching method and device of hierarchy optimization, storage medium, terminal
CN110471923A (en) A kind of processing method and processing device of block chain transaction record
Guo et al. Storage assignment for newly arrived items in forward picking areas with limited open locations
Yang et al. Mathematical modeling of multi-plant order allocation problem and solving by genetic algorithm with matrix representation
CN114676875A (en) Storage distribution network optimization method, equipment, storage medium and program product
JP2013171481A (en) Process plan creation system
CN115330059A (en) Multi-factory production optimization configuration method, system, storage medium and electronic equipment
JP6877378B2 (en) Product layout planning system and product layout planning method
Reddy Muppani et al. Class-based storage-location assignment to minimise pick travel distance
Rasouli et al. A robust LINMAP for EFQM self assessment
Kargari Esfand Abad et al. A multi-objective optimization model for split pollution routing problem with controlled indoor activities in cross docking under uncertainty
JP5056962B2 (en) Sales production delivery system and sales production delivery method for steel strip products
Hossain et al. PSO-based harmony search algorithm to aggregate production planning under possibilistic environment
Rasi et al. Production and distribution scheduling optimisation in a three-stage integrated supply chain using genetic algorithm

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination