Industrial programming method and apparatus, device, storage medium, and program product

US2024169291A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2024169291-A1
Application numberUS-202418424206-A
CountryUS
Kind codeA1
Filing dateJan 26, 2024
Priority dateJul 30, 2021
Publication dateMay 23, 2024
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

An industrial programming method and apparatus, a device, a storage medium, and a program product are provided. In a programming scheme generation method, a programming device obtains a first group of constraints for a plurality of parameters in an industrial programming job. Further, the programming device constructs, based on the first group of constraints, a cut constraint associated with at least one integer parameter in the plurality of parameters, and constructs a second group of constraints based on the cut constraint and the first group of constraints, where a type of the at least one integer parameter in the second group of constraints is changed. The programming device determines values of the plurality of parameters based on the second group of constraints, to generate a programming scheme for the industrial programming job.

First claim

Opening claim text (preview).

1 . An industrial production planning method, comprising: obtaining a first group of constraints for a plurality of production planning parameters in an industrial production planning job, wherein the plurality of production planning parameters comprise at least a production quantity of a producer; constructing, based on the first group of constraints, a cut constraint associated with at least one integer parameter in the plurality of production planning parameters; constructing a second group of constraints based on the cut constraint and the first group of constraints, wherein a type of the at least one integer parameter in the second group of constraints is changed; and determining values of the plurality of production planning parameters based on the second group of constraints, to generate a production plan for the industrial production planning job. 2 . The method according to claim 1 , wherein the obtaining a first group of constraints for a plurality of production planning parameters in an industrial production planning job comprises: determining job information associated with the industrial production planning job from a user input, wherein the job information indicates at least the plurality of production planning parameters to be determined, parameter constraints related to the values of the plurality of production planning parameters, and a production planning target related to the industrial production planning job; and constructing the first group of constraints based on the job information. 3 . The method according to claim 1 , wherein the constructing, based on the first group of constraints, a cut constraint associated with at least one integer parameter in the plurality of production planning parameters comprises: identifying the at least one integer parameter from the plurality of production planning parameters; determining, from the first group of constraints, a target constraint associated with the at least one integer parameter; and constructing, based on the target constraint, the cut constraint associated with the at least one integer parameter. 4 . The method according to claim 1 , wherein the constructing, based on the first group of constraints, a cut constraint associated with at least one integer parameter in the plurality of production planning parameters comprises: determining, from a user input, an identifier of a cut construction scheme for constructing the cut constraint; determining a target construction scheme based on the identifier from a group of cut constraint construction schemes; and constructing, based on the target construction scheme, the cut constraint associated with the at least one integer parameter. 5 . The method according to claim 4 , wherein the group of cut constraint construction schemes comprise at least one of the following: a probing cut constraint construction scheme, a gomory cut constraint construction scheme, an intersection cut constraint construction scheme, a T-space cut constraint construction scheme, or a lower bound conflict— driven cut constraint construction scheme. 6 . The method according to claim 1 , wherein the constructing a second group of constraints based on the cut constraint and the first group of constraints comprises: converting the first group of constraints into a corresponding group of relaxation constraints by removing an integer value constraint of the at least one integer parameter; and constructing the second group of constraints based on the cut constraint and the group of relaxation constraints. 7 . An industrial programming method, comprising: obtaining, by using at least one processor, a first group of constraints for a plurality of parameters in an industrial programming job; constructing, by using the at least one processor based on the first group of constraints, a cut constraint associated with at least one integer parameter in the plurality of parameters; constructing, by using the at least one processor, a second group of constraints based on the cut constraint and the first group of constraints, wherein a type of the at least one integer parameter in the second group of constraints is changed; and determining, by using the at least one processor, values of the plurality of parameters based on the second group of constraints, to generate a programming scheme for the industrial programming job. 8 . The method according to claim 7 , wherein the industrial programming job comprises one of the following: an industrial production planning job, a resource scheduling job, a route programming job, or a target location job. 9 . The method according to claim 7 , wherein the obtaining a first group of constraints for a plurality of parameters in an industrial programming job comprises: determining job information associated with the industrial programming job from a user input, wherein the job information indicates at least the plurality of parameters to be determined, parameter constraints related to the values of the plurality of parameters, and a target related to the industrial programming job; and constructing the first group of constraints based on the job information. 10 . The method according to claim 7 , wherein the constructing, based on the first group of constraints, a cut constraint associated with at least one integer parameter in the plurality of parameters comprises: identifying the at least one integer parameter from the plurality of parameters; determining, from the first group of constraints, a target constraint associated with the at least one integer parameter; and constructing, based on the target constraint, the cut constraint associated with the at least one integer parameter. 11 . The method according to claim 7 , wherein the constructing, based on the first group of constraints, a cut constraint associated with at least one integer parameter in the plurality of parameters comprises: determining, from a user input, an identifier of a cut construction scheme for constructing the cut constraint; determining a target construction scheme based on the identifier from a group of cut constraint construction schemes; and constructing, based on the target construction scheme, the cut constraint associated with the at least one integer parameter. 12 . The method according to claim 11 , wherein the group of cut constraint construction schemes comprise at least one of the following: a probing cut constraint construction scheme, a gomory cut constraint construction scheme, an intersection cut constraint construction scheme, a T-space cut constraint construction scheme, or a lower bound conflict— driven cut constraint construction scheme. 13 . The method according to claim 7 , wherein the constructing a second group of constraints based on the cut constraint and the first group of constraints comprises: converting the first group of constraints into a corresponding group of relaxation constraints by removing an integer value constraint of the at least one integer parameter; and constructing the second group of constraints based on the cut constraint and the group of relaxation constraints. 14 . An electronic device, comprising: at least one processor; at least one memory, wherein the at least one memory is coupled to the at least one processor and stores instructions to be executed by the at least one processor, and when the instructions are executed by the at least one processor, the electronic device is enabled to perform operations comprising: obtaining a first group of constraints for a plurality of production planning parameters in an industrial production planning job, where

Assignees

Inventors

Classifications

  • G05B19/418Primary

    Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] · CPC title

  • Resource planning in a project environment · CPC title

  • Manufacturing · CPC title

  • Resource planning, allocation, distributing or scheduling for enterprises or organisations · CPC title

  • Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2024169291A1 cover?
An industrial programming method and apparatus, a device, a storage medium, and a program product are provided. In a programming scheme generation method, a programming device obtains a first group of constraints for a plurality of parameters in an industrial programming job. Further, the programming device constructs, based on the first group of constraints, a cut constraint associated with at…
Who is the assignee on this patent?
Huawei Tech Co Ltd
What technology area does this patent fall under?
Primary CPC classification G05B19/418. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu May 23 2024 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).