Method for generating near-optimal sequencing of manufacturing tasks subject to user-given hard and soft constraints
US6662167B1 · kind B1 · utility
Inventor
Key dates
| Filing date | Dec 15, 1999 |
| Grant date | Dec 9, 2003 |
| Priority date | — |
| Expiry date | Dec 15, 2019 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S706/912
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present invention provides a method utilizing evolutionary processes for solving partial constraint satisfaction problems in order to produce a near-optimal or optimal sequence of products for manufacture. More specifically, a computer implemented method for generating an optimized sequence of “N” number of products for manufacture is provided, where said products are of “M” number of distinct types with a fixed number (“Nt”) of each type being desired and each product type comprising an array (“Q”) of distinct features, wherein said manufacture is optionally constrained by one or more of the following constraints: the production requirement for each product type, feature-based position equations, and feature-based position inequalities, wherein each of said constraints is individually designated as either a hard constraint which cannot be violated, or as a soft constraint which can be violated at a predetermined cost; said method comprising: generating an initial population of chromosomes, wherein each chromosome represents a feasible sequence of products of various types for manufacture, feasibility depending on satisfaction of …
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.