CN116108987A - Method, system, equipment and medium for making scheduling plan - Google Patents
Method, system, equipment and medium for making scheduling plan Download PDFInfo
- Publication number
- CN116108987A CN116108987A CN202310063682.XA CN202310063682A CN116108987A CN 116108987 A CN116108987 A CN 116108987A CN 202310063682 A CN202310063682 A CN 202310063682A CN 116108987 A CN116108987 A CN 116108987A
- Authority
- CN
- China
- Prior art keywords
- packaging
- target
- production
- scheduling
- unit
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000004806 packaging method and process Methods 0.000 claims abstract description 328
- 238000004519 manufacturing process Methods 0.000 claims abstract description 133
- 238000005457 optimization Methods 0.000 claims abstract description 71
- 238000004590 computer program Methods 0.000 claims description 13
- 230000000737 periodic effect Effects 0.000 claims description 7
- 238000003860 storage Methods 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 18
- 230000000694 effects Effects 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 20
- 238000012856 packing Methods 0.000 description 11
- 238000012545 processing Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000009776 industrial production Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001681 protective effect Effects 0.000 description 1
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
- 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
-
- 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)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biodiversity & Conservation Biology (AREA)
- Educational Administration (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- General Factory Administration (AREA)
Abstract
The invention provides a method, a system, equipment and a medium for making a scheduling plan. The method comprises the following steps: acquiring package production information corresponding to a target batch; constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; and solving the target optimization model to obtain the scheduling plan of the target batch. The method simplifies the planning process of the scheduling plan. Meanwhile, in the process of solving the scheduling plan by the target optimization model, the participation of scheduling plan making personnel is not needed, the problem that the quality of the scheduling plan is greatly influenced by personnel experience under the condition of large data volume of the packaging unit is solved, and the scheduling plan with the optimal productivity balancing effect is formed.
Description
Technical Field
The invention relates to the technical field of intelligence, in particular to a method, a system, equipment and a medium for making a scheduling plan.
Background
In the production of automobiles, there is a need to transport parts required for vehicle assembly to the vehicle assembly site due to business needs. In order to avoid damage to the components during transportation, a method is often used in which the components in the semi-bulk of the vehicle are packaged to form a packaging unit which can have a certain protective effect. Therefore, how to arrange the production order of the packaging units becomes a problem to be solved.
In the prior art, when the production sequence of the packaging units is arranged, the scheduling plan making personnel need to consider the conditions of the feeding date of each part in the packaging units, the binding relation among part of the packaging units, the adjacent relation of the similar packaging units and the like, so that the scheduling plan making process becomes complex and complicated. Meanwhile, as the data volume of the packaging unit is increased, the scheduling plan making process is greatly influenced by personnel experience, and finally, the scheduling plan with the optimal productivity balancing effect is difficult to obtain.
Disclosure of Invention
Based on the above, the application provides a method, a system, equipment and a medium for making a scheduling plan.
In a first aspect of an embodiment of the present invention, a method for making a scheduling plan is provided, including:
acquiring packaging production information corresponding to a target batch, wherein the packaging production information comprises the periodic task amount of the target batch in each working period, a packaging station for packaging each packaging unit and required packaging man-hour;
constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; wherein the constraints include a scheduling order constraint between each of the packaging units, a predetermined production cycle of the target lot, and an earliest permitted production cycle of each of the packaging units; the optimization target is that the target difference is minimum;
wherein the target difference is: a difference in ratio between the cycle task amounts of the plurality of the work cycles and a ratio between total hours within the predetermined production cycle; wherein the total time of the working period is the time required for producing the packaging unit corresponding to the working period.
Solving the target optimization model to obtain a scheduling plan of the target batch; wherein the scheduling plan includes correspondence between the plurality of packaging units of the target lot and the work cycle.
Optionally, the earliest permitted production cycle is determined by:
obtaining a supply plan for each packaged object, and packaging standards for each packaging unit, wherein the supply plan comprises the number of the packaged objects in each type, which are transported to the packaging stations in each working period, and the packaging standards comprise: the packaging unit is used for packaging various packaged objects and the quantity of each packaged object;
determining the work cycle of the packaged objects which are conveyed to the packaging station and which meet the packaging standard at the earliest based on the supply plan of each packaged object, the type of the packaged objects which are loaded by each packaging unit and the quantity of each packaged object; the earliest permitted production cycle for each of the packaging units.
Optionally, the scheduling plan includes: each packaging station obtains a production schedule of the target batch by solving the target optimization model when the target packaging unit packaged in each packaging period and the total work required for packaging the target packaging unit are finished, and the production schedule comprises the following steps:
determining a working period corresponding to each packaging unit by taking the constraint condition as constraint, and obtaining at least one pending production schedule of a plurality of packaging units;
calculating at least one target difference value of the pending scheduling plans;
and determining the pending scheduling plan with the minimum target difference as the scheduling plan of the target batch.
Optionally, after obtaining the scheduling plan, the method further comprises:
acquiring a plurality of target packaging units to be packaged at each packaging station based on the scheduling plan;
and optimizing the arrangement sequence of the target packaging units packaged by each packaging station based on the packaged objects packaged by the target packaging units, so as to obtain an optimized production scheduling.
Optionally, the optimizing the arrangement sequence of the target packaging units packaged by each packaging station based on the packaged objects packaged by each of the target packaging units to obtain an optimized production schedule includes:
obtaining a unit name corresponding to the target packaging unit, wherein the unit name is used for representing the type of the packaged object in the target packaging unit;
clustering a plurality of target packaging units based on the unit names to obtain at least one packaging unit group;
and arranging the target packaging units in each packaging unit group according to a target production sequence, wherein the target production sequence is that the target packaging units in the packaging unit group are produced according to adjacent time sequences.
Optionally, the clustering processing is performed on the plurality of target packaging units based on the unit names to obtain at least one packaging unit group, which includes:
removing symbols in the names and/or removing Chinese characters representing directions in the names to obtain processed unit names;
and classifying the target packaging units with the same names of the processed units into the same packaging unit group.
The second aspect of the embodiment of the invention also provides a system for making a scheduling plan, which comprises:
the information acquisition module is used for acquiring packaging production information corresponding to a target batch, wherein the packaging production information comprises the periodic task quantity of the target batch in each working period, a packaging station for packaging each packaging unit and required packaging man-hour;
the model construction module is used for constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; wherein the constraints include a scheduling order constraint between each of the packaging units, a predetermined production cycle of the target lot, and an earliest permitted production cycle of each of the packaging units; the optimization target is that the target difference is minimum;
wherein the target difference is: a difference in ratio between the cycle task amounts of the plurality of the work cycles and a ratio between total hours within the predetermined production cycle; wherein the total time of the working period is the time required for producing the packaging unit corresponding to the working period.
The solving module is used for solving the target optimization model to obtain a scheduling plan of the target batch; wherein the scheduling plan includes correspondence between the plurality of packaging units of the target lot and the work cycle.
The third aspect of the embodiment of the invention also provides an electronic device, which comprises a memory, a processor and a computer program stored on the memory, wherein the processor executes the computer program to implement the method for planning production scheduling according to the first aspect.
A fourth aspect of the embodiments of the present invention also provides a computer readable storage medium having stored thereon a computer program/instruction which, when executed by a processor, implements the method of planning a scheduling according to the first aspect.
The invention provides a method, a system, equipment and a medium for making a scheduling plan. The method comprises the following steps: acquiring packaging production information corresponding to a target batch, wherein the packaging production information comprises the periodic task amount of the target batch in each working period, a packaging station for packaging each packaging unit and required packaging man-hour; constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; wherein the constraints include a scheduling order constraint between each of the packaging units, a predetermined production cycle of the target lot, and an earliest permitted production cycle of each of the packaging units; the optimization target is that the target difference is minimum; wherein the target difference is: a difference in ratio between the cycle task amounts of the plurality of the work cycles and a ratio between total hours within the predetermined production cycle; wherein the total time of the working period is the time required for producing the packaging unit corresponding to the working period. Solving the target optimization model to obtain a scheduling plan of the target batch; wherein the scheduling plan includes correspondence between the plurality of packaging units of the target lot and the work cycle.
Based on packaging production information, the invention builds the target optimization model comprising constraint conditions and optimization targets, solves the obtained target optimization model and finally realizes the establishment of the scheduling plan. The method simplifies the planning process of the scheduling plan. Meanwhile, in the process of solving the scheduling plan by the target optimization model, the participation of scheduling plan making personnel is not needed, the problem that the quality of the scheduling plan is greatly influenced by personnel experience under the condition of large data volume of the packaging unit is solved, and the scheduling plan with the optimal productivity balancing effect is formed.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments of the present invention will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a step diagram of a method for planning scheduling according to an embodiment of the present invention;
FIG. 2 is a step diagram of a method for determining an earliest permitted production cycle in accordance with an embodiment of the present invention;
FIG. 3 is a step diagram of a method for solving a target optimization model provided by an embodiment of the present invention;
FIG. 4 is a step diagram of another method for planning production scheduling according to an embodiment of the present invention;
FIG. 5 is a step diagram of a method for optimizing a scheduling plan according to an embodiment of the present invention;
FIG. 6 is a flow chart of a scenario for planning a scheduling plan according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of a system for planning scheduling according to an embodiment of the present invention;
fig. 8 is a schematic diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings in the embodiments of the present invention. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
The first aspect of the present invention proposes an embodiment, as shown in the step diagram of a method for planning a scheduling plan shown in fig. 1, the method is applied to a scheduling planning server, and the method includes:
step S101, obtaining packaging production information corresponding to a target lot, where the packaging production information includes a cycle task amount of the target lot in each working cycle, a packaging station for packaging each packaging unit, and required packaging man-hours.
Duty cycle, i.e. the unit time used to calculate production efficiency in industrial production. The working period generally has two metering modes of a daily system and a shift system, wherein the daily system takes one working day as one working period, and the shift system takes one shift as one working period. In a duty cycle metering manner on a per-shift basis, there may be multiple duty cycles in a workday.
In order to distinguish management modes of small differences among the same products among different customers in a production process, different batches of packaging units correspond to different packaging production information, wherein the packaging production information comprises a plurality of attribute values of one packaging unit.
The package production information includes: the target lot is at the cycle task amount of each work cycle, and the packing station and packing man-hours required for packing each packing unit.
The cycle task amount of each working cycle may be represented by the number of finished packaging units produced in the working cycle by the target batch or the total capacity contribution value, and the maximum total capacity contribution value of the working cycle is 80, the total capacity contribution value of the packaging units of the target batch is 100, the target batch is produced in two working cycles as an example, the cycle task amount of the target batch in the two working cycles is smaller than the maximum capacity contribution value of the working cycle 80, and the cycle task amount of the two working cycles is distributed in a mode that the total cycle task amount of the two working cycles is 100, for example, the cycle task amount of the first working cycle is 20, and the cycle task amount of the second working cycle is 80.
The packaging station refers to a working unit for producing packaging units, each packaging unit corresponds to one packaging station, and the time required for producing one packaging unit by the packaging station is packaging man-hour.
Step S102, constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; wherein the constraints include a scheduling order constraint between each of the packaging units, a predetermined production cycle of the target lot, and an earliest permitted production cycle of each of the packaging units; the optimization target is that the target difference is minimum; wherein the target difference is: a difference in ratio between the cycle task amounts of the plurality of the work cycles and a ratio between total hours within the predetermined production cycle; wherein the total time of the working period is the time required for producing the packaging unit corresponding to the working period. The target optimization model is a data processing process for processing package production information to obtain a scheduling plan. The target optimization model comprises constraint conditions and an optimization target, wherein the constraint conditions are used for determining a feasible scheduling plan according to the package production information, and the optimization target is used for determining a final scheduling plan from the feasible scheduling plans.
Constraints included in the target optimization model are a scheduling order constraint between each of the packaging units, a permissible duty cycle for each of the packaging units, and an earliest permissible duty cycle for each of the packaging units.
Because the types of packaged items in each packaging unit are different, or are limited by other external constraints such as production data required to produce the packaging units, one packaging unit is limited to having to be produced before or after another packaging unit, i.e., a scheduling order constraint between packaging units.
The predetermined production cycle of the target lot, i.e. the work cycle of the target lot, is predetermined, and in general, the predetermined production cycle of the target lot, i.e. in which work cycles the packaging units in the target lot are produced, is predetermined. The earliest permitted production cycle of a packaging unit is the earliest possible production cycle of the packaging unit.
The optimization objective is to minimize the difference between the ratio between the cycle task amounts of the plurality of the work cycles within the predetermined production cycle and the ratio between the total hours.
If the cycle task amount of the target working cycle is represented by the total capacity contribution value of the packaging units produced by the target batch in the target working cycle, taking the case that the preset production cycle comprises a first working cycle and a second working cycle as an example, if the cycle task amount of the first working cycle is 80 and the cycle task amount of the second working cycle is 20, the ratio of the cycle task amounts of the working cycles in the preset production cycle is 80: the cycle task amount 20 (80:20) of the second duty cycle. The ratio between the total man-hour of the first work cycle (the time period required for producing the packaging unit corresponding to the first work cycle) and the total man-hour of the second work cycle (the time period required for producing the packaging unit corresponding to the second work cycle) should be as close as possible to 80:20 to minimize the target difference between the two.
Step S103, solving the target optimization model to obtain a scheduling plan of the target batch; wherein the scheduling representation comprises correspondence between a plurality of packaging units of a target lot and the work cycle.
After the target optimization model is built, solving the target optimization model to obtain the scheduling plan of the target batch. The scheduling plan of the target lot includes correspondence between a plurality of packaging units of the target lot and a working period, and in colloquial terms, a producer can obtain from the scheduling plan in which working period the packaging units in the target lot are produced.
According to the method, based on packaging production information, a target optimization model comprising constraint conditions and optimization targets is built, the obtained target optimization model is solved, and finally, planning of a scheduling plan is achieved. The method of the embodiment simplifies the planning process of the scheduling plan. Meanwhile, in the process of solving the scheduling plan by the target optimization model, the participation of scheduling plan making personnel is not needed, the problem that the quality of the scheduling plan is greatly influenced by personnel experience under the condition of large data volume of the packaging unit is solved, and the scheduling plan with the optimal productivity balancing effect is formed.
The second aspect of the present invention proposes an embodiment, which includes, in addition to the method according to the embodiment proposed in the first aspect of the present invention:
optionally, as shown in fig. 2, which shows a step diagram of a method for determining an earliest permitted production cycle, the step of determining an earliest permitted production cycle includes:
step S201, obtaining a supply plan of each packaged object, and a packaging standard of each packaging unit, where the supply plan includes a number of packaged objects in each type that are transported to the packaging station in each working cycle, and the packaging standard includes: the packaging unit is used for packaging various packaged objects and the quantity of each packaged object.
Step S202, determining a work cycle of the packaged objects which are delivered to the packaging station and which meet the packaging standard at the earliest based on the supply plan of each packaged object, the type of packaged objects which are loaded by each packaging unit and the number of each packaged object.
One or more packaged objects are packaged in one packaging unit, and before the packaging unit is produced, the packaged objects packaged by the packaging unit need to be transported from a storage warehouse or other places to a packaging station so as to realize the production of the packaging unit, namely, the quantity and the types of the packaged objects positioned on the packaging station meet the packaging standard of the packaging unit.
The number and type of packages at each packaging station can be determined on the basis of the supply schedule of packages in each working cycle. The type and number of objects to be packaged at the packaging station are compared with the type and number of objects to be packaged in the packaging standard of each packaging unit, and if the type at the packaging station matches the type in the packaging standard and the number of objects to be packaged at the packaging station is greater than the number in the packaging standard, the packaging unit is considered to be producible at the work cycle. The work cycle at which the packaging unit can be produced at the earliest is called the work cycle at which the packaging criteria are met at the earliest.
Step S203, determining the work cycle which meets the packaging standard at earliest as the earliest permitted production cycle of each packaging unit.
And determining the earliest permitted production period of the packaging unit according to the type of the packaged objects of the packaging unit and the quantity of each packaged object and combining the supply plan of the packaged objects. Wherein the earliest permitted production cycle is satisfied, and all packaged articles required for producing the packaging units have been transported to the packaging station prior to the earliest permitted production cycle.
Optionally, the scheduling plan includes: each of the packing stations packs the target packing units and the total man-hours required for packing the target packing units in each of the packing cycles, as shown in a step diagram of a method for solving a target optimization model shown in fig. 3, the step S103 includes:
and step S1031, determining a working period corresponding to each packaging unit by taking the constraint condition as a constraint, and obtaining at least one pending production schedule of a plurality of packaging units.
And arranging the corresponding relation between each packaging unit and the working period by taking the constraint condition as the constraint, and determining the corresponding relation between the packaging units meeting the constraint condition and the working period as a pending scheduling plan. In the arrangement process, the working period corresponding to the packaging units with the production sequence constraint can be determined based on the preset production period of the target batch and the earliest allowable production period of the packaging units, and then the packaging units without the production sequence constraint are arranged.
Step S1032, calculating at least one target difference value of the pending scheduling plans.
And calculating a target difference value of the to-be-scheduled scheduling plan based on the obtained to-be-scheduled scheduling plan.
Step S1033, determining the pending scheduling plan with the smallest target difference as the scheduling plan of the target lot.
Optionally, as shown in the step diagram of another scheduling method shown in fig. 4, the method includes, in addition to steps S101-S103, the steps of:
in the packaging unit production process, the actual time for producing the packaging unit by the packaging station includes, in addition to the packaging man-hours, the time for replacing the mold used for producing the packaging unit. Therefore, to increase the production efficiency of the packaging station, the number of mold changes should be reduced.
The mould required for producing the packaging unit is determined by the type of the packaged objects packaged by the packaging unit, and the packaged objects can be packaged by using the same mould, so that the packaging units of the packaged objects with similar packaging appearance or other attributes are arranged in a mode of adjacent time sequence, and the replacement times of the mould can be effectively reduced.
Based on this, after obtaining the scheduling plan, the scheduling plan may be optimized through the following steps S104 and S105, which specifically include:
step S104, acquiring a plurality of target packaging units to be packaged in each packaging station based on the scheduling plan.
Step S105, optimizing the arrangement sequence of the target packaging units packaged by each packaging station based on the packaged objects packaged by each of the target packaging units, so as to obtain an optimized production scheduling.
Alternatively, as shown in the step diagram of one method for optimizing a scheduling plan shown in fig. 5, step S105 may be implemented by:
step S1051, obtaining a unit name corresponding to the target packaging unit, where the unit name is used to characterize the packaged object in the target packaging unit.
The unit name of the packing unit is used to characterize the kind of the packaged object in the packing unit, from which the appearance information of the packaged object can be known.
Step S1052, performing clustering processing on the plurality of target packaging units based on the unit names, to obtain at least one packaging unit group.
Based on the unit names, clustering processing is carried out on the packaging units, and the packaging units for packaging the packaged objects with similar appearance are grouped into a group so as to obtain a packaging unit group.
And step S1053, arranging the target packaging units in each packaging unit group according to a target production sequence, wherein the target production sequence is that the target packaging units in the packaging unit group are produced according to adjacent time sequences.
The target packaging units in each packaging unit group are arranged to be produced in adjacent time sequences, so that the target packaging units in the same packaging unit group are produced without changing the mould, the time required for changing the mould in the production process is reduced, and the production efficiency is further improved.
Alternatively, step S1052 may be implemented by:
and step 1, removing symbols in the names, and/or removing Chinese characters expressing directions in the names to obtain the processed unit names.
The unit names of the packaging units usually comprise functional symbols such as "+," # ", or" - ", besides the phrase for representing the type of the packaged object, and the symbols are irrelevant to the die required for producing the packaging units, so that the symbols irrelevant to the selection of the die can be removed before the clustering process, and the interference of the clustering process is avoided.
Meanwhile, the packaging units for packaging the packaged objects with mirror symmetry or similar appearance can be produced by using the same die, and the packaging units with the characteristics usually have Chinese characters with directions indicated by 'front', 'rear', 'left', 'right', and the like in unit names, and can be clustered after removing the Chinese characters with directions indicated in the unit names.
And step 2, classifying the processed target packaging units with the same unit name into the same packaging unit group.
Clustering treatment, namely classifying packaging units using the same die in production. The target packaging units with the same names after treatment indicate that the packaged objects are similar in appearance, and the same mould can be used for production, so that the target packaging units with the same names after treatment are classified into the same packaging unit group.
A third aspect of the present invention proposes an embodiment, as shown in a scenario flowchart for planning a scheduling plan shown in fig. 6, the method includes:
and acquiring packaging production information corresponding to the target batch, wherein the packaging production information comprises the periodic task amount of the target batch in each working period, and a packaging station and required packaging man-hour for packaging each packaging unit.
And constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target. The constraint conditions include: the scheduling order constraint between each packaging unit, the preset production period of the target batch and the earliest permitted production period of each packaging unit are optimized, and the optimization target is that the difference between the ratio between the cycle task amounts of a plurality of working cycles in the preset production period and the ratio between the total working hours is the smallest.
Wherein the step of obtaining an earliest permitted production cycle for each packaging unit comprises: obtaining a supply plan of each packaged object and a packaging standard of each packaging unit, wherein the supply plan comprises the number of the packaged objects of each type which are conveyed to a packaging station in each working cycle; determining the work cycle of the packaged objects conveyed to the packaging station based on the supply plan of each packaged object, the type of the packaged objects loaded by each packaging unit and the quantity of each packaged object, wherein the work cycle meets the packaging standard at the earliest; the earliest permitted production cycle for each packaging unit.
And then, solving the target optimization model by utilizing an optimization solver to obtain the scheduling plan. The step of solving the target optimization model specifically comprises the following steps: determining a working period corresponding to each packaging unit by taking the constraint condition as constraint, and obtaining at least one pending production schedule of a plurality of packaging units; calculating a target difference value corresponding to each packaging station in at least one pending production scheduling plan; and determining the pending scheduling plan with the minimum target difference as the scheduling plan.
After the production schedule is obtained, in order to further improve the production efficiency of the packaging station, the obtained production schedule needs to be optimized to reduce the number of times the packaging station changes the mold. The step of optimizing the scheduling plan specifically includes:
acquiring a plurality of target packaging units to be packaged at each packaging station based on a production scheduling plan; obtaining a unit name corresponding to the target packaging unit, wherein the unit name is used for representing the type of the packaged object in the target packaging unit; removing symbols in the names and/or removing Chinese characters representing the directions in the names to obtain the processed unit names; and classifying the processed target packaging units with the same unit name into the same packaging unit group. And then, arranging the target packaging units in each packaging unit group according to a target production sequence, wherein the target production sequence is that the target packaging units in the packaging unit group are produced according to adjacent time sequences.
The invention also provides a system for planning production scheduling, as shown in a structural schematic diagram of a system for planning production scheduling shown in fig. 7, the system comprises:
the information acquisition module is used for acquiring packaging production information corresponding to a target batch, wherein the packaging production information comprises the periodic task quantity of the target batch in each working period, a packaging station for packaging each packaging unit and required packaging man-hour;
the model construction module is used for constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; wherein the constraints include a scheduling order constraint between each of the packaging units, a predetermined production cycle of the target lot, and an earliest permitted production cycle of each of the packaging units; the optimization target is that the target difference is minimum;
wherein the target difference is: a difference in ratio between the cycle task amounts of the plurality of the work cycles and a ratio between total hours within the predetermined production cycle; wherein the total time of the working period is the time required for producing the packaging unit corresponding to the working period.
The solving module is used for solving the target optimization model to obtain a scheduling plan of the target batch; wherein the scheduling plan includes correspondence between the plurality of packaging units of the target lot and the work cycle.
Optionally, the system further comprises:
a cycle determining module, configured to obtain a supply plan of each packaged object, and a packaging standard of each packaging unit, where the supply plan includes a number of packaged objects in each work cycle, and the packaging standard includes: the packaging unit is used for packaging various packaged objects and the quantity of each packaged object; determining the work cycle of the packaged objects which are conveyed to the packaging station and which meet the packaging standard at the earliest based on the supply plan of each packaged object, the type of the packaged objects which are loaded by each packaging unit and the quantity of each packaged object; the earliest permitted production cycle for each of the packaging units.
Optionally, the solving module is further configured to determine a working period corresponding to each packaging unit by using the constraint condition as a constraint, so as to obtain at least one pending production plan of a plurality of packaging units; calculating at least one target difference value of the pending scheduling plans; and determining the pending scheduling plan with the minimum target difference as the scheduling plan of the target batch.
Optionally, the apparatus further comprises:
the optimizing module is used for acquiring a plurality of target packaging units to be packaged in each packaging station based on the scheduling plan; and optimizing the arrangement sequence of the target packaging units packaged by each packaging station based on the packaged objects packaged by the target packaging units, so as to obtain an optimized production scheduling.
Optionally, the optimizing module further includes:
the execution module is used for acquiring a unit name corresponding to the target packaging unit, wherein the unit name is used for representing the type of the packaged object in the target packaging unit; clustering a plurality of target packaging units based on the unit names to obtain at least one packaging unit group; and arranging the target packaging units in each packaging unit group according to a target production sequence, wherein the target production sequence is that the target packaging units in the packaging unit group are produced according to adjacent time sequences.
Optionally, the execution module further includes:
the clustering module is used for removing symbols in the names and/or removing Chinese characters expressing directions in the names to obtain processed unit names; and classifying the target packaging units with the same names of the processed units into the same packaging unit group.
The embodiment of the invention also provides electronic equipment, and referring to fig. 8, fig. 8 is a schematic diagram of the electronic equipment according to the embodiment of the application. As shown in fig. 8, the electronic device 100 includes: the memory 110 and the processor 120 are in communication connection through a bus, and a computer program is stored in the memory 110 and can run on the processor 120, so that the steps of a method for making a scheduling plan disclosed in the embodiment of the application are realized.
Embodiments of the present application also provide a computer readable storage medium having stored thereon a computer program/instruction which, when executed by a processor, implements a method of scheduling as disclosed in embodiments of the present application.
Based on packaging production information, the invention builds the target optimization model comprising constraint conditions and optimization targets, solves the obtained target optimization model and finally realizes the establishment of the scheduling plan. The method simplifies the planning process of the scheduling plan. Meanwhile, in the process of solving the scheduling plan by the target optimization model, the participation of scheduling plan making personnel is not needed, the problem that the quality of the scheduling plan is greatly influenced by personnel experience under the condition of large data volume of the packaging unit is solved, and the scheduling plan with the optimal productivity balancing effect is formed.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described by differences from other embodiments, and identical and similar parts between the embodiments are all enough to be referred to each other.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, systems, electronic devices, and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, create a system for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the scope of the embodiments of the invention.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or terminal device comprising the element.
The foregoing has outlined rather broadly the principles and embodiments of the present invention in order that the detailed description of the method, system, apparatus and medium that is provided herein may be better understood, and in order that the present invention may be better suited for use in conjunction with the detailed description that follows; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.
Claims (9)
1. A method of planning production scheduling, comprising:
acquiring packaging production information corresponding to a target batch, wherein the packaging production information comprises the periodic task amount of the target batch in each working period, a packaging station for packaging each packaging unit and required packaging man-hour;
constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; wherein the constraints include a scheduling order constraint between each of the packaging units, a predetermined production cycle of the target lot, and an earliest permitted production cycle of each of the packaging units; the optimization target is that the target difference is minimum;
wherein the target difference is: a difference in ratio between the cycle task amounts of the plurality of the work cycles and a ratio between total hours within the predetermined production cycle; the total time of the working period is the time length required for producing the packaging unit corresponding to the working period;
solving the target optimization model to obtain a scheduling plan of the target batch; wherein the scheduling plan includes correspondence between the plurality of packaging units of the target lot and the work cycle.
2. The method of claim 1, wherein the earliest permitted production cycle is determined by:
obtaining a supply plan of each packaged object and a packaging standard of each packaging unit, wherein the supply plan comprises the number of the packaged objects in each type, which are conveyed to the packaging stations in each working period; the packaging criteria include: the packaging unit is used for packaging various packaged objects and the quantity of each packaged object;
determining the work cycle of the packaged objects which are conveyed to the packaging station and which meet the packaging standard at the earliest based on the supply plan of each packaged object, the type of the packaged objects which are loaded by each packaging unit and the quantity of each packaged object;
the work cycle that earliest meets the packaging criteria is determined as the earliest permitted production cycle of the packaging unit.
3. The method of claim 1, wherein the scheduling plan comprises: each packaging station obtains a production schedule of the target batch by solving the target optimization model when the target packaging unit packaged in each packaging period and the total work required for packaging the target packaging unit are finished, and the production schedule comprises the following steps:
determining a working period corresponding to each packaging unit by taking the constraint condition as constraint, and obtaining at least one pending production schedule of a plurality of packaging units;
calculating at least one target difference value of the pending scheduling plans;
and determining the pending scheduling plan with the minimum target difference as the scheduling plan of the target batch.
4. The method of claim 1, wherein after obtaining the scheduling plan, the method further comprises:
acquiring a plurality of target packaging units to be packaged at each packaging station based on the scheduling plan;
and optimizing the arrangement sequence of the target packaging units packaged by each packaging station based on the packaged objects packaged by the target packaging units, so as to obtain an optimized production scheduling.
5. The method of claim 4, wherein optimizing the order of arrangement of the target packaging units packaged at each of the packaging stations based on the packaged objects packaged at each of the plurality of target packaging units, to obtain an optimized production plan, comprises:
obtaining a unit name corresponding to the target packaging unit, wherein the unit name is used for representing the type of the packaged object in the target packaging unit;
clustering a plurality of target packaging units based on the unit names to obtain at least one packaging unit group;
and arranging the target packaging units in each packaging unit group according to a target production sequence, wherein the target production sequence is that the target packaging units in the packaging unit group are produced according to adjacent time sequences.
6. The method of claim 5, wherein clustering the plurality of target packaging units based on the unit names to obtain at least one packaging unit group comprises:
removing symbols in the names and/or removing Chinese characters representing directions in the names to obtain processed unit names;
and classifying the target packaging units with the same names of the processed units into the same packaging unit group.
7. A system for planning production scheduling, comprising:
the information acquisition module is used for acquiring packaging production information corresponding to a target batch, wherein the packaging production information comprises the periodic task quantity of the target batch in each working period, a packaging station for packaging each packaging unit and required packaging man-hour;
the model construction module is used for constructing a target optimization model based on the package production information, wherein the target optimization model comprises constraint conditions and an optimization target; wherein the constraints include a scheduling order constraint between each of the packaging units, a predetermined production cycle of the target lot, and an earliest permitted production cycle of each of the packaging units; the optimization target is that the target difference is minimum;
wherein the target difference is: a difference in ratio between the cycle task amounts of the plurality of the work cycles and a ratio between total hours within the predetermined production cycle; the total time of the working period is the time length required for producing the packaging unit corresponding to the working period;
the solving module is used for solving the target optimization model to obtain a scheduling plan of the target batch; wherein the scheduling plan includes correspondence between the plurality of packaging units of the target lot and the work cycle.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory, wherein the processor executes the computer program to implement the method of scheduling of any one of claims 1 to 6.
9. A computer readable storage medium having stored thereon a computer program/instruction which, when executed by a processor, implements a method of scheduling according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310063682.XA CN116108987A (en) | 2023-01-13 | 2023-01-13 | Method, system, equipment and medium for making scheduling plan |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310063682.XA CN116108987A (en) | 2023-01-13 | 2023-01-13 | Method, system, equipment and medium for making scheduling plan |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116108987A true CN116108987A (en) | 2023-05-12 |
Family
ID=86266958
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310063682.XA Pending CN116108987A (en) | 2023-01-13 | 2023-01-13 | Method, system, equipment and medium for making scheduling plan |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116108987A (en) |
-
2023
- 2023-01-13 CN CN202310063682.XA patent/CN116108987A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Naeem et al. | Production planning optimization for manufacturing and remanufacturing system in stochastic environment | |
| US20070150332A1 (en) | Heuristic supply chain modeling method and system | |
| Singh et al. | An EOQ inventory model for deteriorating items with time-dependent deterioration rate, ramp-type demand rate and shortages | |
| CN112132546A (en) | Method and device for scheduling production | |
| CN102004954A (en) | Product information system and information integration method of product design system | |
| CN106371416A (en) | Assembly control method and assembly control system for assembly line | |
| CN110705946A (en) | Cargo assembling method and cargo assembling system | |
| CN107844936A (en) | Variation, device, terminal and the computer-readable recording medium of BOM | |
| CN110705805A (en) | Cargo assembling method and device, storage medium and electronic device | |
| CN111985862A (en) | Method and apparatus for locating inventory items | |
| CN114626745A (en) | Scheduling plan generation method, system, medium and electronic terminal | |
| Figueiras et al. | Big data provision for digital twins in industry 4.0 logistics processes | |
| Pattanaik | Simulation optimization of manufacturing takt time for a leagile supply chain with a de-coupling point | |
| CN102222285A (en) | Multi-dimensional data linkage computing device and multi-dimensional data linkage computing method | |
| CN106909992B (en) | Split charging production method and device of multi-variety small-batch mixed flow assembly line | |
| CN116108987A (en) | Method, system, equipment and medium for making scheduling plan | |
| Overbeck et al. | Development and analysis of digital twins of production systems | |
| CN110717718A (en) | Goods assembly method and device based on big data platform | |
| CN109978386A (en) | A kind of visualization inventory system and its visual management method based on supply chain | |
| CN115907161A (en) | Method, device, equipment and medium for optimizing material distribution and transportation | |
| CN115375024A (en) | Method and system for predicting and reminding purchasing based on bom material loss | |
| CN114091770A (en) | Prediction analysis method, device, equipment and storage medium for material demand plan | |
| WO2016113844A1 (en) | Supply chain design device, supply chain design method, and program | |
| CN113762842A (en) | Warehouse scheduling method, server and system | |
| CN112396332A (en) | Data synchronization method, device, equipment and medium based on multi-vehicle part change |
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 |